# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
244077 |
2020-07-02T14:46:06 Z |
minhcool |
Secret (JOI14_secret) |
C++17 |
|
0 ms |
0 KB |
#include<bits/stdc++.h>
//#include "secret.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define er erase
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
//const int oo = 1e18 + 7, mod = 1e9 + 7;
int n, x, y, a[1005], ans[1005][1005], answer, c[1005];
int Secret(int x, int y){
cout << x << " " << y << "\n";
int tmp;
cin >> tmp;
return tmp;
}
void build(int l, int r){
if(r <= (l + 1)) return;
int mid = (l + r) >> 1;
for(int i = mid - 1; i >= l; i--) ans[i][mid] = Secret(ans[i + 1][mid], a[i]);
for(int i = mid + 2; i <= r; i++) ans[mid + 1][i] = Secret(ans[mid + 1][i - 1], a[i]);
build(l, mid);
build(mid + 1, r);
}
void search(int l, int r){
int mid = (l + r) >> 1;
if(x < mid || y > mid) return;
if(x <= mid && y > mid){
answer = Secret(ans[x][mid], ans[mid + 1][y]);
return;
}
search(l, mid);
search(mid + 1, r);
}
void Init(int N, int A[]){
n = N;
for(int i = 0; i < n; i++) a[i + 1] = A[i];
build(1, n);
}
int Query(int X, int Y){
x = X;
y = Y;
if(x == y) return a[x];
else if(x == (y - 1)) return Secret(a[x], a[x + 1]);
answer = 0;
search(1, n);
return answer;
}
signed main(){
ios_base::sync_with_stdio(0);
int num;
cin >> num;
for(int i = 0; i < n; i++) cin >> c[i];
Init(num, c);
for(int i = 1; i <= 5; i++){
int l, r;
cin >> l >> r;
cout << Query(l, r) << "\n";
}
}
/*
TEST HERE
INPUT #1
OUTPUT #1
INPUT #2
OUTPUT #2
INPUT #3
OUTPUT #3
*/
Compilation message
/tmp/ccK0J98d.o: In function `Secret(int, int)':
secret.cpp:(.text+0x0): multiple definition of `Secret(int, int)'
/tmp/ccvrt6DQ.o:grader-full.cpp:(.text+0x2c0): first defined here
/tmp/ccK0J98d.o: In function `main':
secret.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccvrt6DQ.o:grader-full.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status