oj.uz

답안 #1052855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052855 2024-08-11T04:44:31 Z vjudge1 Trains (BOI24_trains) C++17
37 / 100
 2000 ms 4700 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
#define pb push_back

const int N=1e5+10,mod=1e9+7;
ll ways[N],suf[N],d[N],x[N];
void solve()
{
    ll n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>d[i]>>x[i];
        ways[i]=1;
    }
    suf[n+1]=0;
    for(int i=n;i>=1;i--)
    {
        if(d[i]==1)
        {
            int j=min(n,i+x[i]);
            ways[i] =(((suf[i+1]-suf[j+1])%mod)+mod)%mod;
            ways[i] = (ways[i]+1)%mod;
        }
        else{
            if(d[i]>1){
                for(int t=1;t<=x[i] and (i+(d[i]*t))<=n;t++)
                {
                    ways[i]=(ways[i]+ways[i+(d[i]*t)])%mod;
                }
            }
        }
        suf[i]=(suf[i+1]+ways[i])%mod;
    }
    cout<<ways[1]%mod<<endl;
}

int main()
{
	cin.tie(0);cout.tie(0);
	ios::sync_with_stdio(0);
	int t=1;
	// cin>>t;
	while(t--)
		solve();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 9 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2520 KB Output is correct
25 Correct 5 ms 2652 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 19 ms 2672 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 7 ms 2676 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2584 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 5 ms 3164 KB Output is correct
6 Correct 8 ms 3540 KB Output is correct
7 Correct 8 ms 3420 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 9 ms 3416 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 10 ms 3408 KB Output is correct

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 737 ms 2904 KB Output is correct
2 Correct 525 ms 3420 KB Output is correct
3 Execution timed out 2073 ms 4700 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 9 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2520 KB Output is correct
25 Correct 5 ms 2652 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 19 ms 2672 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2652 KB Output is correct
36 Correct 7 ms 2676 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 1 ms 2584 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 5 ms 3164 KB Output is correct
42 Correct 8 ms 3540 KB Output is correct
43 Correct 8 ms 3420 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 0 ms 2396 KB Output is correct
46 Correct 0 ms 2396 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 9 ms 3416 KB Output is correct
49 Correct 0 ms 2396 KB Output is correct
50 Correct 2 ms 2652 KB Output is correct
51 Correct 10 ms 3408 KB Output is correct
52 Correct 737 ms 2904 KB Output is correct
53 Correct 525 ms 3420 KB Output is correct
54 Execution timed out 2073 ms 4700 KB Time limit exceeded
55 Halted 0 ms 0 KB -