# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866415 | vjudge1 | Preokret (COCI19_preokret) | C++17 | 1 ms | 356 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#ifndef Local
#pragma GCC optimize("O3,unroll-loops")
#endif
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define lim 200000
using namespace std;
const int mod=1000000007ll;
void solve(){
int n;
cin>>n;
int a=0,b=0;
int tie=1,turn=0,cur=0,now=0;
for(int i=0;i<n;i++){
int tem;
cin>>tem;
if(tem==1){
if(a<b){
if(now!=1)cur=0;
cur++;
}
else if(now==1){
cur++;
turn=max(turn,cur);
}
now=1;
a++;
}else{
if(a>b){
if(now!=2)cur=0;
cur++;
}
else if(now==2){
cur++;
turn=max(turn,cur);
}
now=2;
b++;
}
if(a==b){
tie++;
}
}
cout<<a<<" "<<b<<"\n"<<tie<<"\n"<<turn;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
#ifdef Local
freopen(".in","r",stdin);
freopen(".out","w",stdout);
#else
#endif
int t=1;
//cin>>t;
while (t--)
{
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |