| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 643927 | elif | Ljeto (COCI21_ljeto) | C++17 | 1 ms | 300 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;
cin >> n;
int pa = 0, pb = 0;
map<int, int> mp;
for(int i=1; i<=8; i++)
mp[i] = -11;
for(int i=0; i<n; i++){
int t, u, v;
cin >> t >> u >> v;
int p = 100;
if(t - mp[u] <= 10)
p += 50;
mp[u] = t;
if(u < 5)
pa += p;
else pb += p;
}
cout << pa << " " << pb << endl;
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... | ||||
