# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055403 | 2024-08-12T18:44:54 Z | ArthuroWich | Werewolf (IOI18_werewolf) | C++17 | 4000 ms | 22356 KB |
#include "werewolf.h" #include<bits/stdc++.h> using namespace std; 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<vector<int>> adj(n); for (int i = 0; i < X.size(); i++) { adj[X[i]].push_back(Y[i]); adj[Y[i]].push_back(X[i]); } for (int i = 0; i < q; i++) { int l = L[i], r = R[i]; vector<int> vis(n, 0); queue<int> q; if (S[i] >= l) { q.push(S[i]); } if (E[i] > r) { a[i] = 0; continue; } while(!q.empty()) { int a = q.front(); q.pop(); if (vis[a]) { continue; } vis[a] = 1; for (int b : adj[a]) { if (b >= l) { q.push(b); } } } for (int i = l; i <= r; i++) { if (vis[i]) { for (int b : adj[i]) { if (b < l) { q.push(b); } } } } while(!q.empty()) { int a = q.front(); q.pop(); if (vis[a]) { continue; } vis[a] = 1; for (int b : adj[a]) { if (b < r) { q.push(b); } } } a[i] = vis[E[i]]; } return a; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4062 ms | 22356 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |