oj.uz

Submission #578903

# Submission time Handle Problem Language Result Execution time Memory
578903 2022-06-18T07:34:27 Z Trisanu_Das Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 300 KB 
#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';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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