#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;cin >> n;
vector<array<int, 3> > a(n);
for(int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1] >> a[i][2];
vector<int> moves(8, INT_MIN);
sort(a.begin(), a.end());
int pa = 0, pb = 0;
for(int i = 0; i < n; i++)
{
if(a[i][1] <= 4)
{
pa += 100;
if(a[i][0] - 10 <= moves[a[i][1]]) pa += 50;
moves[a[i][1]] = a[i][0];
}
else
{
pb += 100;
if(a[i][0] - 10 <= moves[a[i][1]]) pb += 50;
moves[a[i][1]] = a[i][0];
}
}
cout << pa << ' ' << pb << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
300 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |