제출 #67890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67890		funcsr	팀들 (IOI15_teams)	C++17	34 / 100	4025 ms	80636 KiB

teams

#include "teams.h"
#include <vector>
#include <cassert>
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y)-x.begin())
#define pb push_back

//#define MAX_N (1<<19)
#define MAX_N (1<<17)
struct Node {
  int val = 0;
  Node *left = NULL, *right = NULL;
};

int query(Node *n, int a, int b, int k=0, int l=0, int r=MAX_N) {
  if (b <= l || r <= a) return 0;
  if (a <= l && r <= b) return n->val;
  int ret = 0;
  if (n->left)  ret += query(n->left, a, b, k*2+1, l, (l+r)/2);
  if (n->right) ret += query(n->right, a, b, k*2+2, (l+r)/2, r);
  return ret;
}
Node *add(Node *n, int x, int v, int k=0, int l=0, int r=MAX_N) {
  if (r-l == 1) {
    Node *ret = new Node();
    ret->val = n->val+v;
    return ret;
  }
  if (n->left == NULL) n->left = new Node();
  if (n->right == NULL) n->right = new Node();
  Node *ret = new Node();
  if (x < (l+r)/2) {
    ret->left = add(n->left, x, v, k*2+1, l, (l+r)/2);
    ret->right = n->right;
  }
  else {
    ret->left = n->left;
    ret->right = add(n->right, x, v, k*2+2, (l+r)/2, r);
  }
  ret->val = n->val+v;
  return ret;
}

int N;
vector<int> G[500010];
Node *seg[500010];

inline int count(int l, int a, int b) { return query(seg[l], a, b+1); }

void init(int NN, int A[], int B[]) {
  N = NN;
  assert(N<=1e5);
  rep(i, N) G[A[i]].pb(B[i]);
  seg[0] = new Node();
  rep(i, N+1) {
    for (int r : G[i]) seg[i] = add(seg[i], r, +1);
    if (i+1 <= N) seg[i+1] = seg[i];
  }
}

int C[500010];
int demand[500010];
int can(int M, int K[]) {
  long long sum = 0;
  rep(i, M) sum += K[i];
  if (sum > N) return 0;
  sort(K, K+M);
  vector<int> xs(K, K+M); sort(all(xs)); uniq(xs);
  //cout<<"xs={";for(int x :xs)cout<<x<<",";cout<<"}\n";
  rep(i, xs.size()) C[i] = demand[i] = 0;
  rep(i, M) demand[index(xs, K[i])]+=K[i];

  //assert(xs.size() < 1000);
  assert(xs.size() < 450);
  rep(k, xs.size()) {
    for (int r=k; r<xs.size(); r++) {
      int rpos = r+1==xs.size()?N:(xs[r+1]-1);
      C[r] += count(xs[k], xs[r], rpos) - (k>=1?count(xs[k-1], xs[r], rpos):0);
    }
    //cout<<"C=";rep(i,xs.size())cout<<C[i]<<",";cout<<": demand="<<demand[k]<<"\n";
    for (int r=k; r<xs.size(); r++) {
      int e = min(demand[k], C[r]);
      demand[k] -= e;
      C[r] -= e;
    }
    if (demand[k] > 0) return 0;
  }
  return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

teams.cpp: In function 'int can(int, int*)':
teams.cpp:7:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
teams.cpp:75:3: note: in expansion of macro 'rep'
   rep(i, xs.size()) C[i] = demand[i] = 0;
   ^~~
teams.cpp:7:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
teams.cpp:80:3: note: in expansion of macro 'rep'
   rep(k, xs.size()) {
   ^~~
teams.cpp:81:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int r=k; r<xs.size(); r++) {
                   ~^~~~~~~~~~
teams.cpp:82:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       int rpos = r+1==xs.size()?N:(xs[r+1]-1);
                  ~~~^~~~~~~~~~~
teams.cpp:86:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int r=k; r<xs.size(); r++) {
                   ~^~~~~~~~~~

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