# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87294 | minhtri5302 | Preokret (COCI18_preokret) | C++14 | 3 ms | 632 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.
//Trương Minh Trí
#include <bits/stdc++.h>
#define FOR(i, x, y) for(int i = x; i <= y; ++i)
#define FORN(i, x, y) for(int i = x; i >= y; --i)
#define Task "Preokret"
#define maxn 3000
#define maxm
#define emlacongchuacuaanh 1302
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define reset(x) memset(x, 0, sizeof(x));
using namespace std;
int n, m;
int res1, res2;
pii a[maxn], b[maxn];
int scoreA, scoreB;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
//freopen(Task".inp", "r", stdin);
//freopen(Task".out", "w", stdout);
cin >> n;
FOR(i, 1, n) cin >> a[i].F, a[i].S = 1;
cin >> m;
FOR(i, 1, m) cin >> b[i].F, b[i].S = 2;
FOR(i, 1, n) if(a[i].F <= 1440) res1++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |