제출 #245745

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
245745	2020-07-07 10:35:44	mikoarm	자리 배치 (IOI18_seats)	C++14	25 / 100	4081 ms	69940 KiB

seats

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "seats.h"
using namespace std;
struct Tree {
  vector<int> mins, maxs;
  int B;
  Tree(){}
  Tree(vector<int> R) {
    B = 1;
    while (B < (int)R.size()) {
      B *= 2;
    }
    maxs.resize(2*B), mins.resize(2*B);
    for (int i = B; i < B + (int)R.size(); i++) mins[i] = R[i-B], maxs[i] = R[i-B];
    for (int i = B-1; i >= 1; i--) maxs[i] = max(maxs[2*i], maxs[2*i+1]), mins[i] = min(mins[2*i], mins[2*i+1]);
  }
  pair<int,int> query(int a, int b) {
    a += B;
    b += B; 
    pair<int,int> ret = {max(maxs[a], maxs[b]), min(maxs[a], maxs[b])};
    while (a / 2 != b / 2) {
      if (a % 2 == 0) ret.first = max(ret.first, maxs[a+1]), ret.second = min(ret.second, mins[a+1]);
      if (b % 2 == 1) ret.first = max(ret.first, maxs[b-1]), ret.second = min(ret.second, mins[b-1]);
      a /= 2; b /= 2;
    }
    return ret;
  }
  void update(int a) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 20 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30