# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
499536 |
2021-12-28T14:58:50 Z |
Ibraheem |
Ljeto (COCI21_ljeto) |
C++14 |
|
1 ms |
324 KB |
#include<bits/stdc++.h>
using namespace std;
int a[9];
int main(){
a[1] = 1;
a[2] = 1;
a[3] = 1;
a[4] = 1;
a[5] = 1;
a[6] = 1;
a[7] = 1;
a[8] = 1;
long long n, r , i , p = 0 , k , t , o = 0;
cin >> n;
i = n;
while(n > 0){
cin >> t >> r >> k;
if(t - a[r] > 10){
if(r <= 4){
o = o + 100;
}
if(r >= 5){
p = p + 100;
}
}
if(n < i && t - a[r] <= 10){
if(r <= 4){
o = o + 150;
}if(r >= 5){
p = p + 150;
}
}
a[k] = 0;
a[r] = t;
n--;
}
cout << o << ' ' << p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
276 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
324 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
276 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
324 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |