# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87187 | jvalsortav | Preokret (COCI18_preokret) | C++14 | 4 ms | 544 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>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <set>
using namespace std;
int a, b, x, br, ba, bb, y;
set <int> ak, bk;
int aj = 1, bj = 0;
int main() {
cin >> a;
for (int i = 0; i < a; i++){
cin >> x;
ak.insert(x);
if (x <= 1440) br++;
}
cin >> b;
for (int i = 0; i < b; i++){
cin >> x;
bk.insert(x);
if (x <= 1440) br++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |