제출 #1353040

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1353040		sally	PPP (EGOI23_ppp)	C++20	27 / 100	62 ms	3768 KiB

Main

// https://oj.uz/problem/view/EGOI23_ppp
#include<iostream>
#include<vector>
using namespace std;
#define winner first
#define loser second
typedef pair<int,int> pii;
int main() {
    int N, M;
    cin>>N>>M;
    vector<pii> event(M);
    for(int i=0; i<M; i++) {
        int win, lose;
        cin>>win>>lose;
        event[i].winner = win;
        event[i].loser = lose;
    }
    vector<int> ans(N, 0);
    vector<int> player(N, 0);
    int MAXN = 0, p = 0;
    for(int i = M-1; i>=0; i--) {
        int win = event[i].winner;
        int lose = event[i].loser;
        player[win]++;
        if(player[win]>MAXN) {
            p = win;
            MAXN = player[win];
        }
        else if(player[win] == MAXN) {
            p = min(p, win);
        }
        ans[p]++;
    }
    for(int i=0; i<N; i++) cout<<ans[i]<<' ';
}

• Subtask 0: 0 / 0
• Subtask 1: 12 / 12
• Subtask 2: 0 / 16
• Subtask 3: 15 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 22
• Subtask 6: 0 / 15