제출 #599036

#제출 시각아이디문제언어결과실행 시간메모리
599036proma늑대인간 (IOI18_werewolf)C++17
0 / 100
154 ms19620 KiB
#include "werewolf.h" #include <bits/stdc++.h> using namespace std; const int N = 3005; vector <int> g[N]; int used[N]; void dfs(int v, int x, int l, int r, int wolf = 0) { if (!wolf and v < l) return; if (v == x) wolf = 1; if (wolf and v > r) return; used[v] = 1; for (auto i: g[v]) { if (!used[i]) { dfs(i, x, l, r, wolf); } } } vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) { for (int i = 0; i < N; i ++) { g[X[i]].push_back(Y[i]); g[Y[i]].push_back(X[i]); } int Q = S.size(); vector<int> A(Q); for (int i = 0; i < Q; ++i) { A[i] = 0; for (int j = 0; j < N; j ++) { memset(used, 0, sizeof(used)); dfs(S[i], j, L[i], R[i]); if (used[E[i]]) A[i] = 1; } } return A; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...