oj.uz

Submission #198271

# Submission time Handle Problem Language Result Execution time Memory
198271 2020-01-25T09:31:03 Z alrad Preokret (COCI19_preokret) C++17
44 / 50
 2 ms 380 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
   ios_base :: sync_with_stdio(0);
   cin.tie(0) , cout.tie(0);
   int n;
   cin >> n;
   int a = 0  , b = 0;
   int ties = 1 , turnover = 0;
   int p = -1 , cur = 0;
   for (int i = 1; i <= n; i++) {
      int x;
      cin >> x;
      (x == 1 ? a++ : b++);
      if (p == x) {
         cur++;
      } else {
         if (p == 1) {
            if (a - cur <= b) {
               turnover = max(turnover , cur);
            }
         } else if (p == 2) {
            if (b - cur <= a) {
               turnover = max(turnover , cur);
            }
         }
         p = x;
         cur = 1;
      }
      if (a == b) {
         ties++;
      }
   }
   if (p == 1) {
      if (a - cur <= b) {
         turnover = max(turnover , cur);
      }
   } else if (p == 2) {
      if (b - cur <= a) {
         turnover = max(turnover , cur);
      }
   }
   cout << a << " " << b << '\n';
   cout << ties << '\n';
   cout << turnover << '\n';
   return 0;
}

Subtask #1
44.0 / 50.0

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