제출 #416400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
416400		AmineTrabelsi	Werewolf (IOI18_werewolf)	C++14	0 / 100	4045 ms	36208 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
const int Nx = 200000;
vector<int> gr[Nx+5];
/*
struct node{
    int x;
    bool form; // 0 human 1 werewolf
    node(){}
    node(int _x,bool _form){
        x = _x;
        form = _form;
    }
};*/
int e,l,r;
bool vis[Nx+5][3];
bool pre[Nx+5][3];
bool dfs(int node,bool form){
    //cerr<< node <<" "<< form << '\n';
    if(node == e && form){
        return 1;
    }
    if(form && node > r)return 0;
    if(!form && node < l)return 0;
    bool &ans = pre[node][form];
    if(vis[node][form])return ans;
    vis[node][form] = 1;
    for(auto u:gr[node]){
        if(form && u <= r){
            ans = ans || dfs(u,1);
        }else if(!form){
            if(u >= l)ans = ans || dfs(u,0);
            if(ans)return ans;
            if(node >= l && node <= r && u <= r)ans = ans || dfs(u,1);
        }
        if(ans)return ans;
    }
    return ans;
}
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();
    vector<int> ans(Q,0);
    for(int i=0;i<M;i++){
        gr[X[i]].push_back(Y[i]);
        gr[Y[i]].push_back(X[i]);
    }
    for(int i=0;i<Q;i++){
        memset(vis,0,sizeof vis);
        memset(pre,0,sizeof pre); 
        e = E[i], l = L[i], r = R[i];
        ans[i] = dfs(S[i],0);
    }
    return ans;
}

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