Submission #435115

#	Time	Username	Problem	Language	Result	Execution time	Memory
435115		Apiram	Werewolf (IOI18_werewolf)	C++14	0 / 100	229 ms	23088 KiB

werewolf

#include<bits/stdc++.h>
#include "werewolf.h"
using namespace std;
vector<vector<int>>adj(10000);
bool ok;
vector<vector<bool>>visited(10000,vector<bool>(2,false));
void dfs (int s,int bot,int l,int r,int e,bool changed){
	if (ok)return;
	if (s==e){
		ok=true;
		return;
	}
	visited[s][bot]=true;
	for (auto x:adj[s]){
			if (bot==0&&x>=r&&!visited[x][bot]){
				dfs(x,bot,l,r,e,changed);
			}
			else if (bot==1&&x<=l&&!visited[x][bot]){
				dfs(x,bot,l,r,e,changed);
			}
			else if (x>l&&x<r){
				if (!changed&&!visited[x][bot^1])
				dfs(x,bot^1,l,r,e,true);
				if (!visited[x][bot])
				dfs(x,bot,l,r,e,changed);
			}
	}
}
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
                                std::vector<int> s, std::vector<int> E,
                                std::vector<int> L, std::vector<int> R) {
  vector<int>A(E.size());
  for (int i  =0;i<N;++i){
  	adj[X[i]].push_back(Y[i]);
  	adj[Y[i]].push_back(X[i]);
  }
  //0 - human
  //1 - wolf
	for (int i  =0;i<E.size();++i){
  	ok=false;
  	for (int i =0;i<10000;++i)visited[i][0]=false,visited[i][1]=false;
  	if (s[i]>=L[i]&&s[i]<E[i]){
  		dfs(s[i],0,L[i]-1,R[i],E[i],false);
  		dfs(s[i],1,L[i]-1,R[i],E[i],true);
  	}
  	else 
  	dfs(s[i],0,L[i]-1,R[i],E[i],false);
  	A[i]|=ok;
	}
  return A;
}

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:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for (int i  =0;i<E.size();++i){
      |                 ~^~~~~~~~~

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