제출 #118278

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
118278	2019-06-18 14:32:19	tmwilliamlin168	무지개나라 (APIO17_rainbow)	C++14	12 / 100	1229 ms	78412 KiB

rainbow

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 "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN=2e5, mxSTS=1e5*19+1;
struct pst {
  vector<int> ta[mxN];
  int rt[mxN+1], sts=1, st[mxSTS], lc[mxSTS], rc[mxSTS];
  void a(array<int, 2> a) {
    ta[a[0]].push_back(a[1]);
  }
  void bld() {
    for(int i=0; i<mxN; ++i) {
      rt[i+1]=rt[i];
      for(int j : ta[i])
        upd(j, rt[i+1]);
    }
  }
  void upd(int l1, int &i, int l2=0, int r2=mxN-1) {
    st[sts]=st[i]+1;
    lc[sts]=lc[i];
    rc[sts]=rc[i];
    i=sts++;
    if(l2==r2)
      return;
    int m2=(l2+r2)/2;
    if(l1<=m2)
      upd(l1, lc[i], l2, m2);
    else
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 11
• Subtask 2: 12 / 12
• Subtask 3: 0 / 24
• Subtask 4: 0 / 27
• Subtask 5: 0 / 26