Submission #1015255

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015255		mindiyak	Werewolf (IOI18_werewolf)	C++14	0 / 100	4026 ms	524288 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

int M,Q,N;
vvi paths;
int ans_found = 0;

void dfs(int S,int E,int L, int R,int pos,int state,int can,vi visited){
  if(ans_found)return;
  if(pos == E){
    if(state == 2){ans_found=1;return;}
    if(can && state == 1){ans_found=1;return;}
  }
  if(visited[pos])return;
  visited[pos] = 1;

  // cout << pos << " " << state << " " << can << endl;

  if(state == 0){
    if(pos > R)state = 0;
    else if(pos >= L && pos <= R){state  = 1;can = 1;}
    else{return;}
  }else if(state == 1){
    if(pos >= L && pos <= R){state  = 1;can = 1;}
    else if(pos < L && can)state = 2;
    else if(pos > R)state = 0;
    else{return;}
  }else if(state == 2){
    if(pos < L)state = 2;
    else{return;}
  }
  
  for(int i:paths[pos]){
    dfs(S,E,L,R,i,state,can,visited);
  }
}

vi check_validity(int n, vi X, vi Y, vi S, vi E ,vi L, vi R) {
  N = n;M = X.size(); Q = L.size(); 
  vi ans(Q);
  paths = vvi(n,vi());
  FOR(i,0,M){
    paths[X[i]].pb(Y[i]);
    paths[Y[i]].pb(X[i]);
  }

  FOR(i,0,Q){
    ans_found = 0;
    vi visited(N,0);
    dfs(S[i],E[i],L[i],R[i],S[i],0,0,visited);
    ans[i] = ans_found;
  }
  return  ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 8
• Subtask 3: 0 / 34
• Subtask 4: 0 / 51