Submission #1092441

#TimeUsernameProblemLanguageResultExecution timeMemory
1092441huyngoWerewolf (IOI18_werewolf)C++17
15 / 100
173 ms29780 KiB
#include "werewolf.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using i64 = long long; void __print(int x) { cerr << x; } void __print(long x) { cerr << x; } void __print(long long x) { cerr << x; } void __print(unsigned x) { cerr << x; } void __print(unsigned long x) { cerr << x; } void __print(unsigned long long x) { cerr << x; } void __print(float x) { cerr << x; } void __print(double x) { cerr << x; } void __print(long double x) { cerr << x; } void __print(char x) { cerr << '\'' << x << '\''; } void __print(const char* x) { cerr << '"' << x << '"'; } void __print(const string& x) { cerr << '"' << x << '"'; } void __print(bool x) { cerr << (x ? "true" : "false"); } template<typename T, typename V> void __print(const pair<T, V>& x) { cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}'; } template<typename T> void __print(const T& x) { int f = 0; cerr << '{'; for (auto& i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}"; } void _print() { cerr << "]\n"; } template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); } #define dbg(x...) cerr << "[" << #x << "] = ["; _print(x) #define ln "\n" #define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define all(x) (x).begin(), (x).end() #define rep(i,a,b) for(int i=a; i<=b; ++i) #define ar array int Bit(int mask, int b) { return (mask >> b) & 1; } const ll base = 311, MOD = 998244353, M = 1e9 + 7, INF = 1e18; 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) { int Q = S.size(); int M = X.size(); std::vector<int> ANS(Q); vector<vector<int>> adj(N); rep(i, 0, M - 1) { adj[X[i]].push_back(Y[i]); adj[Y[i]].push_back(X[i]); } if (N <= 3000) { rep(i, 0, Q - 1) { vector<int> vis(N, 0); int ok = 0; auto dfs = [&](auto self, int u, int lb, int ub) -> void { if (u < lb || u > ub) return; vis[u] = (ub == 1e8 ? 1 : 2); for (int v : adj[u]) if (!vis[v]) { if (lb <= v && v <= ub) self(self, v, lb, ub); } else { if (lb == -1 && vis[v] == 1 && v <= R[i]) ok = 1; } }; dfs(dfs, S[i], L[i], 1e8); if (E[i] <= R[i] && vis[E[i]] == 1) ok = true; dfs(dfs, E[i], -1, R[i]); ANS[i] = ok; } } return ANS; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...