# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
278707 | jairRS | Werewolf (IOI18_werewolf) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "werewolf.h"
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
set<int> adj[3004];
int memo[3004][2];
int dp(int curcity, int endcity, int l, int r, vector<bool> visited, int form = 0)
{
if (form == 0 & curcity < l)
return 0;
if (form == 1 & curcity > r)
return 0;
if (curcity == endcity && form == 1)
return 1;
if (memo[curcity][form] != -1)
return memo[curcity][form];
visited[curcity] = true;
int res = 0;
for (int adjcity : adj[curcity])
{
if (visited[adjcity])
{
continue;
}
res += dp(adjcity, endcity, l, r, visited, form);
}
if (form != 1)
{
vector<bool> nvisited(visited.size());
res += dp(curcity, endcity, l, r, nvisited, 1);
}
memo[curcity][form] = res;
return res;
}
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();
for (int i = 0; i < M; i++)
{
adj[X[i]].insert(Y[i]);
adj[Y[i]].insert(X[i]);
}
std::vector<int> A(Q);
for (int i = 0; i < Q; i++)
{
vector<bool> nvisited(N);
memset(memo, -1, sizeof(memo));
int ans = dp(S[i], E[i], L[i], R[i], nvisited);
ans = min(ans, 1);
A[i] = ans;
}
return A;
}