oj.uz

Submission #995478

# Submission time Handle Problem Language Result Execution time Memory
995478 2024-06-09T07:03:02 Z 12345678 Trains (BOI24_trains) C++17
34 / 100
 110 ms 5172 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, mod=1e9+7, kx=255;

int n, d[nx], x[nx], qs[kx][kx], dp[nx], res, k=250;
vector<int> rem[nx];

void add(int idx)
{
    if (d[idx]==0) return;
    if (d[idx]>k)
    {
        if (idx+d[idx]>n) return;
        for (int i=idx+d[idx], j=0; j<x[idx]&&i<=n; j++, i+=d[idx]) dp[i]=(dp[i]+dp[idx])%mod;
    }
    else
    {
        qs[d[idx]][idx%d[idx]]=(qs[d[idx]][idx%d[idx]]+dp[idx])%mod;
        if (idx+((long long)x[idx])*d[idx]<=n) rem[idx+x[idx]*d[idx]].push_back(idx); 
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>d[i]>>x[i];
    dp[1]=1;
    add(1);
    for (int i=2; i<=n; i++)
    {
        for (int j=1; j<=k; j++) dp[i]=(dp[i]+qs[j][i%j])%mod;
        add(i);
        for (auto idx:rem[i]) qs[d[idx]][idx%d[idx]]=(((qs[d[idx]][idx%d[idx]]-dp[idx])%mod)+mod)%mod;
    }
    for (int i=1; i<=n; i++) res=(res+dp[i])%mod;
    cout<<res;
}

/*
7
2 4
0 3
4 2
1 4
1 1
2 1
4 2
*/

Subtask #1
0 / 8.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 8 ms 2904 KB Output is correct
3 Correct 7 ms 2648 KB Output is correct
4 Correct 10 ms 2908 KB Output is correct
5 Correct 84 ms 5172 KB Output is correct
6 Correct 106 ms 3852 KB Output is correct
7 Correct 110 ms 4200 KB Output is correct
8 Incorrect 1 ms 2652 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 3412 KB Output is correct
2 Correct 43 ms 3164 KB Output is correct
3 Correct 106 ms 3920 KB Output is correct
4 Correct 75 ms 3568 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 12 ms 2928 KB Output is correct
8 Correct 110 ms 3836 KB Output is correct

Subtask #5
0 / 29.0

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