Submission #637208

#	Time	Username	Problem	Language	Result	Execution time	Memory
637208		Cyber_Wolf	Tales of seafaring (POI13_mor)	C++14	0 / 100	519 ms	131072 KiB

mor

//Problem: Tales of seafaring
//Contest: POI '13 Day2 P2 MOR
//Link: https://oj.uz/problem/view/POI13_mor

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);
#define endl \n
#define lbound(x, y) lower_bound(x.begin(), x.end(), y) 
#define ubound(x, y) upper_bound(x.begin(), x.end(), y) 
#define sortasc(v) sort(v.begin(), v.end())	
#define sortdesc(v) sort(v.rbegin(), v.rend())	
#define custom_array(a,l, r) int _##a[r-l+1]; int*a=_##a-l;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const lg MOD = 1e9+7, N = 5e3+5, M = 1e7+1, SZ = 1e3+1;
/*
bitset<N> primes;
lg pwrs[N], inv[N];

lg fast_power(lg n, lg k)
{
	if(!k)	return 1;
	if(k&1)	return (fast_power(n, k-1)*n)%MOD;
	lg x = fast_power(n, k/2)%MOD;
	return (x*x)%MOD;
}

void sieve()
{
	primes.set();
	primes[0] = primes[1] = 0;
	for(lg i = 2; i < N; i++)
	{
		if(!primes[i])	continue;
		for(lg j = i*i; j < N; j += i)
		{
			primes[j] = 0;
		}
	}
	return;
}

struct matrix
{
	vector<vector<lg>> con = vector<vector<lg>> (SZ, vector<lg> (SZ));
	matrix operator *(const matrix& a)
	{
		matrix product;
		for(int i = 0; i < (lg)con.size(); i++)
		{
			for(int j = 0; j < (lg)a.con[0].size(); j++)
			{
				for(int k = 0; k < (lg)a.con.size(); k++)
				{
					product.con[i][j] = (product.con[i][j]+(con[i][k]*a.con[k][j])%MOD)%MOD; 
				}
			}
		}
		return product;
	}
};

void preprocess(lg x)
{
	inv[2e5] = fast_power(x, MOD-2);
	for(int i = 2e5-1; i > 1; i--)
	{
		inv[i] = (inv[i+1]*i)%MOD;
	}
	pwrs[0] = 1;
	for(int i = 1; i <= 2e5; i++)
	{
		pwrs[i] = (pwrs[i]*i)%MOD;
	}
	return;
}

*/
vector<lg> adj[N];
lg dist[N][N], vis[N], tmp;

void bfs(lg src)
{
	queue<lg> q;
	tmp++;
	vis[src] = tmp;
	q.push(src);
	dist[src][src] = 0;
	lg dis = 0;
	while(q.size())
	{
		lg sz = q.size();
		while(sz--)
		{
			lg u = q.front();
			q.pop();
			dist[src][u] = dis;
			for(auto it : adj[u])
			{
				if(vis[it] == tmp)	continue;
				q.push(it);
				vis[it] = tmp;
			}
		}
		dis++;
	}
	return;
}

int main()
{
	fastio;
	lg n, m, q;
	cin >> n >> m >> q;
	for(int i = 0; i <= n; i++)	memset(dist[i], 0x3f, sizeof(dist[i]));
	for(int i = 0; i < m; i++)
	{
		lg u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for(int i = 1; i <= n; i++)	bfs(i);
	// for(int i = 1; i <= n; i++)
	// {
		// for(int j = 1; j <= n; j++)
		// {
			// cout << dist[i][j] << ' ';
		// }
		// cout << '\n';
	// }
	while(q--)
	{
		lg s, t, k;
		cin >> s >> t >> k;
		if(s == t && k && adj[s].empty())
		{
			cout << "NIE\n";
			continue;
		}
		//cout << dist[s][t] << ' ' <<  dist[0][0] << '\n'; 
		if(dist[s][t] == dist[0][0] || k < dist[s][t])	
		{
			cout << "NIE\n";
			continue;
		}
		k -= dist[s][t];
		cout << (k%2 ? "NIE\n" : "TAK\n");
	}

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10