oj.uz

답안 #76473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
76473 2018-09-13T15:01:02 Z born2rule 늑대인간 (IOI18_werewolf) C++14
49 / 100
 2004 ms 175696 KB 
#include <bits/stdc++.h>
#include "werewolf.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define db long double
#define ii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i,n) for (int i = 1;i <= (int)(n); ++i)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repv(i,a,b) for(int i=b-1;i>=a;i--)
#define SET(A, val) memset(A, val, sizeof(A))
typedef tree<int ,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set ;
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif

const int N=200005;
vi v[N];
bool vis[N];
void dfs(int u,int l,int r,vi &tmp,int type=0)
{
  if(type==0 && u<l) return;
  if(type==1 && u>r) return;
  vis[u]=true;
  tmp.pb(u);
  for(int v1:v[u])
    {
      if(vis[v1]) continue;
      dfs(v1,l,r,tmp,type);
    }
}
vi subtask12(int n,vi S,vi E,vi L,vi R)
{
  int q=sz(S);
  vi ans(q,0);
  rep(i,0,q)
    {
      int x=S[i],y=E[i],l=L[i],r=R[i]; x++,y++,l++,r++;
      if(x<l || y>r)
	continue;
      vi tmp1,tmp2;
      rep(j,1,n+1) vis[j]=false;
      dfs(x,l,r,tmp1);
      rep(j,1,n+1) vis[j]=false;
      dfs(y,l,r,tmp2,1);
      sort(all(tmp1)); sort(all(tmp2));
      bool ok=false;
      for(int x:tmp1)
	{
	  int ind=lower_bound(all(tmp2),x)-tmp2.begin();
	  if(ind!=sz(tmp2) && tmp2[ind]==x) ok=true;
	}
      if(ok) ans[i]=1;
    }
  return ans;
}
vector<ii> seg[4*N];
vi pre[2][4*N];
int pos[N],a[N];
#define lc (pos)+(pos)
#define rc (lc)|1
void build(int low,int high,int pos)
{
  if(low==high)
    {
      seg[pos].pb(mp(a[low],low));
      rep(i,0,2)
	pre[i][pos].pb(low);
      return;
    }
  int mid=(low+high)>>1;
  build(low,mid,lc); build(mid+1,high,rc);
  seg[pos]=seg[lc];
  for(auto x:seg[rc]) seg[pos].pb(x);
  sort(all(seg[pos]));
  rep(i,0,2)
    pre[i][pos].pb(seg[pos][0].se);
  rep(i,1,sz(seg[pos]))
    {
      pre[0][pos].pb(min(pre[0][pos].back(),seg[pos][i].se));
      pre[1][pos].pb(max(pre[1][pos].back(),seg[pos][i].se));
    }
}
int query(int low,int high,int pos,int l,int r,int k,int type=0)
{
  if(low>r || high<l) return ((type==0)?N:-1);
  if(low>=l && high<=r)
    {
      int ind=upper_bound(all(seg[pos]),mp(k,N))-seg[pos].begin()-1;
      if(ind<0 || seg[pos][ind].fi>k) return ((type==0)?N:-1);
      return pre[type][pos][ind];
    }
  int mid=(low+high)>>1;
  if(!type)
    return min(query(low,mid,lc,l,r,k,type),query(mid+1,high,rc,l,r,k,type));
  return max(query(low,mid,lc,l,r,k,type),query(mid+1,high,rc,l,r,k,type));
}
int query2(int low,int high,int pos,int l,int r)
{
  if(low>r || high<l) return -1;
  if(low>=l && high<=r)
    return seg[pos].back().fi;
  int mid=(low+high)>>1;
  return max(query2(low,mid,lc,l,r),query2(mid+1,high,rc,l,r));
}
vi subtask3(int n,vi S,vi E,vi L,vi R)
{
  int q=sz(S);
  vi ans(q,0);
  int ind=-1;
  rep(i,1,n+1) if(sz(v[i])==1) ind=i;
  if(ind==-1) return ans;
  a[1]=ind; pos[ind]=1;
  rep(i,2,n+1)
    {
      int tmp=-1;
      for(int v1:v[ind])
	{
	  if(v1==a[i-2]) continue;
	  tmp=v1; break;
	}
      ind=tmp;
      a[i]=ind;
      pos[ind]=i;
    }
  build(1,n,1);
  rep(i,0,q)
    {
      int x=S[i],y=E[i],l=L[i],r=R[i]; x++,y++,l++,r++;
      if(x<l || y>r)
	continue;
      int nx=pos[x],ny=pos[y];
      if(nx<ny)
	{
	  //find 1st element smaller than l in nx,ny
	  ind=query(1,n,1,nx,ny,l-1);
	  if(ind!=N)
	    {
	      if(a[ind-1]>=l && a[ind-1]<=r)
		{
		  //check if max element in ind,ny is <=r
		  int mx=query2(1,n,1,ind,ny);
		  if(mx<=r) ans[i]=1;
		}
	    }
	  else if(y>=l && y<=r) ans[i]=1;
	}
      else
	{
	  //find last element smaller than l in nx,ny
	  ind=query(1,n,1,ny,nx,l-1,1);
	  if(ind!=-1)
	    {
	      if(a[ind+1]>=l && a[ind+1]<=r)
		{
		  //check if max element in ny,ind is <=r
		  int mx=query2(1,n,1,ny,ind);
		  if(mx<=r) ans[i]=1;
		}
	    }
	  else if(y>=l && y<=r) ans[i]=1;
	}
    }
  return ans;
}
vi check_validity(int n,vi X,vi Y,vi S,vi E,vi L,vi R)
{
  int q=sz(S);
  rep(i,0,sz(X))
    {
      X[i]++; Y[i]++;
      v[X[i]].pb(Y[i]);
      v[Y[i]].pb(X[i]);
    }
  if(n<=3000 && q<=3000)
    return subtask12(n,S,E,L,R);
  if(sz(X)==n-1)
    return subtask3(n,S,E,L,R);
  return S;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 61404 KB Output is correct
2 Correct 57 ms 61404 KB Output is correct
3 Correct 66 ms 61512 KB Output is correct
4 Correct 56 ms 61512 KB Output is correct
5 Correct 57 ms 61512 KB Output is correct
6 Correct 60 ms 61596 KB Output is correct
7 Correct 57 ms 61596 KB Output is correct
8 Correct 64 ms 61600 KB Output is correct
9 Correct 74 ms 61600 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 61404 KB Output is correct
2 Correct 57 ms 61404 KB Output is correct
3 Correct 66 ms 61512 KB Output is correct
4 Correct 56 ms 61512 KB Output is correct
5 Correct 57 ms 61512 KB Output is correct
6 Correct 60 ms 61596 KB Output is correct
7 Correct 57 ms 61596 KB Output is correct
8 Correct 64 ms 61600 KB Output is correct
9 Correct 74 ms 61600 KB Output is correct
10 Correct 1084 ms 62000 KB Output is correct
11 Correct 697 ms 62000 KB Output is correct
12 Correct 102 ms 62272 KB Output is correct
13 Correct 1084 ms 62272 KB Output is correct
14 Correct 749 ms 62272 KB Output is correct
15 Correct 839 ms 62384 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1970 ms 175608 KB Output is correct
2 Correct 1335 ms 175676 KB Output is correct
3 Correct 1412 ms 175676 KB Output is correct
4 Correct 1612 ms 175676 KB Output is correct
5 Correct 1592 ms 175676 KB Output is correct
6 Correct 2004 ms 175676 KB Output is correct
7 Correct 1661 ms 175676 KB Output is correct
8 Correct 1155 ms 175676 KB Output is correct
9 Correct 971 ms 175676 KB Output is correct
10 Correct 1061 ms 175696 KB Output is correct
11 Correct 1122 ms 175696 KB Output is correct
12 Correct 1240 ms 175696 KB Output is correct
13 Correct 1609 ms 175696 KB Output is correct
14 Correct 1561 ms 175696 KB Output is correct
15 Correct 1581 ms 175696 KB Output is correct
16 Correct 1551 ms 175696 KB Output is correct
17 Correct 1649 ms 175696 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 61404 KB Output is correct
2 Correct 57 ms 61404 KB Output is correct
3 Correct 66 ms 61512 KB Output is correct
4 Correct 56 ms 61512 KB Output is correct
5 Correct 57 ms 61512 KB Output is correct
6 Correct 60 ms 61596 KB Output is correct
7 Correct 57 ms 61596 KB Output is correct
8 Correct 64 ms 61600 KB Output is correct
9 Correct 74 ms 61600 KB Output is correct
10 Correct 1084 ms 62000 KB Output is correct
11 Correct 697 ms 62000 KB Output is correct
12 Correct 102 ms 62272 KB Output is correct
13 Correct 1084 ms 62272 KB Output is correct
14 Correct 749 ms 62272 KB Output is correct
15 Correct 839 ms 62384 KB Output is correct
16 Correct 1970 ms 175608 KB Output is correct
17 Correct 1335 ms 175676 KB Output is correct
18 Correct 1412 ms 175676 KB Output is correct
19 Correct 1612 ms 175676 KB Output is correct
20 Correct 1592 ms 175676 KB Output is correct
21 Correct 2004 ms 175676 KB Output is correct
22 Correct 1661 ms 175676 KB Output is correct
23 Correct 1155 ms 175676 KB Output is correct
24 Correct 971 ms 175676 KB Output is correct
25 Correct 1061 ms 175696 KB Output is correct
26 Correct 1122 ms 175696 KB Output is correct
27 Correct 1240 ms 175696 KB Output is correct
28 Correct 1609 ms 175696 KB Output is correct
29 Correct 1561 ms 175696 KB Output is correct
30 Correct 1581 ms 175696 KB Output is correct
31 Correct 1551 ms 175696 KB Output is correct
32 Correct 1649 ms 175696 KB Output is correct
33 Incorrect 901 ms 175696 KB Output isn't correct
34 Halted 0 ms 0 KB -