| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1108617 | huantran | Ljeto (COCI21_ljeto) | C++17 | 1 ms | 504 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>
using namespace std;
using ll = long long int;
const int maxn = 2e5 + 5;
const int oo = 1e9 + 7;
const ll inf = 1e18;
int tt[10], point[10], n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < 10; i++)
tt[i] = -oo;
for (int i = 1; i <= n; i++) {
int t, a, b;
cin >> t >> a >> b;
point[a] += 100;
if (t - tt[a] <= 10)
point[a] += 50;
tt[a] = t;
}
cout << point[1] + point[2] + point[3] + point[4] << ' ' << point[5] + point[6] + point[7] + point[8];
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
