oj.uz

답안 #658372

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658372 2022-11-13T03:07:31 Z Foxyy Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define Foxyy cin.tie(0); cout.sync_with_stdio(0); cout.tie(0);

struct Solver {
	int& n;
	
	void solve() {
		int score[2]{};
		vector<int> lastSprayTime(8, -11);
		for (int spray = 0; spray < n; spray++) {
			int t, a, b;
			cin >> t >> a >> b;
			a--, b--;
			int atkTeam = (a >= 4);
			score[atkTeam] += 100;
			if (t - lastSprayTime[a] <= 10) {
				score[atkTeam] += 50;
			}
			lastSprayTime[a] = t;
		}
		cout << score[0] << ' ' << score[1] << '\n';
	}
};

signed main() {
	Foxyy
	
	int T = 1;
//	cin >> T;
	while(T--) {
		int n;
		cin >> n;
		
		Solver solver{n};
		solver.solve();
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

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