| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 836016 | exodus_ | Ljeto (COCI21_ljeto) | C++14 | 1 ms | 260 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;
const int maxn = 1e3+3;
int t[maxn];
int a[maxn], b[maxn];
int main() {
int n;
cin >> n;
int tima=0, timb=0;
for(int i=1; i<=n; i++) {
cin >> t[i] >> a[i] >> b[i];
if(a[i]>=1 && a[i]<=4) {
tima+=100;
}
if(a[i]>=5 && a[i]<=8) {
timb+=100;
}
}
for(int i=2; i<=n; i++) {
if(t[i]-t[i-1] <= 10 && a[i]==a[i-1]) {
if(a[i]>=1 && a[i]<=4) tima+=50;
if(a[i]>=5 && a[i]<=8) timb+=50;
}
}
cout << tima << " " << timb << 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... | ||||
