Submission #316029

#	Time	Username	Problem	Language	Result	Execution time	Memory
316029		updown1	Tales of seafaring (POI13_mor)	C++17	70 / 100	3106 ms	100860 KiB

mor

#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];
short paths[MAXN][MAXN][2];
int n, m, k;
int a, b, c;
 
int main() {
	cin.tie(0);ios_base::sync_with_stdio(0); 
	
	cin >> n >> m >> k;
 
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			paths[i][j][0] = 32760;
			paths[i][j][1] = 32760;
		}
	}
	for (int 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<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++) {
		
		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 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10