oj.uz

답안 #1002129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002129 2024-06-19T10:16:27 Z Khanhcsp2 Trains (BOI24_trains) C++14
71 / 100
 239 ms 396884 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], pfs[N][501];
void sol()
{
    cin >> n;
    for(int i=1; i<=n; i++) cin >> d[i] >> x[i];
    for(int i=n; i>=1; i--)
    {
        dp[i]=1;
        if(d[i]>=500) for(int j=1; j<=x[i] && i+j*d[i]<=n; j++) dp[i]=(dp[i]+dp[i+j*d[i]])%mod;
        else if(d[i])
        {
            if(i+d[i]<=n) dp[i]=(dp[i]+pfs[i+d[i]][d[i]])%mod;
            if(i+d[i]*(x[i]+1ll)<=n) dp[i]=(dp[i]-pfs[i+d[i]*(x[i]+1ll)][d[i]])%mod;
        }
        for(int j=1;j<500;j++)
        {
            pfs[i][j]=dp[i];
            pfs[i][j]=(pfs[i][j]+pfs[i+j][j])%mod;
        }
    }
    cout << (dp[1]+mod)%mod;
}
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 604 KB Output is correct
14 Correct 0 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 604 KB Output is correct
14 Correct 0 ms 348 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 20 ms 33100 KB Output is correct
21 Correct 7 ms 12204 KB Output is correct
22 Correct 21 ms 39904 KB Output is correct
23 Correct 17 ms 25944 KB Output is correct
24 Correct 10 ms 16660 KB Output is correct
25 Correct 21 ms 35656 KB Output is correct
26 Correct 10 ms 18040 KB Output is correct
27 Correct 23 ms 34136 KB Output is correct
28 Correct 22 ms 40020 KB Output is correct
29 Correct 21 ms 40028 KB Output is correct
30 Correct 22 ms 40060 KB Output is correct
31 Correct 23 ms 40028 KB Output is correct
32 Correct 22 ms 40028 KB Output is correct
33 Correct 27 ms 39764 KB Output is correct
34 Correct 25 ms 39764 KB Output is correct
35 Correct 23 ms 39772 KB Output is correct
36 Correct 23 ms 39764 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 15 ms 25948 KB Output is correct
3 Correct 11 ms 18268 KB Output is correct
4 Correct 21 ms 34140 KB Output is correct
5 Correct 178 ms 305488 KB Output is correct
6 Correct 237 ms 395604 KB Output is correct
7 Correct 239 ms 395600 KB Output is correct
8 Correct 1 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 25 ms 39888 KB Output is correct
12 Correct 238 ms 396104 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 25 ms 40028 KB Output is correct
15 Correct 226 ms 396112 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 190836 KB Output is correct
2 Correct 91 ms 158548 KB Output is correct
3 Correct 213 ms 395996 KB Output is correct
4 Correct 162 ms 283736 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 26 ms 40008 KB Output is correct
8 Correct 235 ms 396112 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 604 KB Output is correct
14 Correct 0 ms 348 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 20 ms 33100 KB Output is correct
21 Correct 7 ms 12204 KB Output is correct
22 Correct 21 ms 39904 KB Output is correct
23 Correct 17 ms 25944 KB Output is correct
24 Correct 10 ms 16660 KB Output is correct
25 Correct 21 ms 35656 KB Output is correct
26 Correct 10 ms 18040 KB Output is correct
27 Correct 23 ms 34136 KB Output is correct
28 Correct 22 ms 40020 KB Output is correct
29 Correct 21 ms 40028 KB Output is correct
30 Correct 22 ms 40060 KB Output is correct
31 Correct 23 ms 40028 KB Output is correct
32 Correct 22 ms 40028 KB Output is correct
33 Correct 27 ms 39764 KB Output is correct
34 Correct 25 ms 39764 KB Output is correct
35 Correct 23 ms 39772 KB Output is correct
36 Correct 23 ms 39764 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 15 ms 25948 KB Output is correct
39 Correct 11 ms 18268 KB Output is correct
40 Correct 21 ms 34140 KB Output is correct
41 Correct 178 ms 305488 KB Output is correct
42 Correct 237 ms 395604 KB Output is correct
43 Correct 239 ms 395600 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 25 ms 39888 KB Output is correct
48 Correct 238 ms 396104 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 25 ms 40028 KB Output is correct
51 Correct 226 ms 396112 KB Output is correct
52 Correct 110 ms 190836 KB Output is correct
53 Correct 91 ms 158548 KB Output is correct
54 Correct 213 ms 395996 KB Output is correct
55 Correct 162 ms 283736 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 26 ms 40008 KB Output is correct
59 Correct 235 ms 396112 KB Output is correct
60 Correct 186 ms 330068 KB Output is correct
61 Correct 213 ms 395856 KB Output is correct
62 Correct 220 ms 395356 KB Output is correct
63 Correct 225 ms 395820 KB Output is correct
64 Correct 237 ms 396884 KB Output is correct
65 Incorrect 228 ms 396112 KB Output isn't correct
66 Halted 0 ms 0 KB -