# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578900 | Trisanu_Das | Ljeto (COCI21_ljeto) | C++17 | 0 ms | 0 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;
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;
ok[a[i][1]] = a[i][0];
}
else
{
pb += 100;
if(a[i][0] - 10 <= moves[a[i][1]]) pb += 50;
ok[a[i][1]] = a[i][0];
}
}
cout << pa << ' ' << pb << '\n';
}