답안 #493744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493744 2021-12-12T18:41:00 Z niloyroot Ljeto (COCI21_ljeto) C++14
50 / 50
1 ms 308 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1e9 + 7;

void solve(){
    ll n; cin>>n;
    vi adj[9];
    ll t,a,b;
    forp(i,1,n){
        cin>>t>>a>>b;
        adj[a].pb(t);
    }
    forp(i,1,8){
        sort(adj[i].begin(), adj[i].end());
    }
    ll prev;
    ll cnt[2]={0};
    forp(i,1,8){
        prev=-100;
        for(auto u:adj[i]){
            if(u-prev<=10){
                cnt[(i-1)/4]+=50;
            }
            cnt[(i-1)/4]+=100;
            prev=u;
        }
    }
    cout<<cnt[0]<<" "<<cnt[1]<<newl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct