제출 #1176886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1176886		mrbeast	Ljeto (COCI21_ljeto)	C++17	0 / 50	0 ms	324 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false);
#define ff first 
#define ss second 
#define pb push_back
#define skip continue
#define intt int
#define all(v) v.begin(),v.end()
using pii=pair<int,int>;
const int MOD=1e9+7;
const int MAX=5e5+1;
#define int long long
map<int,vector<int>>g;
vector<int>dis;
int a[MAX],segt[4*MAX];
void solve(){
    int n;
    cin>>n;
    vector<pii>v(n);
    for(int i=0;i<n;i++){
        int a;
        cin>>v[i].ff>>v[i].ss>>a;
        if(v[i].ss<5) v[i].ss=1;
        else v[i].ss=2;
    }
    int t1=0,t2=0,prev=-100,prevt=3;
    for(int i=0;i<n;i++){
        if(v[i].ss==1){
            t1+=100;
            if(prev+10>=v[i].ff and prevt==1) t1+=50;
            prev=v[i].ff;
            prevt=1;
        }else if(v[i].ss==2){
            t2+=100;
            if(prev+10>=v[i].ff and prevt==2) t2+=50;
            prev=v[i].ff;
            prevt=1;
        }
    }
    cout<<t1<<" "<<t2;
}
signed main(){
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 25