oj.uz

Submission #1002021

# Submission time Handle Problem Language Result Execution time Memory
1002021 2024-06-19T09:18:45 Z Khanhcsp2 Trains (BOI24_trains) C++14
21 / 100
 2000 ms 2168 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e5+11;
int n, d[N], x[N], dp[N];
void sol()
{
    cin >> n;
    for(int i=1;i<=n;i++) cin >> d[i] >> x[i];
    dp[1]=1;
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<i;j++)
        {
            if(d[j]==0) continue;
            if((i-j)%d[j]!=0) continue;
            if((i-j)/d[j]>x[j]) continue;
            dp[i]=(dp[i]+dp[j])%mod;
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++) ans=(ans+dp[i])%mod;
    cout << ans;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 145 ms 852 KB Output is correct
21 Correct 13 ms 348 KB Output is correct
22 Correct 116 ms 724 KB Output is correct
23 Correct 96 ms 640 KB Output is correct
24 Correct 19 ms 580 KB Output is correct
25 Correct 96 ms 700 KB Output is correct
26 Correct 59 ms 844 KB Output is correct
27 Correct 191 ms 704 KB Output is correct
28 Correct 98 ms 604 KB Output is correct
29 Correct 273 ms 764 KB Output is correct
30 Correct 109 ms 796 KB Output is correct
31 Correct 149 ms 764 KB Output is correct
32 Correct 276 ms 760 KB Output is correct
33 Correct 132 ms 740 KB Output is correct
34 Correct 112 ms 748 KB Output is correct
35 Correct 109 ms 600 KB Output is correct
36 Correct 130 ms 736 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 101 ms 652 KB Output is correct
3 Correct 56 ms 596 KB Output is correct
4 Correct 203 ms 696 KB Output is correct
5 Execution timed out 2037 ms 2132 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 145 ms 852 KB Output is correct
21 Correct 13 ms 348 KB Output is correct
22 Correct 116 ms 724 KB Output is correct
23 Correct 96 ms 640 KB Output is correct
24 Correct 19 ms 580 KB Output is correct
25 Correct 96 ms 700 KB Output is correct
26 Correct 59 ms 844 KB Output is correct
27 Correct 191 ms 704 KB Output is correct
28 Correct 98 ms 604 KB Output is correct
29 Correct 273 ms 764 KB Output is correct
30 Correct 109 ms 796 KB Output is correct
31 Correct 149 ms 764 KB Output is correct
32 Correct 276 ms 760 KB Output is correct
33 Correct 132 ms 740 KB Output is correct
34 Correct 112 ms 748 KB Output is correct
35 Correct 109 ms 600 KB Output is correct
36 Correct 130 ms 736 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 101 ms 652 KB Output is correct
39 Correct 56 ms 596 KB Output is correct
40 Correct 203 ms 696 KB Output is correct
41 Execution timed out 2037 ms 2132 KB Time limit exceeded
42 Halted 0 ms 0 KB -