Submission #1176872

#TimeUsernameProblemLanguageResultExecution timeMemory
1176872ElayV13Ljeto (COCI21_ljeto)C++20
0 / 50
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main(){
    int n;
    cin >> n;
    vector < pair < int , pair < int , int > > > A;
    for(int i = 1;i <= n;i++)
    {
        int t , a , b;
        cin >> t >> a >> b;
        A.push_back({t , {a , b}});
    }
    sort(A.begin() , A.end());
    map < int , int > last;
    for(int i = 1;i <= 8;i++) last[i] = -1;
    int bl = 0 , pi = 0;
    for(pair < int , pair < int , int > > pp : A)
    {
        int t = pp.first;
        int a = pp.second.first;
        int b = pp.second.second;
        if(a <= 4){
            pi += 100;
        }
        else{
            bl += 100;
        }
        if(last[a] == -1){
            last[a] = t;
            continue;
        }
        else{
            if(last[a] - t <= 10){
                if(a <= 4){
                    pi += 50;
                }
                else{
                    bl += 50;
                }
                last[a] = t;
            }
        }
    }
    cout << pi << ' ' << bl << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...