# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305121 | phathnv | Preokret (COCI18_preokret) | C++11 | 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 mp make_pair
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
const int N = 3000;
int a, b;
int dif[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int points = 0, turnarounds = 0;
cin >> a;
for(int i = 1; i <= a; i++){
int x;
cin >> x;
dif[x]++;
if (x <= 1440)
points++;
}
cin >> b;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |