| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346010 | settop | PPP (EGOI23_ppp) | C++20 | 17 ms | 6640 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==0);
rfall(i,m,1) s2[i]=s2[i+1]+(v[i-1].F==1);
rfall(i,m,1){
if(suf[i]>=s2[i]) ans[0]++;
else ans[1]++;
}
cout<<ans[0]<<" "<<ans[1]<<"\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
