oj.uz

답안 #435105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435105 2021-06-23T02:57:08 Z Apiram 늑대인간 (IOI18_werewolf) C++14
0 / 100
 4000 ms 524292 KB 
#include<bits/stdc++.h>
#include "werewolf.h"
using namespace std;
vector<vector<int>>adj(2e5 + 2);
bool ok;
void dfs (int s,int par,int bot,int l,int r,int e){
	if (ok)return;
	if (s==e){
		ok=true;
		return;
	}
	for (auto x:adj[s]){
		if (x!=par){
			if (bot==0&&x>=r){
				dfs(x,s,bot,l,r,e);
			}
			else if (bot==1&&x<=l){
				dfs(x,s,bot,l,r,e);
			}
			else if (x>l&&x<r){
				dfs(x,s,bot^1,l,r,e);
				dfs(x,s,bot,l,r,e);
			}
		}
	}
}
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;
  	int counts = N - (R[i]-L[i]);
  	int bot = 0;
  	if (s[i]<L[i]){
  		bot = 1;
  	}
  	else if (s[i]>=L[i]&&s[i]<R[i]){
  		bot = 2;
  	}
  	if (bot == 1||bot==0){
  		dfs(s[i],-1,bot,L[i]-1,R[i],E[i]);
  	}
  	else {
  		dfs(s[i],-1,0,L[i]-1,R[i],E[i]);
  		dfs(s[i],-1,1,L[i]-1,R[i],E[i]);
  	}
  	A[i]|=ok;
	}
  return A;
}

Compilation message

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

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 468 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 468 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4074 ms 21516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 468 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -