oj.uz

Submission #455184

# Submission time Handle Problem Language Result Execution time Memory
455184 2021-08-05T16:34:20 Z myvaluska Exam (eJOI20_exam) C++14
12 / 100
 92 ms 3488 KB 
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <cmath>
#include <tuple>
#include <queue>
#include <functional>
using namespace std;
/*long long int power(long long int n, int k)
{
    long long int vys = 1;
    for (int i = 0; i < k; i++)
    {
        vys = (vys * (n - i)) / (i + 1);
    }
    return vys;
}*/

int main()
{
    /*for (int i = 0; i < 10; i++)
    {
        std::cout << "Hello Flash!\n";
    }*/

    //cout << "TU" << endl;
    int n;
    cin >> n;
    vector<int>v(n);
    vector<int>p(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> p[i];
    }
    int vys = 0;
    vector<int>cheat(n, 0);//zaznacime si pre i-teho studenta ci podvadza alebo nie
    for (int i = 0; i < n; i++)
    {
        if (v[i] == p[0])
        {
            int j = i;
            int k = i-1;
            for ( ;j < n; j++)
            {
                if (v[j] > v[i]||cheat[j]==1)
                {
                    break;
               }
                cheat[j] = 1;
            }
            if (i > 0)
            {
                for (; k >= 0; k--)
                {
                  if (v[k] > v[i]||cheat[k]==1)
                 {
                    break;
                 }
                    cheat[k] = 1;
                }
            }
           // cout << j << ' ' << k << endl;

        }
    }
    for (int i = 0; i < n; i++)
    {
        if (cheat[i] == 1)
        {
            vys += 1;
        }
    }
    cout << vys << endl;
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 18 ms 816 KB Output is correct
3 Correct 56 ms 2264 KB Output is correct
4 Correct 37 ms 1832 KB Output is correct
5 Correct 92 ms 3488 KB Output is correct
6 Correct 39 ms 1860 KB Output is correct
7 Correct 49 ms 2000 KB Output is correct
8 Correct 91 ms 3352 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -