oj.uz

Submission #997889

# Submission time Handle Problem Language Result Execution time Memory
997889 2024-06-13T04:55:40 Z imarn Trains (BOI24_trains) C++14
16 / 100
 264 ms 8676 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int blc=351,inf=1e9+7;
ll sum[351][351]{0};
priority_queue<pair<int,ll>,vector<pair<int,ll>>,greater<pair<int,ll>>>pq[blc][blc];
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;pii g[n+1];ll dp[n]={0};dp[0]=1;
    for(int i=0;i<n;i++)cin>>g[i].f>>g[i].s;ll ans=0;
    for(int i=0;i<n;i++){
        for(int j=1;j<blc;j++){
            while(!pq[i%j][j].empty()&&pq[i%j][j].top().f<i)sum[i%j][j]-=pq[i%j][j].top().s,pq[i%j][j].pop(),sum[i%j][j]%=inf;
        }
        for(int j=1;j<blc;j++){
            dp[i]+=sum[i%j][j];dp[i]%=inf;
        }
        if(g[i].f>=blc){int cur=i;
            for(int j=1;j<=g[i].s;j++){
                cur+=g[i].f;if(cur>n)break;
                dp[cur]+=dp[i];dp[cur]%=inf;
            }
        }
        else if(g[i].f!=0){
            pq[i%g[i].f][g[i].f].push({i+g[i].f*g[i].s,dp[i]});
            sum[i%g[i].f][g[i].f]+=dp[i];sum[i%g[i].f][g[i].f]%=inf;
        }ans+=dp[i];ans%=inf;
    }cout<<(ans%inf+inf)%inf;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Incorrect 1 ms 4700 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Incorrect 1 ms 4700 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 17 ms 4956 KB Output is correct
3 Correct 12 ms 4952 KB Output is correct
4 Correct 23 ms 5252 KB Output is correct
5 Correct 196 ms 5924 KB Output is correct
6 Correct 252 ms 8332 KB Output is correct
7 Correct 264 ms 8676 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 26 ms 5120 KB Output is correct
12 Correct 259 ms 8336 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 28 ms 5208 KB Output is correct
15 Correct 262 ms 8420 KB Output is correct

Subtask #4
0 / 34.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Incorrect 1 ms 4700 KB Output isn't correct
12 Halted 0 ms 0 KB -