Submission #198271

#TimeUsernameProblemLanguageResultExecution timeMemory
198271alradPreokret (COCI19_preokret)C++17
44 / 50
2 ms380 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...