oj.uz

Submission #380800

# Submission time Handle Problem Language Result Execution time Memory
380800 2021-03-23T02:55:04 Z evn Tales of seafaring (POI13_mor) C++14
100 / 100
 2391 ms 102764 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 < n;i ++){
		for(int j = 0;j < n;j ++){
			dp[i][j][0] = 5001;
			dp[i][j][1] = 5001;
		}
	}
	for(int i = 0; i < m;i ++){
		int a, b;
		cin >> a >> b;
		a--; b--;
		dp[a][a][0] = 0;
		dp[b][b][0] = 0;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	
	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});
		while(!q.empty()){
			pair<int,short> c = q.front(); q.pop();
			//if(vis[c.f][c.s%2])continue;
			if(dp[i][c.f][c.s%2] != c.s)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(c.s+1 < dp[i][u][(pa+1)%2]){
					assert(c.s+1 <= 5000);
					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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 348 ms 5088 KB Output is correct

Subtask #2
10.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 Correct 1 ms 512 KB Output is correct
4 Correct 353 ms 5100 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 16 ms 2796 KB Output is correct
2 Correct 3 ms 1388 KB Output is correct
3 Correct 23 ms 3436 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4332 KB Output is correct
2 Correct 14 ms 6252 KB Output is correct
3 Correct 67 ms 6252 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 15468 KB Output is correct
2 Correct 15 ms 5868 KB Output is correct
3 Correct 369 ms 24428 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 853 ms 28524 KB Output is correct
2 Correct 41 ms 24300 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1952 ms 83004 KB Output is correct
2 Correct 133 ms 25068 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2185 ms 102764 KB Output is correct
2 Correct 362 ms 97464 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2391 ms 102636 KB Output is correct
2 Correct 625 ms 93956 KB Output is correct