Submission #771891

#	Time	Username	Problem	Language	Result	Execution time	Memory
771891		alvingogo	늑대인간 (IOI18_werewolf)	C++14	15 / 100	4078 ms	23088 KiB

werewolf

#include <bits/stdc++.h>
#include "werewolf.h"
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

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();
    vector<int> ans(q);
	int m=x.size();
	vector<vector<int> > f(n);
	for(int i=0;i<m;i++){
		f[x[i]].push_back(y[i]);
		f[y[i]].push_back(x[i]);
	}
    for(int i=0;i<q;i++){
        queue<int> q1;
        q1.push(s[i]);
        vector<int> vis(n),vis2(n);
        vis[s[i]]=1;
        while(q1.size()){
            auto h=q1.front();
            q1.pop();
            for(auto y:f[h]){
                if(y>=l[i] && !vis[y]){
                    vis[y]=1;
                    q1.push(y);
                }
            }
        }
        q1.push(e[i]);
        vis2[e[i]]=1;
        while(q1.size()){
            auto h=q1.front();
            q1.pop();
            for(auto y:f[h]){
                if(y<=r[i] && !vis2[y]){
                    vis2[y]=1;
                    q1.push(y);
                }
            }
        }
        for(int j=0;j<n;j++){
            if(vis[j]+vis2[j]==2){
                ans[i]=1;
            }
        }
    }
	return ans;
}

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