제출 #1345719

#제출 시각아이디문제언어결과실행 시간메모리
1345719msb.83Ljeto (COCI21_ljeto)C++20
50 / 50
0 ms344 KiB
//Rahman ve Rahim olan Allah'ın adıyla
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mid ((st+end)/2)
#define fi first
#define se second
const int INF=1e15+5;
const int E16=1e6;
const int ONE=1;
const int TWO=2;
const int ZERO=0;
const int MOD=1e9+7;//(x+MOD)%MOD
//el.erase(unique(el.begin(),el.end()),el.end());
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,T1=0,G2=0,a,b,c;cin>>n;array<vector<int>,8>arr;
    for(int i=0;i<n;i++){cin>>c>>b>>a;arr[b-1].pb(c);}
    for(int i=0;i<8;i++){
        sort(arr[i].begin(),arr[i].end());
        for(int j=0;j<arr[i].size();j++){int points=100;
            if(j!=0){if(arr[i][j-1]+10>=arr[i][j]){points+=50;}}
            if(i<=3){T1+=points;}else{G2+=points;}
        }
    }cout<<T1<<" "<<G2;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...