oj.uz

Submission #380795

# Submission time Handle Problem Language Result Execution time Memory
380795 2021-03-23T02:45:02 Z evn Tales of seafaring (POI13_mor) C++14
40 / 100
 3000 ms 102636 KB 
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int n, m, k;
short dp[5005][5005][2];
vector<int> adj[5005];
bool vis[5005][2];
queue<pair<int,short>> q;
int main(){

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m >> k;
	for(int i = 0; i < m;i ++){
		int a, b;
		cin >> a >> b;
		a--; b--;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	for(int i = 0; i < n;i ++){
		for(int j = 0;j < n;j ++){
			dp[i][j][0] = 5001;
			dp[i][j][1] = 5001;
		}
	}
	for(int i = 0;i < n; i++){
		//launch a bfs from node i
		memset(vis, false, sizeof(vis));
		vis[i][0] = true;
		q.push({i,0});
		dp[i][i][0] = 0;
		while(!q.empty()){
			pair<int,short> c = q.front(); q.pop();
			//if(vis[c.f][c.s%2])continue;
			vis[c.f][c.s%2] = true;
			//if(c.s != dp[i][c.f][c.s%2])continue;
			for(int u : adj[c.f]){
				int pa = c.s%2;
				if(!vis[u][(pa+1)%2]){
					dp[i][u][(pa+1)%2] = min(dp[i][u][(pa+1)%2], (short)(c.s+1));
					q.push({u, (c.s+1)});
				}
			}
		}
	}
	for(int i = 0; i < k;i ++){
		int a, b, d;
		cin >> a >> b >> d;
		a--; b--;
		bool works = false;
		if(dp[a][b][d%2] <= d && dp[a][b][d%2] != 5001)works = true;
		cout << (works ? "TAK":"NIE") << '\n';
	}

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Incorrect 1 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Incorrect 1 ms 492 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 2 ms 748 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2796 KB Output is correct
2 Correct 6 ms 1516 KB Output is correct
3 Correct 113 ms 3564 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 4588 KB Output is correct
2 Correct 27 ms 6252 KB Output is correct
3 Incorrect 408 ms 6380 KB Output isn't correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 15468 KB Output is correct
2 Correct 32 ms 5868 KB Output is correct
3 Incorrect 1823 ms 24556 KB Output isn't correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2237 ms 102636 KB Output is correct
2 Correct 373 ms 97456 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2770 ms 102636 KB Output is correct
2 Correct 671 ms 94316 KB Output is correct