# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
851330 |
2023-09-19T15:05:39 Z |
pakapu |
Ljeto (COCI21_ljeto) |
C++17 |
|
1 ms |
348 KB |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int f_cnt = 0;
int s_cnt = 0;
int last_t[9];
for(int i = 1; i < 9; i++) {
last_t[i] = -100;
}
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int t, a, b;
cin >> t >> a >> b;
if(a >= 1 && a <= 4) {
f_cnt += 100;
if(last_t[a] + 10 >= t) {
f_cnt += 50;
}
}
else {
s_cnt += 100;
if(last_t[a] + 10 >= t) {
s_cnt += 50;
}
}
last_t[a] = t;
}
cout << f_cnt << ' ' << s_cnt << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |