oj.uz

Submission #199578

# Submission time Handle Problem Language Result Execution time Memory
199578 2020-02-02T05:18:31 Z SamAnd Preokret (COCI19_preokret) C++17
50 / 50
 6 ms 380 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 255;

int n;
int a[N];

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    int q1 = 0, q2 = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] == 1)
            ++q1;
        else
            ++q2;
    }
    printf("%d %d\n", q1, q2);
    int ans1 = 1;
    q1 = 0, q2 = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] == 1)
            ++q1;
        else
            ++q2;
        if (q1 == q2)
            ++ans1;
    }
    printf("%d\n", ans1);
    int ans2 = 0;
    q1 = 0, q2 = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] == 1)
            ++q1;
        else
            ++q2;
        if (q1 < q2)
        {
            int q = 0;
            for (int j = i + 1; j <= n; ++j)
            {
                if (a[j] == 2)
                    break;
                ++q;
            }
            if (q1 + q > q2)
                ans2 = max(ans2, q);
        }
        else if (q2 < q1)
        {
            int q = 0;
            for (int j = i + 1; j <= n; ++j)
            {
                if (a[j] == 1)
                    break;
                ++q;
            }
            if (q2 + q > q1)
                ans2 = max(ans2, q);
        }
    }
    printf("%d\n", ans2);
    return 0;
}

Compilation message

preokret.cpp: In function 'int main()':
preokret.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
preokret.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

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