oj.uz

Submission #933813

# Submission time Handle Problem Language Result Execution time Memory
933813 2024-02-26T11:04:46 Z alexander707070 Worst Reporter 3 (JOI18_worst_reporter3) C++14
12 / 100
 2000 ms 28240 KB 
#include<bits/stdc++.h>
#define MAXN 500007
using namespace std;

struct qr{
    int t,l,r,id;

    inline friend bool operator < (qr fr,qr sc){
        return fr.t<sc.t;
    }
};

int n,q,t,l,r,tim,ans[MAXN],d[MAXN],pos[MAXN];
qr query[MAXN];

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>d[i];
        pos[i]=-i;
    }

    for(int i=1;i<=q;i++){
        cin>>t>>l>>r;
        query[i]={t,l,r,i};
    }

    sort(query+1,query+q+1);

    for(int i=1;i<=q;i++){
        while(tim<query[i].t){
            tim++; pos[0]++;

            for(int f=1;f<=n;f++){
                if(pos[f-1]-pos[f]>=d[f]+1){
                    pos[f]=pos[f-1]-1;
                }else break;
            }
        }

        for(int f=0;f<=n;f++){
            if(pos[f]>=query[i].l and pos[f]<=query[i].r)ans[query[i].id]++;
        }
    }

    for(int i=1;i<=q;i++){
        cout<<ans[i]<<"\n";
    }

    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2094 ms 28240 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6620 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct

Subtask #3
0 / 81.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2094 ms 28240 KB Time limit exceeded
2 Halted 0 ms 0 KB -