제출 #671039

#제출 시각아이디문제언어결과실행 시간메모리
671039NimbostratusLjeto (COCI21_ljeto)C++17
25 / 50
1 ms224 KiB
#include <bits/stdc++.h> using namespace std; using lint = long long; const int maxn = 2e5 + 5; const int inf = 1e9 + 5; const int mod = 1e9 + 7; int n; int score[2]; int player; int last[2] = {-inf, -inf}; signed main() { #ifdef Local freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout); #endif cin >> n; for(int i = 1, t, x, y; i <= n; i++) { cin >> t >> x >> y; int team = x > 4; score[team] += 100; if(t - last[team] <= 10 && player == x) score[team] += 50; last[team] = t; player = x; } cout << score[0] << " " << score[1] << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...