Submission #515889

#	Time	Username	Problem	Language	Result	Execution time	Memory
515889		ac2hu	새로운 문제 (POI13_mor)	C++14	40 / 100	1494 ms	131076 KiB

mor

#include <bits/stdc++.h>
using namespace std;
void setIO(string name) {
	#ifdef DEBUG
	#else 
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
	#endif
}
signed main(){
	iostream::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	int n,m,k;cin >> n >> m >> k;
	vector<int> adj[n];
	for(int i = 0;i<m;i++){
		int a,b;cin >> a >> b;
		a--;b--;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	int dist[n][n][2];
	for(int i = 0;i<n;i++){
		for(int j= 0;j<n;j++){
			for(int f = 0;f<2;f++)
				dist[i][j][f] = 1e9 + 10;
		}
	}
	for(int i = 0;i<n;i++){
		queue<pair<int,int>> q;
		dist[i][i][0] = 0;
		q.push({i,0});
		while(!q.empty()){
			pair<int,int> x = q.front();
			q.pop();
			for(auto e : adj[x.first]){
				if(dist[i][e][(x.second + 1)%2] > dist[i][x.first][x.second] + 1){
					dist[i][e][(x.second + 1)%2] = dist[i][x.first][x.second] + 1;
					q.push({e,(x.second + 1)%2});
				}
			}
		}
	}
	// for(int i = 0;i<n;i++){
	// 	for(int j =0 ;j<n;j++)
	// 		cout << dist[i][j] << " ";
	// 	cout << "\n";
	// }
	for(int _ = 0;_<k;_++){
		int a,b,d;cin >> a >> b >> d;
		a--;b--;
		if(dist[a][b][d%2] > d)
			cout << "NIE\n";
		else {
			cout << "TAK\n";
		}
	}
}

Compilation message (stderr)

mor.cpp: In function 'void setIO(std::string)':
mor.cpp:7:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mor.cpp:8:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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: 0 / 10
• Subtask 10: 0 / 10