oj.uz

답안 #1111545

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111545 2024-11-12T09:25:59 Z YSH2020 Drivers (BOI24_drivers) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m, u; cin >> n >> m >> u;
	vector <vector<pair<int, int>>> edges;
	vector<pair<int, int>> empty;
	for (int i= 0; i < n+5; i++) edges.push_back(empty);
	for (int i = 0; i < m; i++) {
		int x, y, z; cin >> x >> y >> z;
		edges[x].push_back({y, z});
		edges[y].push_back({x, z});
	}
	while (u--) {
		int x, y, z; cin >> x >> y >> z;
		int visit[n+5]; for (int i=1; i<=n;i++) visit[i] = 0;
		queue<int> tmp;
		tmp.push(x);
		visit[x] = 1;
		while (visit[y] == 0 and tmp.size() > 0) {
			auto cur = tmp.front();
			tmp.pop();
			for (auto i:edges[cur]) {
				if (i.second <= z and visit[i.first] == 0) {tmp.push(i.first); visit[i.first] = 1;}
			}
		}
		if (visit[y] == 0) cout << "NE" << '\n';
		else cout << "TAIF" << '\n';
	}
}

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -