oj.uz

Submission #316057

# Submission time Handle Problem Language Result Execution time Memory
316057 2020-10-25T03:35:17 Z Marlov Tales of seafaring (POI13_mor) C++14
100 / 100
 2223 ms 112764 KB 
/*
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 = 31111;
 
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;
	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++){
			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--;
		dist[u][u][0]=0;
		dist[v][v][0]=0;
		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]!=INF&&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

mor.cpp: In function 'void bfs(int)':
mor.cpp:40:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   for(int i=0;i<adj[cn].size();i++){
      |               ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 98424 KB Output is correct
2 Correct 74 ms 98424 KB Output is correct
3 Correct 74 ms 98424 KB Output is correct
4 Correct 390 ms 103160 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 98424 KB Output is correct
2 Correct 74 ms 98552 KB Output is correct
3 Correct 80 ms 98552 KB Output is correct
4 Correct 394 ms 103288 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 98552 KB Output is correct
2 Correct 74 ms 98552 KB Output is correct
3 Correct 75 ms 98552 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 98552 KB Output is correct
2 Correct 77 ms 98552 KB Output is correct
3 Correct 95 ms 98552 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 98808 KB Output is correct
2 Correct 85 ms 98680 KB Output is correct
3 Correct 139 ms 98808 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 98940 KB Output is correct
2 Correct 84 ms 98552 KB Output is correct
3 Correct 439 ms 98936 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 103288 KB Output is correct
2 Correct 96 ms 98552 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1910 ms 107960 KB Output is correct
2 Correct 184 ms 101800 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2056 ms 109816 KB Output is correct
2 Correct 341 ms 103804 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2223 ms 111096 KB Output is correct
2 Correct 593 ms 112764 KB Output is correct