oj.uz

Submission #362315

# Submission time Handle Problem Language Result Execution time Memory
362315 2021-02-02T15:53:50 Z limabeans Preokret (COCI19_preokret) C++17
50 / 50
 1 ms 364 KB 
#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;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct