oj.uz

Submission #994761

# Submission time Handle Problem Language Result Execution time Memory
994761 2024-06-08T04:59:38 Z salmon Trains (BOI24_trains) C++14
71 / 100
 2000 ms 662364 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> v;
map<int,long long int> mep[100100];
vector<int> rebove[100100];
int N;
int d,x;
vector<pair<int,int>> iv;
long long int num[100100];
long long int mod = 1'000'000'007;

int main(){
	
	scanf(" %d",&N);
	
	for(int i = 0; i < N; i++){
		scanf(" %d",&d);
		scanf(" %d",&x);
		iv.push_back({d,x});
		num[i] = 0;
		if(d != 0)rebove[(long long int)min((long long int)N,i + (long long int)d * x)].push_back(i);
	}
	
	/*for(int i = 0; i < N; i++){
		if(iv[i].first != 0){
			d = iv[i].first;
			x = iv[i].second;
			for(int j = 1; j <= x && j * d + i < N; j++){
				sat[j * d + i].insert(d);
				if(iv[j * d + i].first == d){
					x = max(x,j + iv[j * d + i].second);
					iv[j * d + i] = {0,0};
				}
			}
			
		}
	}*/
	
	num[0] = 1;
	long long int sum = 0;
	
	for(int i = 0; i < N; i++){
		num[i] %= mod;
		
		if(iv[i].first != 0){
			mep[min(N,i + iv[i].first)][iv[i].first] += num[i];
			num[min(N,i + iv[i].first)] += num[i];
		}
		
		for(int j : rebove[i]){
			mep[i][iv[j].first] = (mep[i][iv[j].first] - num[j]) % mod;
		}
		
		for(pair<int,long long int> j : mep[i]){
			if(j.second == 0) continue;
			mep[min(N,i + j.first)][j.first] += j.second;
			num[min(N,i + j.first)] += j.second;
		}

		sum = (sum + num[i]) % mod;
		//printf("%lld\n",num[i]);
	}
	
	printf("%lld",(sum + mod) % mod);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  scanf(" %d",&N);
      |  ~~~~~^~~~~~~~~~
Main.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf(" %d",&d);
      |   ~~~~~^~~~~~~~~~
Main.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |   scanf(" %d",&x);
      |   ~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 2 ms 8028 KB Output is correct
7 Correct 2 ms 8028 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8092 KB Output is correct
10 Correct 1 ms 8028 KB Output is correct
11 Correct 2 ms 8024 KB Output is correct
12 Correct 2 ms 8024 KB Output is correct
13 Correct 2 ms 8024 KB Output is correct
14 Correct 1 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 1 ms 8028 KB Output is correct
17 Correct 1 ms 8028 KB Output is correct
18 Correct 2 ms 8024 KB Output is correct
19 Correct 2 ms 8028 KB Output is correct
20 Correct 18 ms 18780 KB Output is correct
21 Correct 3 ms 8540 KB Output is correct
22 Correct 29 ms 20564 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 4 ms 9052 KB Output is correct
25 Correct 69 ms 39080 KB Output is correct
26 Correct 3 ms 8280 KB Output is correct
27 Correct 4 ms 8796 KB Output is correct
28 Correct 3 ms 8796 KB Output is correct
29 Correct 3 ms 8796 KB Output is correct
30 Correct 18 ms 14116 KB Output is correct
31 Correct 4 ms 8536 KB Output is correct
32 Correct 4 ms 8880 KB Output is correct
33 Correct 43 ms 28748 KB Output is correct
34 Correct 5 ms 8796 KB Output is correct
35 Correct 4 ms 8796 KB Output is correct
36 Correct 73 ms 44572 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 3 ms 8540 KB Output is correct
3 Correct 3 ms 8284 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 19 ms 15112 KB Output is correct
6 Correct 22 ms 15620 KB Output is correct
7 Correct 22 ms 15820 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8024 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 4 ms 8796 KB Output is correct
12 Correct 22 ms 15636 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 4 ms 8948 KB Output is correct
15 Correct 21 ms 15568 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 38868 KB Output is correct
2 Correct 40 ms 33736 KB Output is correct
3 Correct 29 ms 21968 KB Output is correct
4 Correct 35 ms 31420 KB Output is correct
5 Correct 2 ms 8024 KB Output is correct
6 Correct 2 ms 7980 KB Output is correct
7 Correct 3 ms 8796 KB Output is correct
8 Correct 21 ms 15676 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8028 KB Output is correct
6 Correct 2 ms 8028 KB Output is correct
7 Correct 2 ms 8028 KB Output is correct
8 Correct 2 ms 8028 KB Output is correct
9 Correct 2 ms 8092 KB Output is correct
10 Correct 1 ms 8028 KB Output is correct
11 Correct 2 ms 8024 KB Output is correct
12 Correct 2 ms 8024 KB Output is correct
13 Correct 2 ms 8024 KB Output is correct
14 Correct 1 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 1 ms 8028 KB Output is correct
17 Correct 1 ms 8028 KB Output is correct
18 Correct 2 ms 8024 KB Output is correct
19 Correct 2 ms 8028 KB Output is correct
20 Correct 18 ms 18780 KB Output is correct
21 Correct 3 ms 8540 KB Output is correct
22 Correct 29 ms 20564 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 4 ms 9052 KB Output is correct
25 Correct 69 ms 39080 KB Output is correct
26 Correct 3 ms 8280 KB Output is correct
27 Correct 4 ms 8796 KB Output is correct
28 Correct 3 ms 8796 KB Output is correct
29 Correct 3 ms 8796 KB Output is correct
30 Correct 18 ms 14116 KB Output is correct
31 Correct 4 ms 8536 KB Output is correct
32 Correct 4 ms 8880 KB Output is correct
33 Correct 43 ms 28748 KB Output is correct
34 Correct 5 ms 8796 KB Output is correct
35 Correct 4 ms 8796 KB Output is correct
36 Correct 73 ms 44572 KB Output is correct
37 Correct 2 ms 8024 KB Output is correct
38 Correct 3 ms 8540 KB Output is correct
39 Correct 3 ms 8284 KB Output is correct
40 Correct 3 ms 8796 KB Output is correct
41 Correct 19 ms 15112 KB Output is correct
42 Correct 22 ms 15620 KB Output is correct
43 Correct 22 ms 15820 KB Output is correct
44 Correct 2 ms 8028 KB Output is correct
45 Correct 2 ms 8024 KB Output is correct
46 Correct 2 ms 8028 KB Output is correct
47 Correct 4 ms 8796 KB Output is correct
48 Correct 22 ms 15636 KB Output is correct
49 Correct 2 ms 8028 KB Output is correct
50 Correct 4 ms 8948 KB Output is correct
51 Correct 21 ms 15568 KB Output is correct
52 Correct 52 ms 38868 KB Output is correct
53 Correct 40 ms 33736 KB Output is correct
54 Correct 29 ms 21968 KB Output is correct
55 Correct 35 ms 31420 KB Output is correct
56 Correct 2 ms 8024 KB Output is correct
57 Correct 2 ms 7980 KB Output is correct
58 Correct 3 ms 8796 KB Output is correct
59 Correct 21 ms 15676 KB Output is correct
60 Correct 316 ms 215696 KB Output is correct
61 Correct 34 ms 28104 KB Output is correct
62 Correct 113 ms 73416 KB Output is correct
63 Correct 36 ms 28100 KB Output is correct
64 Correct 48 ms 15504 KB Output is correct
65 Execution timed out 2063 ms 662364 KB Time limit exceeded
66 Halted 0 ms 0 KB -