# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255051 | Vladikus004 | Preokret (COCI18_preokret) | C++14 | 1 ms | 384 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>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 3000;
int a, b, add[N], bal, ans1, ans2, sum;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> a;
for (int i = 0; i < a; i++){
int x;
cin >> x;
add[x]++;
}
cin >> b;
for (int i = 0; i < b; i++){
int x;
cin >> x;
add[x]--;
}
bal = 0;
for (int i = 1; i <= 2880; i++){
if (i <= 1440)
ans1 += abs(add[i]);
sum += add[i];
int zn = 1;
if (sum < 0) zn = -1;
if (sum == 0) zn = bal;
if (bal != zn){
bal = zn;
ans2++;
}
}
cout << ans1 << "\n" << ans2 - 1 << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |