#include "werewolf.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> v[3000];
void dfs(int x, vector<bool> &y, int z, int w){for(auto i:v[x]) if(z<=i&&i<=w&&!y[i]) y[i] = 1, dfs(i, y, z, w);}
vector<int> check_validity(int n, vector<int> x, vector<int> y, vector<int> s, vector<int> e, vector<int> l, vector<int> r)
{
int q = s.size();
vector<int> a(q);
vector<bool> b(n), c(n);
for(int i=0;i<x.size();i++) v[x[i]].push_back(y[i]), v[y[i]].push_back(x[i]);
for(int i=0;i<q;i++)
{
fill(b.begin(), b.end(), 0), fill(c.begin(), c.end(), 0), b[s[i]] = c[e[i]] = 1, dfs(s[i], b, l[i], n-1), dfs(e[i], c, 0, r[i]);
for(int j=0;j<n;j++) a[i]|=b[j]&c[j];
}
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:11:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<x.size();i++) v[x[i]].push_back(y[i]), v[y[i]].push_back(x[i]);
~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
500 KB |
Output is correct |
3 |
Correct |
2 ms |
576 KB |
Output is correct |
4 |
Correct |
2 ms |
576 KB |
Output is correct |
5 |
Correct |
2 ms |
576 KB |
Output is correct |
6 |
Correct |
2 ms |
576 KB |
Output is correct |
7 |
Correct |
2 ms |
576 KB |
Output is correct |
8 |
Correct |
2 ms |
576 KB |
Output is correct |
9 |
Correct |
3 ms |
576 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
500 KB |
Output is correct |
3 |
Correct |
2 ms |
576 KB |
Output is correct |
4 |
Correct |
2 ms |
576 KB |
Output is correct |
5 |
Correct |
2 ms |
576 KB |
Output is correct |
6 |
Correct |
2 ms |
576 KB |
Output is correct |
7 |
Correct |
2 ms |
576 KB |
Output is correct |
8 |
Correct |
2 ms |
576 KB |
Output is correct |
9 |
Correct |
3 ms |
576 KB |
Output is correct |
10 |
Correct |
405 ms |
816 KB |
Output is correct |
11 |
Correct |
248 ms |
948 KB |
Output is correct |
12 |
Correct |
77 ms |
960 KB |
Output is correct |
13 |
Correct |
440 ms |
1104 KB |
Output is correct |
14 |
Correct |
290 ms |
1104 KB |
Output is correct |
15 |
Correct |
362 ms |
1120 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
211 ms |
21472 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
500 KB |
Output is correct |
3 |
Correct |
2 ms |
576 KB |
Output is correct |
4 |
Correct |
2 ms |
576 KB |
Output is correct |
5 |
Correct |
2 ms |
576 KB |
Output is correct |
6 |
Correct |
2 ms |
576 KB |
Output is correct |
7 |
Correct |
2 ms |
576 KB |
Output is correct |
8 |
Correct |
2 ms |
576 KB |
Output is correct |
9 |
Correct |
3 ms |
576 KB |
Output is correct |
10 |
Correct |
405 ms |
816 KB |
Output is correct |
11 |
Correct |
248 ms |
948 KB |
Output is correct |
12 |
Correct |
77 ms |
960 KB |
Output is correct |
13 |
Correct |
440 ms |
1104 KB |
Output is correct |
14 |
Correct |
290 ms |
1104 KB |
Output is correct |
15 |
Correct |
362 ms |
1120 KB |
Output is correct |
16 |
Runtime error |
211 ms |
21472 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
17 |
Halted |
0 ms |
0 KB |
- |