제출 #861974

#제출 시각아이디문제언어결과실행 시간메모리
861974Youssif_ElkadiLjeto (COCI21_ljeto)C++17
50 / 50
0 ms436 KiB
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5, mod = 1e9 + 7, base = 31; int main() { int n; cin >> n; vector<int> lst(10, -1000); int a = 0, b = 0; for (int i = 0; i < n; i++) { int t, p1, p2; cin >> t >> p1 >> p2; if (p1 <= 4) a += (100 + (t - lst[p1] <= 10 ? 50 : 0)), lst[p1] = t; else b += (100 + (t - lst[p1] <= 10 ? 50 : 0)), lst[p1] = t; } cout << a << " " << b << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...