oj.uz

Submission #933851

# Submission time Handle Problem Language Result Execution time Memory
933851 2024-02-26T12:09:22 Z alexander707070 Worst Reporter 3 (JOI18_worst_reporter3) C++14
7 / 100
 199 ms 21392 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],e[MAXN],d[MAXN];
int pos[MAXN],len[MAXN],pt,br,from,to,diff,curr;
qr query[MAXN];

int calc(int a,int b,int c,int d){
    if(b<c or a>d)return 0;
    if(a>=c and b<=d)return b-a+1;
    if(a<=c and b>=d)return d-c+1;
    if(a>=c)return d-a+1;
    if(b<=d)return b-c+1;
}

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>>e[i];
    }

    len[0]=1;
    for(int i=n;i>=1;i--){
        if(e[i]<=e[i-1])br++;
        else{
            pt++;
            len[pt]=br+1;
            pos[pt]=-i;
            d[pt]=e[i];
            br=0;
        }
    }

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

    reverse(pos+1,pos+pt+1);
    reverse(len+1,len+pt+1);
    reverse(d+1,d+pt+1);

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

    for(int i=1;i<=q;i++){

        pos[0]+=query[i].t-query[i-1].t;
        for(int f=1;f<=pt;f++){
            diff=(pos[f-1]-len[f-1]+1)-pos[f];

            if(diff%d[f]==0)pos[f]+=diff-d[f];
            else pos[f]+=(diff/d[f])*d[f];
        }

        for(int f=0;f<=pt;f++){
            from=pos[f]-len[f]+1; to=pos[f];
            ans[query[i].id]+=calc(from,to,query[i].l,query[i].r);
        }
    }

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

    return 0;
}

Compilation message

worst_reporter3.cpp: In function 'int calc(int, int, int, int)':
worst_reporter3.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 21072 KB Output is correct
2 Correct 197 ms 21392 KB Output is correct
3 Correct 199 ms 20868 KB Output is correct
4 Correct 194 ms 20820 KB Output is correct
5 Correct 194 ms 20868 KB Output is correct
6 Correct 195 ms 20868 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Incorrect 5 ms 8536 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 21072 KB Output is correct
2 Correct 197 ms 21392 KB Output is correct
3 Correct 199 ms 20868 KB Output is correct
4 Correct 194 ms 20820 KB Output is correct
5 Correct 194 ms 20868 KB Output is correct
6 Correct 195 ms 20868 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 6 ms 8540 KB Output is correct
9 Incorrect 5 ms 8536 KB Output isn't correct
10 Halted 0 ms 0 KB -