Submission #522228

#TimeUsernameProblemLanguageResultExecution timeMemory
522228blueLjeto (COCI21_ljeto)C++17
50 / 50
1 ms292 KiB
#include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> t(1+n), a(1+n), b(1+n); for(int i = 1; i <= n; i++) cin >> t[i] >> a[i] >> b[i]; vector<int> score(2, 0); for(int i = 1; i <= n; i++) { score[ (a[i] > 4) ] += 100; for(int j = 1; j < i; j++) { if(a[i] != a[j]) continue; if(t[i] - t[j] <= 10) { score[ (a[i] > 4) ] += 50; break; } } } cout << score[0] << ' ' << score[1] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...