多校3 1008 Solve this interesting problem

Solve this interesting problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1020    Accepted Submission(s): 279

Problem Description

Have you learned something about segment tree? If not, don’t worry, I will explain it for you.
Segment Tree is a kind of binary tree, it can be defined as this:
- For each node u in Segment Tree, u has two values: Lu and Ru.
- If Lu=Ru, u is a leaf node. 
- If Lu≠Ru, u has two children x and y,with Lx=Lu,Rx=⌊Lu+Ru2⌋,Ly=⌊Lu+Ru2⌋+1,Ry=Ru.
Here is an example of segment tree to do range query of sum.

Given two integers L and R, Your task is to find the minimum non-negative n satisfy that: A Segment Tree with root node‘s value Lroot=0 and Rroot=ncontains a node u with Lu=L and Ru=R.

Input

The input consists of several test cases. 
Each test case contains two integers L and R, as described above.
0≤L≤R≤109
LR−L+1≤2015

Output

For each test, output one line contains one integer. If there is no such n, just output -1.

Sample Input

6 7
10 13
10 11

Sample Output

7
-1
12

Source

2015 Multi-University Training Contest 3

Recommend

wange2014   |   We have carefully selected several similar problems for you:  5325 5324 5323 5322 5321

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <assert.h>
 4 #include <algorithm>
 5 const long long inf=(long long) 1e30;
 6
 7 long long n;
 8
 9 /*int look(int x)
10 {
11     if(x%2==0)
12         return 2;
13     else
14         return 1;
15 }*/
16
17 void dfs(long long l,long long r)
18 {
19     if(l<0 || r>inf)
20         return;
21     if(l==0)
22     {
23         if(r<n)
24             n=r;
25         return ;
26     }
27     if(l<r-l+1)
28         return;
29     if(r-l+1!=1)
30         dfs(l,r+(r-l+1)-1);
31     dfs(l-(r-l+1),r);
32     dfs(l-(r-l+1)-1,r);
33     dfs(l,r+(r-l+1));
34     return;
35 }
36
37 int main()
38 {
39     int L,R;
40     while(scanf("%d %d",&L,&R)!=EOF)
41     {
42         assert(0 <= L && L <= (int)1e9);
43         assert(0 <= R && R <= (int)1e9);
44         assert(L <= R);
45         assert(L / (R - L + 1) <= 2015);
46         n=inf;
47         dfs((long long) L,(long long) R);
48         if(n==inf)
49             printf("-1\n");
50         else
51             printf("%I64d\n",n);
52     }
53     return 0;
54 }

时间: 2024-11-08 21:12:33

多校3 1008 Solve this interesting problem的相关文章

hdu 5323 Solve this interesting problem(dfs)

题目链接:hdu 5323 Solve this interesting problem 逆向思维,每次向左或向右翻倍,知道左端点为0时,即恰好满足的情况,处理处所有情况去取最小值. #include <cstdio> #include <cstring> #include <algorithm> using namespace std; typedef long long ll; const ll inf = 0x3f3f3f3f; ll L, R, N; void

HDOJ 5323 Solve this interesting problem BFS搜索

BFS暴力搜索..... Solve this interesting problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 974    Accepted Submission(s): 263 Problem Description Have you learned something about segment tree?

HDU 5323 Solve this interesting problem

搜索... Solve this interesting problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 422    Accepted Submission(s): 98 Problem Description Have you learned something about segment tree? If not,

HDU 5323 SOLVE THIS INTERESTING PROBLEM 爆搜

链接 Solve this interesting problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 511    Accepted Submission(s): 114 Problem Description Have you learned something about segment tree? If not, d

hdu 5323 Solve this interesting problem dfs 搜索

链接:http://acm.hdu.edu.cn/showproblem.php?pid=5323 Solve this interesting problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1470    Accepted Submission(s): 420 Problem Description Have you

DFS+剪枝 HDOJ 5323 Solve this interesting problem

题目传送门 1 /* 2 题意:告诉一个区间[L,R],问根节点的n是多少 3 DFS+剪枝:父亲节点有四种情况:[l, r + len],[l, r + len - 1],[l - len, r],[l - len -1,r]; 4 */ 5 #include <cstdio> 6 #include <algorithm> 7 #include <cstring> 8 #include <cmath> 9 #include <queue> 10

HDU 5323(2015多校3)-Solve this interesting problem(dfs+剪枝)

题目地址:HDU 5323 题意:给一个l,r,表示区间[l,r],问是否存在区间为[0,n]的线段树的节点区间为[l,r],如果有求最小的n,如果没有输出-1. 思路:因为L/(R-L+1)<=2015,按照线段树的性质每次分区间序号扩大两倍,所以可以得出差不多有22层,所以用爆搜就可以,由上把[l,r]区间不断扩张,直到满足l==0为止.顺便剪剪枝. #include <stdio.h> #include <math.h> #include <string.h>

hdu5323(2015多校3)--Solve this interesting problem(万万没想到,,,)

题目链接:点击打开链接 题目大意:给出一个区间[l,r],问这个区间能不能是一个线段树上的一段,线段树为0到n,求最小的n是多少. 按照题目给出的区间向根部搜,由子区间推到父区间,有四种可能(左右区间和(l+r)的奇偶性): [ l , 2*r-l ] [ l , 2*r+1-l ] [ (l-1)*2-r , r ] [ (l-1)*2+1-r , r ] 按照这四种方式向上搜,加上剪枝就可以AC 原因是l/(r-l+1) <= 2015,那么每向上搜一次,下面的区间和会增加两倍,l/区间和也

【搜索】 HDU 5323 Solve this interesting problem

点击打开链接 用线段树方式建树 [ 0, n] 已知[ l, r] 结点 求n 若 建一个[0, 2*r] 的线段树  这是的总点数的奇的,(左子树!=右子树 [0, r]  在左子树里 则n最大为2*r 若 建一个[0, 2*r+1] 的线段树 (左子树==右子树 [0, r]  在左子树里 这时则 [0, r] 就可以建树 所以搜的时候超出2*r 就直接return #include <cstdio> #include <cstring> #include <cstdli