oj.uz

Submission #405863

# Submission time Handle Problem Language Result Execution time Memory
405863 2021-05-17T01:03:21 Z thomas_li Toll (BOI17_toll) C++17
0 / 100
 3000 ms 8524 KB 
// 57?
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int MM = 5e4+5;
int n,o,k,m; ll dp[MM]; vector<pi> adj[MM];

void dfs(int u, int b){
	if(u == b){
		dp[u] = 0;
		return;
	}
	for(auto [v,w] : adj[u]){
		dfs(v,b);
		dp[u] =min(dp[u],dp[v]+w);
	}
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> k >> n >> m >> o;
	for(int i = 0; i < m; i++){
		int a,b,t; cin >> a >> b >> t;
		adj[a].emplace_back(b,t);
	}
	while(o--){
		int a,b; cin >> a >> b;
		memset(dp,0x3f,sizeof dp);
		dfs(a,b);
		cout << (dp[a] >= 1e9 ? -1 : dp[a]) << "\n";
	}
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3079 ms 8524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3070 ms 5956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 2 ms 1868 KB Output is correct
4 Correct 2 ms 1868 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 4 ms 1868 KB Output is correct
7 Execution timed out 3070 ms 1868 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 2 ms 1868 KB Output is correct
4 Correct 2 ms 1868 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 4 ms 1868 KB Output is correct
7 Execution timed out 3070 ms 1868 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3079 ms 8524 KB Time limit exceeded
2 Halted 0 ms 0 KB -