# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254467 | MrRobot_28 | Preokret (COCI19_preokret) | C++17 | 1 ms | 384 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;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a = 0;
int b = 0;
int n;
cin >> n;
int c1 = 1;
vector <pair <int, int> > mass(n + 1);
mass[0] = {0, 0};
int c2 = 0;
int count1 = 0, count2 = 0;
for(int i = 0; i < n; i++)
{
int t;
cin >> t;
if(t == 1)
{
count1++;
count2 = 0;
}
else
{
count1 = 0;
count2++;
}
if(t == 1)
{
a++;
}
else
{
b++;
}
if(a == b)
{
c1++;
}
if(count1 != 0 && mass[i + 1 - count1].first < mass[i + 1 - count1].second &&a > b)
{
c2 = max(c2, count1);
}
if(count2 != 0 && mass[i + 1 - count2].first > mass[i + 1 - count2].second && a < b)
{
c2 = max(c2, count2);
}
mass[i + 1] = {a, b};
}
cout << a << " " << b << "\n";
cout << c1 << "\n";
cout << c2 << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |