Submission #1176902

#TimeUsernameProblemLanguageResultExecution timeMemory
1176902fritlLjeto (COCI21_ljeto)C++20
50 / 50
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second int main(){ ll n; cin >> n; vector<array<ll, 3>>v(n); vector<ll>last(100, LLONG_MIN); ll sc1 = 0, sc2 = 0; for(ll i = 0; i < n; i++){ cin >> v[i][0] >> v[i][1] >> v[i][2]; if (v[i][1] < 5){ if (v[i][0] <= 10 + last[v[i][1]]) sc1 += 150; else sc1 += 100; } else{ if (v[i][0] <= 10 + last[v[i][1]]) sc2+=150; else sc2 += 100; } last[v[i][1]] = v[i][0]; } cout << sc1 << ' ' << sc2; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...