이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
using idata = vector<int>;
using igrid = vector<idata>;
struct Road {
int x, y;
Road (int _x, int _y) {
x = min(_x, _y);
y = max(_x, _y);
}
};
using t_Roads = vector<Road>;
using t_Graph = vector<t_Roads>;
t_Graph roads;
igrid visited; int stage = 0;
bool dfs (int source, int state, int target, int left, int right) {
if (state >= 2)
return false;
if (state == 0 && source < left) return false;
if (state == 1 && source > right) return false;
if (source == target) return true;
if (visited[source][state] == stage) return false;
visited[source][state] = stage;
for (Road &road : roads[source]) {
int next = road.x == source ? road.y : road.x;
if (road.x < left && right < road.y) continue ;
if (dfs(next, state, target, left, right)
|| dfs(next, state + 1, target, left, right))
return true;
}
return false;
}
idata check_validity(int N, idata X, idata Y,
idata S, idata E,
idata L, idata R) {
int M = X.size(); int Q = S.size();
roads.resize(N);
for (int i = 0; i < M; i ++) {
Road road (X[i], Y[i]);
roads[road.x].push_back(road);
roads[road.y].push_back(road);
}
idata A(Q);
visited.resize(N, idata(2));
for (int i = 0; i < Q; i ++) {
stage ++;
A[i] = dfs(S[i], 0, E[i], L[i], R[i]);
}
return A;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |