제출 #968569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
968569		duckindog	늑대인간 (IOI18_werewolf)	C++17	0 / 100	4027 ms	31116 KiB

werewolf

#include <bits/stdc++.h>
#include "werewolf.h"

using namespace std;

const int N = 200'000 + 10;
vector<int> ad[N];
bool f[N][2], vt[N];
int mk[N];

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 m = x.size(), q = s.size();
  for (int i = 0; i < m; ++i) { 
    int u = x[i], v = y[i];
    ad[u].push_back(v);
    ad[v].push_back(u);
  }
  
  vector<int> answer;
  for (int i = 0; i < q; ++i) { 
    for (int j = 0; j < n; ++j) mk[j] = (j < l[i] ? 0 : j <= r[i] ? 1 : 2);
    
    memset(f, false, sizeof f);
    memset(vt, false, sizeof vt);

    queue<int> que;
    f[s[i]][0] = vt[s[i]] = true;
    que.push(s[i]);
    while (que.size()) { 
      auto u = que.front(); que.pop();
      for (const auto& v : ad[u]) { 
        if (vt[v]) continue;
        vt[v] = true;
        if (mk[v] <= 1) f[v][0] = f[u][0];
        if (mk[v] >= 1) f[v][1] = (f[u][1] || mk[v] == 1);
        if (f[v][0] || f[v][1]) que.push(v);
      }
    }
    
    answer.push_back(f[e[i]][1]);
  }
  return vector(answer.rbegin(), answer.rend());
}

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