oj.uz

답안 #1052857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052857 2024-08-11T04:54:27 Z vjudge1 Trains (BOI24_trains) C++17
71 / 100
 2000 ms 6012 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;
const int SQ=420;
ll sm[SQ][SQ];
ll ways[N],suf[N],d[N],x[N];
void solve()
{
    ll n;
    cin>>n;
    bool conp=1;
    for(int i=1;i<=n;i++)
    {
        cin>>d[i]>>x[i];
        conp&=(x[i]==1e9);
        ways[i]=1;
    }
    suf[n+1]=0;
    for(int i=n;i>=1;i--)
    {
        if(conp)
        {
            if(d[i]==0)
            {
                ways[i]=1;
            }
            else{
                if(d[i]<SQ)
                {
                    ways[i]=(1+sm[d[i]][i%d[i]])%mod;
                }
                else
                {
                    for(int t=1;t<=x[i] and (i+(d[i]*t))<=n;t++)
                    {
                        ways[i]=(ways[i]+ways[i+(d[i]*t)])%mod;
                    }
                }
                for(int j=1;j<SQ;j++)
                    sm[j][i%j]=(sm[j][i%j]+ways[i])%mod;
            }
        }
        else{
            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 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 0 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 0 ms 4444 KB Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 5 ms 4696 KB Output is correct
6 Correct 8 ms 4740 KB Output is correct
7 Correct 10 ms 4696 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 0 ms 4444 KB Output is correct
10 Correct 0 ms 4700 KB Output is correct
11 Correct 10 ms 4700 KB Output is correct
12 Correct 95 ms 4956 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 16 ms 4744 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 4956 KB Output is correct
2 Correct 40 ms 4952 KB Output is correct
3 Correct 109 ms 4956 KB Output is correct
4 Correct 69 ms 5720 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 0 ms 4700 KB Output is correct
7 Correct 11 ms 4956 KB Output is correct
8 Correct 96 ms 6012 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 0 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 0 ms 4444 KB Output is correct
20 Correct 9 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 3 ms 4540 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 6 ms 4440 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 19 ms 4648 KB Output is correct
29 Correct 10 ms 4864 KB Output is correct
30 Correct 2 ms 4696 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 2 ms 4440 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 7 ms 4648 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 5 ms 4696 KB Output is correct
42 Correct 8 ms 4740 KB Output is correct
43 Correct 10 ms 4696 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 0 ms 4444 KB Output is correct
46 Correct 0 ms 4700 KB Output is correct
47 Correct 10 ms 4700 KB Output is correct
48 Correct 95 ms 4956 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 16 ms 4744 KB Output is correct
52 Correct 47 ms 4956 KB Output is correct
53 Correct 40 ms 4952 KB Output is correct
54 Correct 109 ms 4956 KB Output is correct
55 Correct 69 ms 5720 KB Output is correct
56 Correct 1 ms 4700 KB Output is correct
57 Correct 0 ms 4700 KB Output is correct
58 Correct 11 ms 4956 KB Output is correct
59 Correct 96 ms 6012 KB Output is correct
60 Correct 927 ms 5724 KB Output is correct
61 Execution timed out 2078 ms 5468 KB Time limit exceeded
62 Halted 0 ms 0 KB -