Submission #845970


Source Code Expand

#include<bits/stdc++.h>
#define PB push_back
#define MP(x,y) make_pair(x,y)
#define F first
#define S second
#define ALL(x) x.begin(),x.end()
using namespace std;

typedef double DB;
typedef long double LDB;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<int,DB> pid;
typedef pair<DB,int> pdi;
typedef pair<DB,DB> pdd;

template<typename T>
inline bool getmin(T& a,const T& b) {return b < a? (a=b,true):false;}
template<typename T>
inline bool getmax(T& a,const T& b) {return b > a? (a=b,true):false;}
template<typename T>
inline bool inrange(const T& x,const T& L,const T& R) {return L<=x && x<=R;}

const int maxn=100000+5;
vector<int> disc;
int num[maxn];
int main()
{
    int N,ans=0,badodd=0,badeven=0;
    scanf("%d",&N);
    for(int i=0;i<N;i++)
    {
        scanf("%d",num+i);
        disc.PB(num[i]);
    }
    sort(ALL(disc));
    for(int i=0;i<N;i++)
    {
        num[i]=lower_bound(ALL(disc),num[i])-disc.begin();
        if((num[i]&1)^(i&1))
        {
            if(num[i]&1) badodd++;
            else badeven++;
        }
    }
    assert(badodd==badeven);
    printf("%d\n",badodd);
}

Submission Info

Submission Time
Task C - BBuBBBlesort!
User hungchuhui
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1167 Byte
Status AC
Exec Time 56 ms
Memory 1148 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
                   ^
./Main.cpp:33:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",num+i);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 24
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 56 ms 1148 KB
02.txt AC 56 ms 1148 KB
03.txt AC 56 ms 1148 KB
04.txt AC 56 ms 1148 KB
05.txt AC 52 ms 1148 KB
06.txt AC 52 ms 1148 KB
07.txt AC 52 ms 1148 KB
08.txt AC 33 ms 1148 KB
09.txt AC 33 ms 1148 KB
10.txt AC 34 ms 1148 KB
11.txt AC 32 ms 1148 KB
12.txt AC 34 ms 1148 KB
13.txt AC 35 ms 1148 KB
14.txt AC 51 ms 1148 KB
15.txt AC 51 ms 1148 KB
16.txt AC 52 ms 1148 KB
17.txt AC 51 ms 1148 KB
18.txt AC 4 ms 256 KB
19.txt AC 4 ms 256 KB
20.txt AC 4 ms 256 KB
21.txt AC 4 ms 256 KB
22.txt AC 4 ms 256 KB
s1.txt AC 4 ms 256 KB
s2.txt AC 4 ms 256 KB