oj.uz

답안 #797023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797023 2023-07-29T04:51:28 Z tlnk07 Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 300 KB 
#include<bits/stdc++.h>
using namespace std;

long long n, pre[10], ans1 = 0, ans2 = 0, x, y, z;

int main()
{
	memset(pre, -1, sizeof(pre));
	cin >> n;
	while(n--)
	{
		cin >> x >> y >> z;
		if(pre[y] == -1)
		{
			if(y <= 4)	ans1 += 100;
			else	ans2 += 100;
		}
		else if(x - pre[y] <= 10)
		{
			if(y <= 4)	ans1 += 150;
			else	ans2 += 150;
		}
		else
		{
			if(y <= 4)	ans1 += 100;
			else	ans2 += 100;
		}
		pre[y] = x;
	}
	cout << ans1 << " " << ans2;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 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 212 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 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 212 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 300 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct