oj.uz

답안 #233492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233492 2020-05-20T17:48:05 Z eohomegrownapps Toll (BOI17_toll) C++14
56 / 100
 3000 ms 8348 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][6][50000];
	for (int i = 0; i<2; i++){
		for (int x = 0; x<k; x++){
			for (int j = 0; j<n; j++){
				distfrom[i][x][j]=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%k][x]=0;
			from.insert(x);
		}
		for (int j = 0; j<k; j++){
			if (i*k+j>=n){break;}
			for (int nf : from){
				distfrom[curr][j][nf]=INF;
				for (auto p : adjlist[i*k+j]){
					distfrom[curr][j][nf]=min(distfrom[curr][j][nf],distfrom[!curr][p.first%k][nf]+p.second);
				}
			}
			for (auto p : to[i*k+j]){
				if (distfrom[curr][j][p.first]!=INF){
					ans[p.second]=distfrom[curr][j][p.first];
				}
				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

# 결과 실행 시간 메모리 Grader output
1 Correct 1488 ms 7160 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 1494 ms 7032 KB Output is correct
9 Correct 1445 ms 6788 KB Output is correct
10 Correct 1262 ms 5240 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 6264 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 8 ms 768 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 32 ms 6400 KB Output is correct
10 Correct 66 ms 7160 KB Output is correct
11 Correct 47 ms 6264 KB Output is correct
12 Correct 39 ms 6264 KB Output is correct
13 Correct 60 ms 6008 KB Output is correct
14 Correct 40 ms 4600 KB Output is correct
15 Correct 35 ms 4600 KB Output is correct
16 Correct 35 ms 4600 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 5 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 5 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 42 ms 6016 KB Output is correct
11 Correct 70 ms 5884 KB Output is correct
12 Correct 98 ms 6904 KB Output is correct
13 Correct 110 ms 7164 KB Output is correct
14 Correct 83 ms 6520 KB Output is correct
15 Correct 52 ms 4480 KB Output is correct
16 Correct 50 ms 4608 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 5 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 5 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 42 ms 6016 KB Output is correct
11 Correct 70 ms 5884 KB Output is correct
12 Correct 98 ms 6904 KB Output is correct
13 Correct 110 ms 7164 KB Output is correct
14 Correct 83 ms 6520 KB Output is correct
15 Correct 52 ms 4480 KB Output is correct
16 Correct 50 ms 4608 KB Output is correct
17 Correct 779 ms 6392 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 10 ms 640 KB Output is correct
24 Correct 11 ms 640 KB Output is correct
25 Correct 16 ms 640 KB Output is correct
26 Correct 14 ms 640 KB Output is correct
27 Correct 464 ms 6520 KB Output is correct
28 Correct 1111 ms 7032 KB Output is correct
29 Correct 1235 ms 7416 KB Output is correct
30 Correct 982 ms 6648 KB Output is correct

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1488 ms 7160 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 1494 ms 7032 KB Output is correct
9 Correct 1445 ms 6788 KB Output is correct
10 Correct 1262 ms 5240 KB Output is correct
11 Correct 50 ms 6264 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 8 ms 768 KB Output is correct
18 Correct 8 ms 768 KB Output is correct
19 Correct 32 ms 6400 KB Output is correct
20 Correct 66 ms 7160 KB Output is correct
21 Correct 47 ms 6264 KB Output is correct
22 Correct 39 ms 6264 KB Output is correct
23 Correct 60 ms 6008 KB Output is correct
24 Correct 40 ms 4600 KB Output is correct
25 Correct 35 ms 4600 KB Output is correct
26 Correct 35 ms 4600 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 5 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 5 ms 512 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 7 ms 512 KB Output is correct
36 Correct 42 ms 6016 KB Output is correct
37 Correct 70 ms 5884 KB Output is correct
38 Correct 98 ms 6904 KB Output is correct
39 Correct 110 ms 7164 KB Output is correct
40 Correct 83 ms 6520 KB Output is correct
41 Correct 52 ms 4480 KB Output is correct
42 Correct 50 ms 4608 KB Output is correct
43 Correct 779 ms 6392 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 4 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 10 ms 640 KB Output is correct
50 Correct 11 ms 640 KB Output is correct
51 Correct 16 ms 640 KB Output is correct
52 Correct 14 ms 640 KB Output is correct
53 Correct 464 ms 6520 KB Output is correct
54 Correct 1111 ms 7032 KB Output is correct
55 Correct 1235 ms 7416 KB Output is correct
56 Correct 982 ms 6648 KB Output is correct
57 Execution timed out 3030 ms 8348 KB Time limit exceeded
58 Halted 0 ms 0 KB -