codeforces 1114E Codeforces Round #538 (Div. 2) E

题目连接：https://codeforces.com/contest/1114/problem/E

E Arithmetic Progression 

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

This is an interactive problem!

An arithmetic progression or arithmetic sequence is a sequence of integers such that the subtraction of element with its previous element (xi−xi−1xi−xi−1, where i≥2i≥2) is constant — such difference is called a common difference of the sequence.

That is, an arithmetic progression is a sequence of form xi=x1+(i−1)dxi=x1+(i−1)d, where dd is a common difference of the sequence.

There is a secret list of nn integers a1,a2,…,ana1,a2,…,an.

It is guaranteed that all elements a1,a2,…,ana1,a2,…,an are between 00 and 109109, inclusive.

This list is special: if sorted in increasing order, it will form an arithmetic progression with positive common difference (d>0d>0). For example, the list [14,24,9,19][14,24,9,19] satisfies this requirement, after sorting it makes a list [9,14,19,24][9,14,19,24], which can be produced as xn=9+5⋅(n−1)xn=9+5⋅(n−1).

Also you are also given a device, which has a quite discharged battery, thus you can only use it to perform at most 6060 queries of following two types:

• Given a value ii (1≤i≤n1≤i≤n), the device will show the value of the aiai.
• Given a value xx (0≤x≤1090≤x≤109), the device will return 11 if an element with a value strictly greater than xx exists, and it will return 00otherwise.

Your can use this special device for at most 6060 queries. Could you please find out the smallest element and the common difference of the sequence? That is, values x1x1 and dd in the definition of the arithmetic progression. Note that the array aa is not sorted.

Interaction

The interaction starts with a single integer nn (2≤n≤1062≤n≤106), the size of the list of integers.

Then you can make queries of two types:

• "? i" (1≤i≤n1≤i≤n) — to get the value of aiai.
• "> x" (0≤x≤1090≤x≤109) — to check whether there exists an element greater than xx

After the query read its result rr as an integer.

• For the first query type, the rr satisfies 0≤r≤1090≤r≤109.
• For the second query type, the rr is either 00 or 11.
• In case you make more than 6060 queries or violated the number range in the queries, you will get a r=−1r=−1.
• If you terminate after receiving the -1, you will get the "Wrong answer" verdict. Otherwise you can get an arbitrary verdict because your solution will continue to read from a closed stream.

When you find out what the smallest element x1x1 and common difference dd, print

• "! x1x1 dd"

And quit after that. This query is not counted towards the 6060 queries limit.

After printing any query do not forget to output end of line and flush the output. Otherwise you will get Idleness limit exceeded. To do this, use:

• fflush(stdout) or cout.flush() in C++;
• System.out.flush() in Java;
• flush(output) in Pascal;
• stdout.flush() in Python;
• see documentation for other languages.

Hacks

For hack, use the following format:

The first line should contain an integer nn (2≤n≤1062≤n≤106) — the list's size.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤1090≤ai≤109) — the elements of the list.

Also, after the sorting the list must form an arithmetic progression with positive common difference.

Example

input

Copy

4

0

1

14

24

9

19

output

Copy

> 25

> 15

? 1

? 2

? 3

? 4

! 9 5

Note

Note that the example interaction contains extra empty lines so that it's easier to read. The real interaction doesn't contain any empty lines and you shouldn't print any extra empty lines as well.

The list in the example test is [14,24,9,19][14,24,9,19].

交互题：有一个等差数列，要求你找到首项和公差d

你可以有60次操作

q1 : 查询等差数列中第i项的值

q2：查询等差数列中是否存在比x更大的值

交互题一般不是二分就是构造（个人感觉），再不行就是二分加个构造

所以你可以先二分出这个等差数列的上界是多大，因为范围在1e9之间，所以基本上30次就可以二分出边界最大值，

接着去用剩下的次数去查询第i项的值，用最大值gcd = __gcd(Max - a[i],gcd) 变可以得到公差，i可以自己写个随机

函数随机一下，而首项的值就等于Max - (n - 1) * d

代码如下：

#include <bits/stdc++.h>
#include <time.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll>  P;
vector<vector<ll> >v;
const int maxn = 2e6 + 5000;
ll  n,m,ks;
ll a[maxn];
bool vis[maxn];
string str[maxn];
int xx[4] = {1,-1,1,-1};
int yy[4] = {-1,1,1,-1};
int cnt = 60;
int query1(int x){
    int val;
    cnt--;
    cout << "> "  << x << endl;
    cin >> val;
    return val;
}
int query2(int x){
    int val;
    cout << "? " << x << endl;
    cin >> val;
    return val;
}
int erfen(int l,int r){
    int x ;
    while(l <= r){
        int mid = (l + r) / 2;
        if(query1(mid)){
            l = mid + 1;
        }else{
            r = mid - 1,x = mid;
        }
    }
    return x;
}
long long  Rand(double s,double t) {
    return s + 1.0*rand()/RAND_MAX*(t-s);
}
int main() {
    cin >> n;
    srand((unsigned)time(NULL));
    int Max = erfen(1,1e9);
    int d = 0;
    for(int i = 1;i <= cnt;i++){
        int num = Rand(1,n + 1);
        int dd = query2(num);
        d = __gcd(d,Max - dd);
    }
    cout << "! "<< Max - (n - 1) * d << " " << d << endl;
    return 0;
}