제출 #40052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
40052		funcsr	비밀 (JOI14_secret)	C++14	0 / 100	616 ms	6288 KiB

secret

#include "secret.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
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 NIL 1145141919
#define MAX_N (1<<10)
typedef pair<int, int> P;
int seg[MAX_N*2-1];
map<P, int> mp;
int ask(int x, int y) {
  if (mp.find(P(x, y)) != mp.end()) return mp[P(x, y)];
  return mp[P(x, y)] = Secret(x, y);
}
int op(int x, int y) {
  if (x == NIL) return y;
  if (y == NIL) return x;
  return ask(x, y);
}
int query(int a, int b, int k=0, int l=0, int r=MAX_N) {
  if (b <= l || r <= a) return NIL;
  if (a <= l && r <= b) return seg[k];
  return op(query(a, b, k*2+1, l, (l+r)/2), query(a, b, k*2+2, (l+r)/2, r));
}

int N;
void Init(int NN, int A[]) {
  N = NN;
  fill(seg, seg+MAX_N*2-1, NIL);
  rep(i, N) seg[i+MAX_N-1] = A[i];
  for (int i=MAX_N-2; i>=0; i--) {
    seg[i] = op(seg[i*2+1], seg[i*2+2]);
  }
  rep(i, N) {
    rep(j, 20) {
      int p = (1<<j)-1;
      if (p >= N) break;
      if (p >= i) query(i, p);
    }
  }
}

int Query(int L, int R) {
  int b = L;
  rep(j, 20) {
    int p = (1<<j)-1;
    if (p >= N) break;
    if (p >= L) b = p;
  }
  return op(query(L, b), query(b+1, R));
}

• Subtask 1: 0 / 100