#include<bits/stdc++.h>
#include "werewolf.h"
using namespace std;
vector<vector<int>>adj(10000);
bool ok;
void dfs (int s,int par,int bot,int l,int r,int e,bool changed){
if (ok)return;
if (s==e){
ok=true;
return;
}
for (auto x:adj[s]){
if (x!=par){
if (bot==0&&x>=r){
dfs(x,s,bot,l,r,e,changed);
}
else if (bot==1&&x<=l){
dfs(x,s,bot,l,r,e,changed);
}
else if (x>l&&x<r){
if (!changed)
dfs(x,s,bot^1,l,r,e,true);
dfs(x,s,bot,l,r,e,changed);
}
}
}
}
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
std::vector<int> s, std::vector<int> E,
std::vector<int> L, std::vector<int> R) {
vector<int>A(E.size());
for (int i =0;i<N;++i){
adj[X[i]].push_back(Y[i]);
adj[Y[i]].push_back(X[i]);
}
//0 - human
//1 - wolf
for (int i =0;i<E.size();++i){
ok=false;
int bot = 0;
if (s[i]<L[i]){
bot = 1;
}
else if (s[i]>=L[i]&&s[i]<R[i]){
bot = 2;
}
if (bot == 1||bot==0){
dfs(s[i],-1,bot,L[i]-1,R[i],E[i],false);
}
else {
dfs(s[i],-1,0,L[i]-1,R[i],E[i],false);
dfs(s[i],-1,1,L[i]-1,R[i],E[i],false);
}
A[i]|=ok;
}
return A;
}
Compilation message
werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
38 | for (int i =0;i<E.size();++i){
| ~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
409 ms |
524292 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
409 ms |
524292 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
200 ms |
21552 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
409 ms |
524292 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |