Submission #1012836

#	Time	Username	Problem	Language	Result	Execution time	Memory
1012836		Malix	Werewolf (IOI18_werewolf)	C++14	15 / 100	4029 ms	31980 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

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();
  vii a;
  a.resize(N);
  REP(i,0,m){
    a[X[i]].PB(Y[i]);
    a[Y[i]].PB(X[i]);
  }
  vi ans(Q,0);
  REP(i,0,Q){
    queue<int> pq;
    vi c(N,0),d(N,0);
    pq.push(S[i]);
    while(!pq.empty()){
      int k=pq.front();
      pq.pop();
      if(c[k]||k<L[i])continue;
      c[k]=1;
      for(auto u:a[k])pq.push(u);
    }
    pq.push(E[i]);
    while(!pq.empty()){
      int k=pq.front();
      pq.pop();
      if(d[k]||k>R[i])continue;
      d[k]=1;
      for(auto u:a[k])pq.push(u);
    }
    REP(j,L[i],R[i]+1){
      ans[i]|=(c[j]&d[j]);
    }
  }
  return ans;
}

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