oj.uz

Submission #870679

# Submission time Handle Problem Language Result Execution time Memory
870679 2023-11-08T19:55:15 Z Noname_1900 Worst Reporter 3 (JOI18_worst_reporter3) C++17
7 / 100
 209 ms 22840 KB 
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 500*1000;
int distanceNec[NMAX];
int posPersonne[NMAX];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int nbPersonnes, nbRequetes;
    cin >> nbPersonnes >> nbRequetes;
    bool tout1 = true;
    for(int iP = 0; iP < nbPersonnes; iP++)
    {
        cin >> distanceNec[iP];
        if(distanceNec[iP] != 1)    tout1 = false;
        posPersonne[iP] = -(iP+1);
    }
    if(tout1)
    {
        int deb = -nbPersonnes;
        int fin = 0;
        int a, b;
        int j;
        for(int iQ = 0; iQ < nbRequetes; iQ++)
        {
            cin >> j >> a >> b;
            a = max(a, deb+j);
            b = min(b, fin + j);
           // cout << a << " " << b << endl;
            if(a > b)   cout << "0" << "\n";
            else    cout << (b-a+1) << "\n";
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 22668 KB Output is correct
2 Correct 185 ms 22832 KB Output is correct
3 Correct 203 ms 22840 KB Output is correct
4 Correct 171 ms 22620 KB Output is correct
5 Correct 209 ms 22612 KB Output is correct
6 Correct 191 ms 22752 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 22668 KB Output is correct
2 Correct 185 ms 22832 KB Output is correct
3 Correct 203 ms 22840 KB Output is correct
4 Correct 171 ms 22620 KB Output is correct
5 Correct 209 ms 22612 KB Output is correct
6 Correct 191 ms 22752 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -