oj.uz

답안 #233488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233488 2020-05-20T17:21:30 Z eohomegrownapps Toll (BOI17_toll) C++14
18 / 100
 3000 ms 12664 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)));
	vector<vector<pair<int,int>>> to(n);
	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});
	}
	//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];
				}
			}
		}
		curr=!curr;
	}
	for (int i = 0; i<o; i++){
		cout<<ans[i]<<'\n';
	}
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3079 ms 12408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 11904 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 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 8 ms 768 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 42 ms 12448 KB Output is correct
10 Correct 77 ms 12408 KB Output is correct
11 Correct 62 ms 11896 KB Output is correct
12 Correct 52 ms 11640 KB Output is correct
13 Correct 76 ms 8760 KB Output is correct
14 Correct 48 ms 7672 KB Output is correct
15 Correct 40 ms 7296 KB Output is correct
16 Correct 41 ms 7288 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 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 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 85 ms 12408 KB Output is correct
11 Correct 107 ms 11904 KB Output is correct
12 Correct 137 ms 12408 KB Output is correct
13 Correct 154 ms 12664 KB Output is correct
14 Correct 135 ms 12152 KB Output is correct
15 Correct 85 ms 7296 KB Output is correct
16 Correct 83 ms 7288 KB Output is correct

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 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 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 8 ms 640 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 85 ms 12408 KB Output is correct
11 Correct 107 ms 11904 KB Output is correct
12 Correct 137 ms 12408 KB Output is correct
13 Correct 154 ms 12664 KB Output is correct
14 Correct 135 ms 12152 KB Output is correct
15 Correct 85 ms 7296 KB Output is correct
16 Correct 83 ms 7288 KB Output is correct
17 Correct 2493 ms 11896 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 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 11 ms 640 KB Output is correct
24 Correct 13 ms 768 KB Output is correct
25 Correct 20 ms 512 KB Output is correct
26 Correct 17 ms 768 KB Output is correct
27 Correct 2564 ms 12408 KB Output is correct
28 Execution timed out 3080 ms 12408 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3079 ms 12408 KB Time limit exceeded
2 Halted 0 ms 0 KB -