Submission #12699

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
12699	2014-12-31 17:42:33	dohyun0324	Holiday (IOI14_holiday)	C++98	0 / 100	5000 ms	46676 KiB

holiday

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"holiday.h"
#include<string.h>
#include<algorithm>
using namespace std;
int s,t=1,pos[100010],k,e[21],p2[300010];
long long dap,r1[300010],l1[300010],r2[300010],l2[300010],p[300010];
struct data{
    int x,y;
    bool operator<(const data&r)const{
        return x>r.x;
    }
}a[100010];
struct data2{
    int num;
    long long sum;
}tree[20][100000];
void update(int lev,int x){
    int p=x+t-1;
    while(p>0){
        tree[lev][p].num++; tree[lev][p].sum+=a[x].x;
        p/=2;
    }
}
void finding(int lev,int x,int y,int k,int num){
    if(x==y){s=x-1; return;}
    if(num-tree[lev][k*2].num>=0)
    {
        finding(lev,(x+y)/2+1,y,k*2+1,num-tree[lev][k*2].num);
    }
    else finding(lev,x,(x+y)/2,k*2,num);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53