oj.uz

Submission #315815

# Submission time Handle Problem Language Result Execution time Memory
315815 2020-10-24T03:21:27 Z shrek12357 Tales of seafaring (POI13_mor) C++14
70 / 100
 880 ms 131076 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<int> adjList[MAXN];
int 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++) {
			paths[i][j][0] = INT_MAX;
			paths[i][j][1] = INT_MAX;
		}
	}
	for (int i = 0; i < m; i++) {
		int a, b;
		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<int, int>> q;
	for (int i = 0; i < n; i++) {
		q.push({ i, 0 });
		while (q.size() > 0) {
			int cur = q.front().first;
			int 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++) {
		int a, b, c;
		cin >> a >> b >> c;
		a--;
		b--;
		if (paths[a][b][c%2] == INT_MAX || c < paths[a][b][c % 2]) {
			cout << "NIE" << endl;
		}
		else {
			cout << "TAK" << endl;
		}
	}
	*/
	int a, b, d;
	for (int i = 0; i<k; i++) {
		cin >> a >> b >> d;
		a--;
		b--;
		if (paths[a][b][d % 2] != INT_MAX && paths[a][b][d % 2] <= d) {
			cout << "TAK" << '\n';
		}
		else {
			cout << "NIE" << "\n";
		}
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 335 ms 7544 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 330 ms 8056 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3328 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 25 ms 4480 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5800 KB Output is correct
2 Correct 16 ms 8832 KB Output is correct
3 Correct 71 ms 8824 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 24316 KB Output is correct
2 Correct 20 ms 7936 KB Output is correct
3 Correct 408 ms 39936 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 880 ms 47736 KB Output is correct
2 Correct 52 ms 39936 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 93 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 97 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 91 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -