# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171281 | Su1tan | Preokret (COCI18_preokret) | C++14 | 4 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define sz size
#define pb push_back
const int N = 3e3 + 123;
int n, m, a, b, ans1, ans, l;
map <int, bool> team;
vector <int> v;
int main() {
//freopen("input.txt", "r", stdin);
cin >> n;
for(int i = 1; i <= n; ++i) {
int k;
cin >> k;
v.pb(k);
if(k <= 1440) ++ans1;
team[k] = 0;
}
cin >> m;
for(int i = 1; i <= m; ++i) {
int k;
cin >> k;
if(k <= 1440) ++ans1;
v.pb(k);
team[k] = 1;
}
cout << ans1 << "\n";
if(!team[v[0]]) {
l = 1;
++a;
}
else {
l = 0;
++b;
}
sort(v.begin(), v.end());
for(int i = 1; i < v.sz(); ++i) {
if(!team[v[i]]) ++a;
else ++b;
if(a > b && l == 1 && b != 0) {
l = 0;
++ans;
}
if(a < b && l == 0 && a != 0) {
l = 1;
++ans;
}
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |