oj.uz

Submission #233491

# Submission time Handle Problem Language Result Execution time Memory
233491 2020-05-20T17:45:44 Z eohomegrownapps Toll (BOI17_toll) C++14
56 / 100
 3000 ms 12424 KB 
#include <bits/stdc++.h>
using namespace std;

vector<vector<pair<int,int>>> adjlist;

int INF = 1e9;

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int k,n,m,o;
	cin>>k>>n>>m>>o;
	adjlist.resize((n/k)*k+k);
	for (int i = 0; i<m; i++){
		int a,b,t;
		cin>>a>>b>>t;
		adjlist[b].push_back({a,t});
	}
	unordered_set<int> from;
	vector<vector<int>> addat(n/k+1);
	//vector<vector<vector<int>>> distfrom(2,vector<vector<int>>(n,vector<int>(k,INF)));
	int distfrom[2][50002][6];
	for (int i = 0; i<2; i++){
		for (int j = 0; j<n; j++){
			for (int x = 0; x<k; x++){
				distfrom[i][j][x]=INF;
			}
		}
	}
	vector<vector<pair<int,int>>> to(n);
	vector<int> fromcnt(n,0);
	vector<int> ans(o,-1);
	for (int i = 0; i<o; i++){
		int a,b;
		cin>>a>>b;
		//from.push_back(a);
		addat[a/k].push_back(a);
		to[b].push_back({a,i});
		fromcnt[a]++;
	}
	//sort(from.begin(),from.end());
	//from.erase(unique(from.begin(),from.end()),from.end());
	bool curr = 0;
	for (int i = 1; i<=(n/k+1); i++){
		//cout<<i<<endl;
		for (int x : addat[i-1]){
			distfrom[!curr][x][x%k]=0;
			from.insert(x);
		}
		for (int j = 0; j<k; j++){
			if (i*k+j>=n){break;}
			for (int nf : from){
				distfrom[curr][nf][j]=INF;
				for (auto p : adjlist[i*k+j]){
					distfrom[curr][nf][j]=min(distfrom[curr][nf][j],distfrom[!curr][nf][p.first%k]+p.second);
				}
			}
			for (auto p : to[i*k+j]){
				if (distfrom[curr][p.first][j]!=INF){
					ans[p.second]=distfrom[curr][p.first][j];
				}
				fromcnt[p.first]--;
				if (fromcnt[p.first]==0){
					from.erase(p.first);
				}
			}
		}
		curr=!curr;
	}
	for (int i = 0; i<o; i++){
		cout<<ans[i]<<'\n';
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2020 ms 9212 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 2048 ms 8952 KB Output is correct
9 Correct 1949 ms 8928 KB Output is correct
10 Correct 1548 ms 7380 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 7800 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 768 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 32 ms 8352 KB Output is correct
10 Correct 64 ms 8312 KB Output is correct
11 Correct 58 ms 7920 KB Output is correct
12 Correct 39 ms 7420 KB Output is correct
13 Correct 61 ms 6264 KB Output is correct
14 Correct 44 ms 5240 KB Output is correct
15 Correct 36 ms 4860 KB Output is correct
16 Correct 34 ms 4736 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 42 ms 8064 KB Output is correct
11 Correct 76 ms 7416 KB Output is correct
12 Correct 93 ms 8184 KB Output is correct
13 Correct 110 ms 8440 KB Output is correct
14 Correct 83 ms 7672 KB Output is correct
15 Correct 57 ms 4736 KB Output is correct
16 Correct 51 ms 4728 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 42 ms 8064 KB Output is correct
11 Correct 76 ms 7416 KB Output is correct
12 Correct 93 ms 8184 KB Output is correct
13 Correct 110 ms 8440 KB Output is correct
14 Correct 83 ms 7672 KB Output is correct
15 Correct 57 ms 4736 KB Output is correct
16 Correct 51 ms 4728 KB Output is correct
17 Correct 769 ms 7648 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 9 ms 640 KB Output is correct
24 Correct 11 ms 640 KB Output is correct
25 Correct 17 ms 640 KB Output is correct
26 Correct 14 ms 640 KB Output is correct
27 Correct 592 ms 8380 KB Output is correct
28 Correct 1093 ms 8312 KB Output is correct
29 Correct 1202 ms 8708 KB Output is correct
30 Correct 946 ms 7928 KB Output is correct

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2020 ms 9212 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 2048 ms 8952 KB Output is correct
9 Correct 1949 ms 8928 KB Output is correct
10 Correct 1548 ms 7380 KB Output is correct
11 Correct 47 ms 7800 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 7 ms 768 KB Output is correct
18 Correct 8 ms 768 KB Output is correct
19 Correct 32 ms 8352 KB Output is correct
20 Correct 64 ms 8312 KB Output is correct
21 Correct 58 ms 7920 KB Output is correct
22 Correct 39 ms 7420 KB Output is correct
23 Correct 61 ms 6264 KB Output is correct
24 Correct 44 ms 5240 KB Output is correct
25 Correct 36 ms 4860 KB Output is correct
26 Correct 34 ms 4736 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 7 ms 640 KB Output is correct
36 Correct 42 ms 8064 KB Output is correct
37 Correct 76 ms 7416 KB Output is correct
38 Correct 93 ms 8184 KB Output is correct
39 Correct 110 ms 8440 KB Output is correct
40 Correct 83 ms 7672 KB Output is correct
41 Correct 57 ms 4736 KB Output is correct
42 Correct 51 ms 4728 KB Output is correct
43 Correct 769 ms 7648 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 9 ms 640 KB Output is correct
50 Correct 11 ms 640 KB Output is correct
51 Correct 17 ms 640 KB Output is correct
52 Correct 14 ms 640 KB Output is correct
53 Correct 592 ms 8380 KB Output is correct
54 Correct 1093 ms 8312 KB Output is correct
55 Correct 1202 ms 8708 KB Output is correct
56 Correct 946 ms 7928 KB Output is correct
57 Execution timed out 3065 ms 12424 KB Time limit exceeded
58 Halted 0 ms 0 KB -