oj.uz

답안 #916962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916962 2024-01-26T20:53:36 Z alexdd Worst Reporter 3 (JOI18_worst_reporter3) C++17
0 / 100
 2000 ms 4948 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,q;
int d[500005];
int calc_cur(int i, int ult, int mxm)
{
    int poz = -i;
    while(poz + d[i] < ult - d[i]%mxm)
        poz += d[i];
    return poz;
    //return -i + ((ult + i - 1)/d[i]) * d[i];
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>d[i];
    int le,ri,t;
    while(q--)
    {
        cin>>t>>le>>ri;
        int cnt=0,mxm=1,ult=t;
        if(le<=t && t<=ri)
            cnt++;
        for(int i=1;i<=n;i++)
        {
            int cur;
            if(d[i]>=mxm)
            {
                cur=calc_cur(i,ult,mxm);
                mxm=d[i];
            }
            else
            {
                cur=ult-1;
            }
            ult=cur;
            if(le<=cur && cur<=ri)
                cnt++;
        }
        cout<<cnt<<"\n";
    }
    return 0;
}
/**

poz(t,i) = min(((x-i) - (x-i)%d[x])) pt x<=i

-9 -8 -7 -6 -5 -4 -3 -2 -1  0  1  2  3  4  5  6  7  8  9
 4  2     1  3     3        *

-9 -8 -7 -6 -5 -4 -3 -2 -1  0  1  2  3  4  5  6  7  8  9
             5  3  2  1  3  3  *

-9 -8 -7 -6 -5 -4 -3 -2 -1  0  1  2  3  4  5  6  7  8  9
             7           3  2  1  3  3  *


*/

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2023 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Incorrect 6 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2023 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -