# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362315 | limabeans | Preokret (COCI19_preokret) | C++17 | 1 ms | 364 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>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n;
for (int i=0; i<n; i++) {
cin>>a[i];
--a[i];
}
int ties = 1;
array<int,2> score = {0,0};
int turnover = 0;
for (int i=0; i<n; ) {
int j=i;
auto cur = score;
while (j<n && a[i]==a[j]) {
cur[a[j++]]++;
if (cur[0]==cur[1]) ties++;
}
if (score[0]<score[1] && cur[0]>cur[1]) {
turnover = max(turnover, j-i);
}
if (score[0]>score[1] && cur[0]<cur[1]) {
turnover = max(turnover, j-i);
}
score = cur;
i = j;
}
cout<<score[0]<<" "<<score[1]<<endl;
cout<<ties<<endl;
cout<<turnover<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |