oj.uz

Submission #512034

# Submission time Handle Problem Language Result Execution time Memory
512034 2022-01-16T06:14:21 Z PoPularPlusPlus Tales of seafaring (POI13_mor) C++17
40 / 100
 1749 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const ll mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n , m;
	cin >> n >> m;
	int k;
	cin >> k;
	vector<int> adj[n + 1];
	for(int i = 0; i < m; i++){
		int a,b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	int dis[n + 1][n + 1][2];
	memset(dis,-1,sizeof dis);
	//cout << "came" << endl;
	for(int i = 1; i <= n; i++){
		dis[i][i][0] = 0;
		queue<pair<int,int>> q;
		q.push(mp(i,0));
		while(q.size()){
			pair<int,int> node = q.front();
			q.pop();
			for(int j : adj[node.vf]){
				if(dis[i][j][(node.vs + 1) % 2] == -1){
					dis[i][j][(node.vs + 1) % 2] = dis[i][node.vf][node.vs] + 1;
					q.push(mp(j,(node.vs + 1)%2));
				}
			}
		}
	}
	//cout << "came" << endl;
	while(k--){
		int u , v , t;
		cin >> u >> v >> t;
		if(dis[u][v][t % 2] == -1){
			cout << "NIE\n";
		}
		else if(dis[u][v][t % 2] > t){
			cout << "NIE\n";
		}
		else cout << "TAK\n";
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("rblock.in", "r", stdin);
//freopen("rblock.out", "w", stdout);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1616 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 20 ms 2252 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3292 KB Output is correct
2 Correct 10 ms 5580 KB Output is correct
3 Incorrect 54 ms 5496 KB Output isn't correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 18240 KB Output is correct
2 Correct 11 ms 4812 KB Output is correct
3 Incorrect 318 ms 31896 KB Output isn't correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 688 ms 49580 KB Output is correct
2 Correct 35 ms 31812 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1749 ms 131072 KB Output is correct
2 Correct 101 ms 34976 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 52 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 53 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -