# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498978 | inksamurai | Preokret (COCI19_preokret) | C++17 | 1 ms | 316 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.
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;
int main(){
_3qplfh5;
int n;
cin>>n;
vi cnt(2,0),cons(2,0);
int vcons=0,tie=1;
rep(i,n){
int x;
cin>>x;
x--;
cons[x]++;
vcons=max(vcons,cons[x^1]);
cons[x^1]=0;
cnt[x]++;
if(cnt[0]==cnt[1])
tie++;
}
vcons=max({vcons,cons[0],cons[1]});
cout<<cnt[0]<<" "<<cnt[1]<<"\n";
cout<<tie<<"\n";
cout<<vcons<<"\n";
//
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |