제출 #4851

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
4851	2014-01-05 08:39:58	cki86201	원숭이와 사과 나무 (IZhO12_apple)	C++98	100 / 100	60 ms	1208 KiB

apple

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<stdio.h>
#include<algorithm>
struct segment{
  int x;
  segment *link[2];
  void update(int s,int d,int l,int r)
  {
    if(x == d-s+1)return;
    if(l<=s && d<=r){
      x = d-s+1;
      return;
    }
    int m = (s+d)>>1;
    if(l<=m){
      if(!link[0])link[0] = new segment();
      link[0]->update(s,m,l,r);
    }
    if(r>m){
      if(!link[1])link[1] = new segment();
      link[1]->update(m+1,d,l,r);
    }
    x = (link[0]?link[0]->x:0) + (link[1]?link[1]->x:0);
  }
  int read(int s,int d,int l,int r)
  {
    if(l<=s && d<=r)return x;
    if(x == d-s+1)return std::min(d,r) - std::max(s,l) + 1;
    int m = (s+d)>>1, ret = 0;
    if(l<=m)ret += link[0]?link[0]->read(s,m,l,r):0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100