Submission #1363526

#TimeUsernameProblemLanguageResultExecution timeMemory
1363526FZ_LaabidiPPP (EGOI23_ppp)C++20
12 / 100
54 ms3544 KiB
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
signed main(){
    int n; cin >> n;
    int m; cin >> m;
    vector<int> won(n, 0);
    vector<int> ans(n, 0);
    vector<pair<int, int>> x(m);
    for(int i=0; i<m; i++)cin >> x[i].F >> x[i].S;
    int last = x[m-1].F;
    ans[x[m-1].F]= 1; won[x[m-1].F]= 1;
    for(int i = m-2; i>-1; i--){
        won[x[i].F]++;
        if(won[1]>won[0]) ans[1]++;
        else ans[0]++;
    }
    cout << ans[0]<< " "<< ans[1] << endl;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...