제출 #800209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
800209		erray	팀들 (IOI15_teams)	C++17	0 / 100	792 ms	334448 KiB

teams

#include "teams.h"

#include<bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/ioi/codes/ioi15_d1/debug.h"
#else 
  #define debug(...) void(37)
#endif

template<typename T> 
vector<T> inverse_fuck(T* a, int N) {
  vector<T> res(N);
  for (int i = 0; i < N; ++i) {
    res[i] = a[i];
  }
  return res;
}

namespace PST {
  struct node {
    node* l = NULL;
    node* r = NULL;
    int sum = 0;
  };
  node* modify(node* prev, int l, int r, int p) {
    debug(l, r);
    node* v = new node();
    if (prev != NULL) {
      v->l = prev->l;
      v->r = prev->r;
      v->sum = prev->sum;
    }
    v->sum += 1;
    if (l < r) {
      int mid = (l + r) >> 1;
      if (p <= mid) {
        v->l = modify(v->l, l, mid, p);
      } else {
        v->r = modify(v->r, mid + 1, r, p);
      }
    }
    return v;
  }
  int get(node* v, int l, int r, int ll) {
    if (v == NULL) {
      return 0;
    }
    if (l >= ll) {
      return v->sum;
    }
    int mid = (l + r) >> 1;
    int res = 0;
    if (ll <= mid) {
      res += get(v->l, l, mid, ll);
    } 
    res += get(v->r, mid + 1, r, ll);
    return res;
  }
}

struct SegTree {
  int n;
  vector<PST::node*> roots;
  SegTree(int _n) : n(_n) {
    roots.resize(1);
    roots[0] = new PST::node();
  }
  SegTree() { } 
  PST::node* modify(int x) {
     roots.push_back(PST::modify(roots.back(), 0, n - 1, x));
     return roots.back();
  }
  int get(PST::node* v, int ll) {
    return PST::get(v, 0, n - 1, ll);
  }
};

int N;
vector<array<int, 2>> A;
SegTree st;
vector<PST::node*> vers;
vector<int> pt;
void init(int __N, int __A[], int __B[]) {
  
  N = __N;
  auto L = inverse_fuck(__A, N);
  auto R = inverse_fuck(__B, N);
  debug(N, L, R);
  A.resize(N);
  for (int i = 0; i < N; ++i) {
    A[i] = array<int, 2>{L[i], R[i]};
  }
  sort(A.begin(), A.end());
  debug(A);
  st = SegTree(N + 1);
  for (int i = 0; i < N; ++i) {
    debug(i);
    auto v = st.modify(A[i][1]);
    if (i == N - 1|| A[i + 1][0] != A[i][0]) {
      pt.push_back(A[i][0]);
      vers.push_back(v);
    }
  }
}

int can(int M, int __K[]) {
  auto K = inverse_fuck(__K, M);
  sort(K.begin(), K.end());
  debug(M, K);
  vector<array<int, 2>> comp;
  for (int i = 0; i < M; ++i) {
    if (i == 0 || comp.back()[0] != K[i]) {
      comp.push_back({K[i], 0});
    } 
    comp.back()[1] += K[i];
  }
  auto Contains = [&](int l, int r) {
    int from = int(lower_bound(pt.begin(), pt.end(), l + 1) - pt.begin()) - 1;
    return (from == -1 ? 0 : st.get(vers[from], r));
  };
  
  debug(comp);
  int mn = 0;
  bool bad = false;
  for (int i = 0; i < int(comp.size()); ++i) {
    auto[x, s] = comp[i];
    int me = Contains(x, x) - s;
    bad |= me < 0;
    if (i > 0) {
      int prev = comp[i - 1][0];
      mn = min(me, mn + me - Contains(prev, x));
    }
    bad |= mn < 0;
  }
	return !bad;
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23