oj.uz

답안 #233489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233489 2020-05-20T17:24:59 Z eohomegrownapps Toll (BOI17_toll) C++14
49 / 100
 3000 ms 15096 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> 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
0 / 7.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 11896 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 8 ms 896 KB Output is correct
8 Correct 8 ms 896 KB Output is correct
9 Correct 47 ms 12536 KB Output is correct
10 Correct 77 ms 12408 KB Output is correct
11 Correct 63 ms 11896 KB Output is correct
12 Correct 50 ms 11644 KB Output is correct
13 Correct 68 ms 8632 KB Output is correct
14 Correct 47 ms 7672 KB Output is correct
15 Correct 41 ms 7296 KB Output is correct
16 Correct 40 ms 7288 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 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 58 ms 12416 KB Output is correct
11 Correct 85 ms 12024 KB Output is correct
12 Correct 107 ms 12408 KB Output is correct
13 Correct 118 ms 12664 KB Output is correct
14 Correct 96 ms 12024 KB Output is correct
15 Correct 62 ms 7288 KB Output is correct
16 Correct 60 ms 7288 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 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 58 ms 12416 KB Output is correct
11 Correct 85 ms 12024 KB Output is correct
12 Correct 107 ms 12408 KB Output is correct
13 Correct 118 ms 12664 KB Output is correct
14 Correct 96 ms 12024 KB Output is correct
15 Correct 62 ms 7288 KB Output is correct
16 Correct 60 ms 7288 KB Output is correct
17 Correct 1054 ms 11896 KB Output is correct
18 Correct 4 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 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 15 ms 768 KB Output is correct
27 Correct 1018 ms 12416 KB Output is correct
28 Correct 1884 ms 12408 KB Output is correct
29 Correct 1455 ms 15096 KB Output is correct
30 Correct 1267 ms 13816 KB Output is correct

Subtask #5
0 / 44.0

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