Submission #578898

#TimeUsernameProblemLanguageResultExecution timeMemory
578898Trisanu_DasLjeto (COCI21_ljeto)C++17
0 / 50
1 ms428 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; vector<array<int, 3> > a(n); for(int i = 0; i < n; i++) cin >> a[n][0] >> a[n][1] >> a[n][2]; vector<int> moves(8, INT_MIN); sort(a.begin(), a.end()); int pa = 0, pb = 0; for(int i = 0; i < n; i++){ if(a[i][1] <= 4){ pa += 100; if(moves[a[i][1]] + 10 >= a[i][0]) pa += 50; moves[a[i][1]] = a[i][0]; }else{ pb += 100; if(moves[a[i][1]] + 10 >= a[i][0]) pb += 50; moves[a[i][1]] = a[i][0]; } } cout << pa << ' ' << pb << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...