제출 #341512

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341512		FlashGamezzz	늑대인간 (IOI18_werewolf)	C++11	0 / 100	177 ms	21356 KiB

werewolf

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <unordered_set>
#include <vector>
#include <utility>
#include "werewolf.h"

using namespace std;

//
bool r1[3000], r2[3000];

/*void dfs1(int i, int l, bool r1[]){
	if (i >= l){
		r1[i] = true;
		for (int a : adj[i]){
			if (a >= l && !r1[a]){
				dfs1(a, l);
			}
		}
	}
}

void dfs2(int i, int r, bool r2[]){
	if (i <= r){
		r1[i] = true;
		for (int a : adj[i]){
			if (a <= r && !r2[a]){
				dfs2(a, r);
			}
		}
	}
}*/

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> A(Q);
  for (int i = 0; i < Q; ++i) {
	  A[i] = 0;
  }
  vector<int> adj[3000];
  for (int i = 0; i < X.size(); i++){
	  adj[X[i]].push_back(Y[i]); adj[Y[i]].push_back(X[i]);
  }
  /*for (int i = 0; i < Q; i++) {
	  for (int j = 0; j < N; j++){
		  r1[j] = false; r2[j] = false;
	  }
	  dfs1(S[i], L[i]); dfs2(E[i], R[i]);
	  for (int j = L[i]; j <= R[i]; j++){
		  if (r1[j] && r2[j]){
			  A[i] = 1; break;
		  }
	  }
  }*/
  return A;
}

컴파일 시 표준 에러 (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:44:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for (int i = 0; i < X.size(); i++){
      |                   ~~^~~~~~~~~~

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