Submission #1346074

#TimeUsernameProblemLanguageResultExecution timeMemory
1346074settopPPP (EGOI23_ppp)C++20
27 / 100
22 ms5624 KiB
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define F first
#define all(x) x.begin(),x.end()
#define S second
#define sz(x) (int)x.size()
const int MAXN=3e5+10;

typedef pair<int,int> pii;

int suf[MAXN],n,m,mx,id,ans[MAXN];

int32_t main(){
    std::ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin>>n>>m;
    vector<pii> op(m);
    for(auto &[u,j]:op) cin>>u>>j;

    rfall(i,m-1,0){
        auto x=op[i].F;
        suf[x]++;
        if(suf[x]>mx || (suf[x]==mx && x<id)){
            id=x;
            mx=suf[x];
        }
        ans[id]++;
    }
    fall(i,0,n-1) cout<<ans[i]<<" ";
    cout<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...