oj.uz

Submission #316030

# Submission time Handle Problem Language Result Execution time Memory
316030 2020-10-24T21:31:11 Z updown1 Tales of seafaring (POI13_mor) C++17
70 / 100
 3000 ms 100856 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0); 
 
const int MAXN = 5005;
 
vector<short> adjList[MAXN];
short paths[MAXN][MAXN][2];
short n, m, a, b;
int k, c;
 
int main() {
	cin.tie(0);ios_base::sync_with_stdio(0); 
	
	cin >> n >> m >> k;
 
	for (short i = 0; i < n; i++) {
		for (short j = 0; j < n; j++) {
			paths[i][j][0] = 32760;
			paths[i][j][1] = 32760;
		}
	}
	for (short i = 0; i < m; i++) {
		cin >> a >> b;
		a--;
		b--;
		paths[a][a][0] = 0;
		paths[b][b][0] = 0;
		adjList[a].push_back(b);
		adjList[b].push_back(a);
	}
	queue<pair<short, short>> q;
	for (short 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] == -1 || 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++) {
		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
10.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 Correct 1 ms 512 KB Output is correct
4 Correct 2429 ms 5112 KB Output is correct

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

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 4 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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 4352 KB Output is correct
2 Correct 35 ms 6272 KB Output is correct
3 Correct 88 ms 6264 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 15404 KB Output is correct
2 Correct 25 ms 5760 KB Output is correct
3 Correct 382 ms 24384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2892 ms 28288 KB Output is correct
2 Correct 45 ms 24192 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3091 ms 81784 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 3068 ms 100856 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 3083 ms 100844 KB Time limit exceeded
2 Halted 0 ms 0 KB -