Contest Duration: - (local time) (110 minutes) Back to Home

Submission #846677

Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int main(){
int n;
int a[100010];
scanf("%d",&n);
rep(i,n)scanf("%d",&a[i]);

vector<int> vec;
rep(i,n)vec.pb(a[i]);
sor(vec);

rep(i,n)a[i] = lb(vec,a[i]) - vec.begin();

int cnt = 0;
rep(i,n){
if(i%2 == 0 && a[i]%2 == 1)cnt ++;
}
cout << cnt << endl;
}

#### Submission Info

Submission Time 2016-08-21 21:43:47+0900 C - BBuBBBlesort! yokozuna57 C++14 (GCC 5.4.1) 600 1295 Byte AC 56 ms 1404 KB

#### Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:41:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,n)scanf("%d",&a[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 1276 KB
02.txt AC 56 ms 1276 KB
03.txt AC 56 ms 1276 KB
04.txt AC 56 ms 1276 KB
05.txt AC 52 ms 1276 KB
06.txt AC 52 ms 1276 KB
07.txt AC 52 ms 1276 KB
08.txt AC 34 ms 1276 KB
09.txt AC 34 ms 1276 KB
10.txt AC 33 ms 1276 KB
11.txt AC 37 ms 1276 KB
12.txt AC 34 ms 1276 KB
13.txt AC 36 ms 1276 KB
14.txt AC 52 ms 1276 KB
15.txt AC 53 ms 1404 KB
16.txt AC 52 ms 1276 KB
17.txt AC 52 ms 1276 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