Submission #751024

#	Time	Username	Problem	Language	Result	Execution time	Memory
751024		LucaLucaM	Exam (eJOI20_exam)	C++17	12 / 100	89 ms	3148 KiB

exam

#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5;

int n;
int a[NMAX + 5], b[NMAX + 5];
bitset<NMAX + 5>vis;

int main()
{
    cin >> n;
    for (int i=1; i<=n; i++)
        cin >> a[i];
    for (int i=1; i<=n; i++)
        cin >> b[i];
    /// b[1] = b[2] = ... = b[n]
    /// putem face a[i] = B?
    bool go = false;
    for (int i=1; i<=n; i++)
    {
        if (a[i] > b[1])
            go = false;
        else if (a[i] == b[1])
            go = true;
        if (go)
            vis[i] = true;
    }
    go = false;
    for (int i=n; i>0; i--)
    {
        if (a[i] > b[1])
            go = false;
        else if (a[i] == b[1])
            go = true;
        if (go)
            vis[i] = true;
    }
    cout << (int)vis.count();   
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22