oj.uz

Submission #369883

# Submission time Handle Problem Language Result Execution time Memory
369883 2021-02-22T17:06:00 Z AA_Surely Tales of seafaring (POI13_mor) C++14
30 / 100
 2226 ms 117812 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>

#define FOR(i,x,n) for(int i=x; i<n; i++)
#define F0R(i,n) FOR(i,0,n)
 
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define pb push_back

#define FILL(a, b) memset(a, b, sizeof(a));

using namespace std;
typedef long long LL;

typedef pair<int, int> PII;

typedef vector<int> VI;

const int MAXN = 5000+2;
short int INF = 31111;

int n, m, k, u, v, to, st, fn, len;
VI adj[MAXN];
short int fastest_route[MAXN][MAXN][2];

void Input() {
	cin >> n >> m >> k;
	F0R (i, n) F0R (j, n) fastest_route[i][j][0] = fastest_route[i][j][1] = INF;
	F0R (i, m) {
		cin >> u >> v;
		adj[--u].pb(--v);
		adj[v].pb(u);
	}
}

void Bfs(int now_on) {
	
	queue <PII> keep;
	PII add, on;
	keep.push({now_on, 0});
	
	while (!keep.empty()) {
		on = keep.front(); keep.pop();
		on.S++;
		F0R (i, adj[on.F].size()) {
			to = adj[on.F][i];
			if (fastest_route[now_on][to][on.S & 1] > on.S) {
				fastest_route[now_on][to][on.S & 1] = on.S;
				keep.push({to, on.S});
			}
		}
	}
	
	return;
}

int main() {
	IOS;
	Input();
	F0R (i, n) Bfs(i);
	
	/*
	F0R (i, 8) {
		F0R (j, 8) cout << fastest_route[i][j][0] << "/" << fastest_route[i][j][1] << ' ';
		cout << endl;
	}
//	**/
	
	F0R (i, k) {
		cin >> st >> fn >> len;
		if (fastest_route[st - 1][fn - 1][len & 1] <= len) cout << "TAK\n";
		else cout << "NIE\n";
	}
}

Compilation message

mor.cpp: In function 'void Bfs(int)':
mor.cpp:7:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define FOR(i,x,n) for(int i=x; i<n; i++)
      |                                  ^
mor.cpp:8:18: note: in expansion of macro 'FOR'
    8 | #define F0R(i,n) FOR(i,0,n)
      |                  ^~~
mor.cpp:50:3: note: in expansion of macro 'F0R'
   50 |   F0R (i, adj[on.F].size()) {
      |   ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 289 ms 5100 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Incorrect 288 ms 4972 KB Output isn't correct

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2668 KB Output is correct
2 Incorrect 3 ms 1388 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 4460 KB Output is correct
2 Incorrect 13 ms 6252 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 15468 KB Output is correct
2 Incorrect 15 ms 5740 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 836 ms 28388 KB Output is correct
2 Correct 40 ms 24172 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1880 ms 96748 KB Output is correct
2 Incorrect 115 ms 27444 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1981 ms 117740 KB Output is correct
2 Incorrect 325 ms 101356 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2226 ms 117812 KB Output is correct
2 Incorrect 551 ms 104940 KB Output isn't correct