Submission #1346008

#TimeUsernameProblemLanguageResultExecution timeMemory
1346008settopPPP (EGOI23_ppp)C++20
0 / 100
17 ms6640 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 S second
const int MAXN=3e5+10;

typedef pair<int,int> pii;

int n,m,suf[MAXN],s2[MAXN],ans[MAXN];
vector<pii> v;

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

    cin>>n>>m; v.resize(m);
    for(auto &[u,j]:v) cin>>u>>j;

    rfall(i,m,1) suf[i]=suf[i+1]+(v[i-1].F==1);
	rfall(i,m,1) s2[i]=s2[i+1]+(v[i-1].F==2);

	rfall(i,m,1){
		if(suf[i]>=s2[i]) ans[1]++;
		else ans[2]++;
	}
	cout<<ans[1]<<" "<<ans[2]<<"\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...