제출 #260784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
260784		updown1	새로운 문제 (POI13_mor)	C++17	60 / 100	2400 ms	106624 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 = 31000;
 
int N,M,K;
vector<int> adj[maxN];
//from u to v min even and min odd
short dist[maxN][maxN][2];
 
void bfs(int p){
	queue< pair<int,int> > q;
	dist[p][p][0]=0;
	q.push(make_pair(p,0));
	while(!q.empty()){
		int cn=q.front().first;
		int cd=q.front().second;
		q.pop();
		for(int i=0;i<adj[cn].size();i++){
			int nn=adj[cn][i];
			if(dist[p][nn][(cd+1)%2]>cd+1){
				dist[p][nn][(cd+1)%2]=cd+1;
				q.push(make_pair(nn,cd+1));
			}
		}
	}
}
 
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++){
		bfs(i);
	}
	int a,b,d;
	for(int i=0;i<K;i++){
		cin>>a>>b>>d;
		a--;
		b--;
		if(dist[a][b][d%2]<=min(INF-1, 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
*/

컴파일 시 표준 에러 (stderr) 메시지

mor.cpp: In function 'void bfs(int)':
mor.cpp:41:16: 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: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10