제출 #290327

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290327		DanerZein	Werewolf (IOI18_werewolf)	C++14	0 / 100	4061 ms	46976 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
int l,r;
bitset<200010> vh,vw;
vector<vi> G;
void dfs_human(int u){
  if(u<l) return;
  vh[u]=1;
  for(auto &v:G[u]){
    if(!vh[v]){
      dfs_human(v);
    }
  }
}
void dfs_wolf(int u){
  if(u>r) return;
  vw[u]=1;
  for(auto &v:G[u]){
    if(!vw[v]){
      dfs_wolf(v);
    }
  }
}
map<int,int> m;
vector<int> path;
int vis[200010];
ii tree[800010],trmi;
void dfs(int u){
  path.push_back(u);
  vis[u]=1;
  for(auto &v: G[u]){
    if(!vis[v]){
      dfs(v);
    }
  }
}
void init(int node,int a,int b){
  if(a>b) return;
  if(a==b){
    tree[node]=ii(path[a],path[a]);
    return;
  }
  int mid=(a+b)/2;
  init(2*node+1,a,mid);
  init(2*node+2,mid+1,b);
  tree[node].first=min(tree[2*node+1].first,tree[2*node+2].first);
  tree[node].second=max(tree[2*node+1].second,tree[2*node+2].second);
}
int query_min(int node,int a,int b,int l,int r){
  if(a>r or l>b) return MAX;
  if(l<=a and r>=b) return tree[node].first;
  int mid=(a+b)/2;
  return min(query_min(2*node+1,a,mid,l,r),query_min(2*node+2,mid+1,b,l,r));
}
int query_max(int node,int a,int b,int l,int r){
  if(a>r or l>b) return -MAX;
  if(l<=a and r>=b) return tree[node].second;
  int mid=(a+b)/2;
  return max(query_max(2*node+1,a,mid,l,r),query_max(2*node+2,mid+1,b,l,r));
}
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) {
  G.resize(N+1);
  for(int i=0;i<X.size();i++){
    int u=X[i],v=Y[i];
    G[u].push_back(v);
    G[v].push_back(u);
  }
  bool sw=0;
  int id;
  for(int i=0;i<N;i++){
    if(G[i].size()>2){
      sw=1;
    }
    if(G[i].size()==1) id=i;
  }
  vector<int> res;
  /* if(sw==1){
    for(int i=0;i<S.size();i++){
      l=L[i];
      r=R[i];
      vh.reset();
      vw.reset();
      dfs_human(S[i]);
      dfs_wolf(E[i]);
      bool sw=0;
      for(int i=0;i<N;i++){
	if(vh[i]==1 and vw[i]==1){
	  sw=1;
	  break;
	}
      }
      res.push_back(sw);
    }
    }*/
  // else{
    dfs(id);
    for(int i=0;i<path.size();i++){
      m[path[i]]=i;
    }
    init(0,0,N-1);
    int q=S.size();
    for(int i=0;i<q;i++){
      int la,ra,lb,rb;
      la=ra=m[S[i]];
      lb=rb=m[E[i]];
      int l=0,r=la;
      while(r-l>1){
	int mid=(l+r)/2;
	int mi=query_min(0,0,N-1,mid,la);
	if(mi>=L[i]){
	  r=mid;
	}
	else l=mid;
      }
      la=r;
      l=ra; r=N-1;
      while(r-l>1){
	int mid=(l+r)/2;
	int mi=query_min(0,0,N-1,ra,mid);
	if(mi>=L[i]){
	  l=mid;
	}
	else r=mid;
      }
      ra=l;
      l=0; r=lb;
      while(r-l>1){
	int mid=(l+r)/2;
	int ma=query_max(0,0,N-1,mid,lb);
	if(ma<=R[i]){
	  r=mid;
	}
	else{
	  l=mid;
	}
      }
      lb=r;
      l=rb; r=N-1;
      while(r-l>1){
	int mid=(l+r)/2;
	int ma=query_max(0,0,N-1,rb,mid);
	if(ma<=R[i]){
	  l=mid;
	}
	else r=mid;
      }
      rb=l;
      if((la<=lb and ra>=lb) or (la<=rb and ra>=rb)) res.push_back(1);
    else res.push_back(0);
    }
    // }
  return res;
}

컴파일 시 표준 에러 (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:69:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for(int i=0;i<X.size();i++){
      |               ~^~~~~~~~~
werewolf.cpp:103:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for(int i=0;i<path.size();i++){
      |                 ~^~~~~~~~~~~~
werewolf.cpp:74:8: warning: variable 'sw' set but not used [-Wunused-but-set-variable]
   74 |   bool sw=0;
      |        ^~
werewolf.cpp:102:8: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
  102 |     dfs(id);
      |     ~~~^~~~

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