oj.uz

Submission #316026

# Submission time Handle Problem Language Result Execution time Memory
316026 2020-10-24T21:22:48 Z updown1 Tales of seafaring (POI13_mor) C++17
30 / 100
 3000 ms 100848 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 5005;
 
vector<int> adjList[MAXN];
short paths[MAXN][MAXN][2];
 
int main() {
	cin.tie(0);ios_base::sync_with_stdio(0); 
	int n, m, k;
	cin >> n >> m >> k;
 
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
          if (i != j) 
			paths[i][j][0] = 32760;
		paths[i][j][1] = 32760;
          
		}
	}
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		adjList[a].push_back(b);
		adjList[b].push_back(a);
	}
	queue<pair<short, short>> q;
	for (int i = 0; i < n; i++) {
		q.push({ i, 0 });
		while (q.size() > 0) {
			short cur = q.front().first;
			short num = q.front().second;
			q.pop();
			for (auto j : adjList[cur]) {
				if (paths[i][j][(num + 1) % 2] > num + 1) {
					q.push({ j, num + 1 });
					paths[i][j][(num + 1) % 2] = num + 1;
				}
			}
		}
 
	}
	for (int i = 0; i < k; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		a--;
		b--;
		if (paths[a][b][c%2] == 32760 || c < paths[a][b][c % 2]) {
			cout << "NIE" << endl;
		}
		else {
			cout << "TAK" << endl;
		}
	}
}

Subtask #1
0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2688 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 25 ms 3456 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 4472 KB Output is correct
2 Correct 35 ms 6272 KB Output is correct
3 Incorrect 94 ms 6272 KB Output isn't correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 15608 KB Output is correct
2 Correct 25 ms 5632 KB Output is correct
3 Incorrect 380 ms 24312 KB Output isn't correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2916 ms 28376 KB Output is correct
2 Correct 46 ms 24192 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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