Submission #257693

#	Time	Username	Problem	Language	Result	Execution time	Memory
257693		Marlov	Tales of seafaring (POI13_mor)	C++14	0 / 100	3082 ms	103592 KiB

mor

/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
 
#define maxN 5005
const short INF = 30000;
 
int N,M,K;
vector<int> adj[maxN];
//from u to v min even and min odd
short dist[maxN][maxN][2];
 
void dfs(int cn,int cd,int p){
	for(int i=0;i<adj[cn].size();i++){
		int nn=adj[cn][i];
		if(nn!=p&&cd+1<dist[p][nn][(cd+1)%2]){
			dist[p][nn][(cd+1)%2]=cd+1;
			dfs(nn,cd+1,p);
		}
	}
}
 
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	for(int i=0;i<maxN;i++){
		for(int j=0;j<maxN;j++){
			if(i!=j){
			dist[i][j][0]=INF;
			}
			dist[i][j][1]=INF;
		}
	}
	cin>>N>>M>>K;
	int u,v;
	for(int i=0;i<M;i++){
		cin>>u>>v;
		u--;
		v--;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for(int i=0;i<N;i++){
		dfs(i,0,i);
	}
	int a,b,d;
	for(int i=0;i<K;i++){
		cin>>a>>b>>d;
		a--;
		b--;
		if(dist[a][b][d%2]<=d){
			cout<<"TAK"<<'\n';
		}else{
			cout<<"NIE"<<"\n";
		}
	}
 
 
    return 0;
}
 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

Compilation message (stderr)

mor.cpp: In function 'void dfs(int, int, int)':
mor.cpp:34:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<adj[cn].size();i++){
              ~^~~~~~~~~~~~~~~

• 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