Submission #791066

#	Time	Username	Problem	Language	Result	Execution time	Memory
791066		YassirSalama	늑대인간 (IOI18_werewolf)	C++14	15 / 100	242 ms	19660 KiB

werewolf

#include "werewolf.h"
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl;
#define ll long long
#define pb push_back
const int MAXN=3500;
vector<int> c(MAXN,0);
vector<vector<int>> v(MAXN);
void dfs(int node,int ab,vector<bool>& visited){
	visited[node]=true;
	for(auto x:v[node]){
		if(visited[x]) continue;
		if(ab==1&&c[x]<=1){
			//He is human
			dfs(x,ab,visited);
		}else if(ab==2&&c[x]>=1){
			//he is a werewolf
			dfs(x,ab,visited);
		}
	}
}
vector<int> check_validity(int n, vector<int> a, vector<int> b, 
					vector<int> ql, vector<int> qr,
					vector<int> l, vector<int> r) {
	int q = ql.size();
	for(int i=0;i<a.size();i++){
		v[a[i]].pb(b[i]);
		v[b[i]].pb(a[i]);
	}
	vector<int> ans(q,0);
	for(int j=0;j<q;j++){
		for(int i=0;i<n;i++){
			if(i<l[j]) {
				c[i]=2;//You should be a werewolf
			}else if(i<=r[j]) c[i]=1;//you can transform here
			else c[i]=0;//You should be a human here
		}
		vector<bool> visited1(MAXN,false);
		vector<bool> visited2(MAXN,false);
		dfs(ql[j],1,visited1);
		dfs(qr[j],2,visited2);
		for(int i=l[j];i<=r[j];i++){
			if(visited1[i]&&visited2[i]) {
				ans[j]=1;break;
			}
		}
 
	}
	return ans;
}

Compilation message (stderr)

werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i=0;i<a.size();i++){
      |              ~^~~~~~~~~

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