Submission #845151
Source Code Expand
Copy
#include <cstdio> #include <cstdlib> #include <cassert> #include <iostream> #include <set> #include <vector> #include <cstring> #include <string> #include <algorithm> #include <numeric> #include <cmath> #include <complex> #include <map> #include <queue> #include <array> #include <bitset> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vi> vvi; typedef vector<vl> vvl; typedef vector<double> vd; typedef vector<vd> vvd; typedef pair<int, int> pii; typedef pair<double, double> pdd; typedef vector<pii> vii; typedef vector<string> vs; int main() { int n; scanf("%d", &n); vi a(n), ts(n); for (int i = 0; i < n; ++i) { scanf("%d", &a[i]); ts[i] = a[i]; } sort(ts.begin(), ts.end()); ts.resize(unique(ts.begin(), ts.end()) - ts.begin()); int res = 0; for (int i = 0; i < n; ++i) { a[i] = lower_bound(ts.begin(), ts.end(), a[i]) - ts.begin(); if (a[i] % 2 && i % 2 == 0) ++res; } printf("%d\n", res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - BBuBBBlesort! |
User | ariacas |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 1053 Byte |
Status | AC |
Exec Time | 56 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:32:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:35:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
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 | 1024 KB |
02.txt | AC | 56 ms | 1024 KB |
03.txt | AC | 55 ms | 1024 KB |
04.txt | AC | 56 ms | 1024 KB |
05.txt | AC | 51 ms | 1024 KB |
06.txt | AC | 51 ms | 1024 KB |
07.txt | AC | 51 ms | 1024 KB |
08.txt | AC | 33 ms | 1024 KB |
09.txt | AC | 33 ms | 1024 KB |
10.txt | AC | 32 ms | 1024 KB |
11.txt | AC | 32 ms | 1024 KB |
12.txt | AC | 33 ms | 1024 KB |
13.txt | AC | 33 ms | 1024 KB |
14.txt | AC | 51 ms | 1024 KB |
15.txt | AC | 51 ms | 1024 KB |
16.txt | AC | 51 ms | 1024 KB |
17.txt | AC | 51 ms | 1024 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 |