| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 716475 | Sandarach151 | Ljeto (COCI21_ljeto) | C++17 | 1 ms | 212 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;
int main()
{
int n, pa = 0, pb = 0;
vector<int> last(8, -11);
cin>> n;
for (int i= 0; i <n; ++i){
int t, j1, j2;
cin>> t>> j1>> j2;
if (j1 < 5) pa += 100;
else pb += 100;
if (t- last[j1-1] <= 10){
if (j1 < 5) pa += 50;
else pb += 50;
}
last[j1 -1] = t;
}
cout<< pa<< ' ' << pb << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
