# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99376 | kimcoding | Preokret (COCI18_preokret) | C++17 | 3 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 <cstdio>
int n, m;
int score[2900][2];
int main() {
int n; scanf("%d", &n);
int ans1 = 0, ans2 = 0;
for (int i = 1,x; i <= n; i++) {
scanf("%d", &x);
if (x <= 1440) ans1++;
score[x][0]++;
}
scanf("%d", &m);
for (int i = 1, x; i <= m; i++) {
scanf("%d", &x);
if (x <= 1440) ans1++;
score[x][1]++;
}
int anow = 0, bnow = 0;
bool awin = true, bwin = true;
for (int i = 0; i < 2900; i++) {
if (!score[i][0] && !score[i][1]) continue;
anow += score[i][0];
bnow += score[i][1];
if (anow > bnow) {
if (!awin) ans2++;
awin = true, bwin = false;
}
if (bnow > anow) {
if (!bwin) ans2++;
bwin = true, awin = false;
}
}
printf("%d\n%d\n", ans1, ans2);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |