제출 #1341315

#제출 시각아이디문제언어결과실행 시간메모리
1341315bethanceLjeto (COCI21_ljeto)C++20
0 / 50
1 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
int main() {
	int N;
	cin >> N;
	vector<vector<pair<int, int>>> A(8, vector<pair<int, int>>());
	for (int i = 0; i < N; i++) {
		int T, A1, B;
		cin >> T >> A1 >> B;
		A1--;
		B--;
		A[A1].push_back({T, B});
	}
	int blue = 0, red = 0;
	for (int i = 0; i < 8; i++) {
		if (i <= 3) {
			for (int j = 0; j < A[i].size(); j++) {	
			blue += A[i].size() * 100;
			int curr = A[i][j].first;
			if (A[i][j + 1].first <= A[i][j].first + 10 && j < A[i].size() - 1) {
				blue += 50;
				curr = A[i][j + 1].first;
			} else {
				curr = A[i][j + 1].first;
			}
			}
		} else {
			for (int j = 0; j < A[i].size(); j++) {	
			red += A[i].size() * 100;
			int curr = A[i][j].first;
			if (A[i][j + 1].first <= A[i][j].first + 10 && j < A[i].size() - 1) {
				red += 50;
				curr = A[i][j + 1].first;
			} else {
				curr = A[i][j + 1].first;
			}
			}
		}
	}
	cout << blue << " " << red;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...