제출 #301805

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301805		Nnandi	Werewolf (IOI18_werewolf)	C++14	15 / 100	304 ms	29816 KiB

werewolf

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

using namespace std;

const int maxn = 3005;
vector<int> graf[maxn];

bool volte_s[maxn], volte_e[maxn];

void reset(int n) {
    for(int i=0;i<n;i++) {
        volte_s[i] = false;
        volte_e[i] = false;
    }
}

void bejar_s(int start, int l) { //minimum l
    if(start < l) return;
    volte_s[start] = true;
    for(int s:graf[start]) {
        if(!volte_s[s] && l <= s)  {
            bejar_s(s,l);
        }
    }
}

void bejar_e(int start, int r) { //maximum r
    if(r < start) return;
    volte_e[start] = true;
    for(int s:graf[start]) {
        if(!volte_e[s] && s <= r)  {
            bejar_e(s,r);
        }
    }
}

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 q = S.size();
      int m = X.size();
      int n = N;
      vector<int> answer(q,0);
      for(int i=0;i<m;i++) {
            graf[X[i]].push_back(Y[i]);
            graf[Y[i]].push_back(X[i]);
      }
      for(int i=0;i<q;i++) {
        reset(n);
        bejar_s(S[i],L[i]);
        bejar_e(E[i],R[i]);
        for(int j=0;j<n;j++) {
            if(volte_e[j] && volte_s[j]) {
                answer[i] = 1;
            }
        }
      }
      return answer;
}

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