// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
#include "chameleon.h"
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1005;
namespace {
int n;
int occ[MAXN][MAXN];
}
void Solve(int N) {
n = N;
//vi lid(n), rid(n);
//iota(ALL(lid), 1);
//iota(ALL(rid), n + 1);
vi lid, rid;
REP (i, 1, 2 * n + 1) {
lid.pb(i);
if (Query(lid) != SZ(lid)) {
lid.pop_back();
rid.pb(i);
}
}
REP (z, 0, 2) {
for (int i : rid) {
vi p(ALL(lid));
p.pb(i);
int s = Query(p) - SZ(p);
if (s == -1) {
int lo = 0, hi = n - 1;
while (lo < hi) {
int mid = lo + hi >> 1;
vi p(lid.begin(), lid.begin() + mid + 1);
p.pb(i);
int x = Query(p) - SZ(p);
if (x <= s) {
hi = mid;
} else {
lo = mid + 1;
}
}
cerr << "ANSWER: " << i << ' ' << lid[hi] << '\n';
Answer(i, lid[hi]);
continue;
}
vii tmp;
REP (c, s, -1) {
int lo = 0, hi = n - 1;
while (lo < hi) {
int mid = lo + hi >> 1;
vi p(lid.begin(), lid.begin() + mid + 1);
p.pb(i);
int x = Query(p) - SZ(p);
if (x <= c) {
hi = mid;
} else {
lo = mid + 1;
}
}
cerr << i << ' ' << lid[hi] << '\n';
tmp.pb({min(i, lid[hi]), max(i, lid[hi])});
//tmp.pb({i, lid[hi]});
lo = 0, hi = n - 1;
while (lo < hi) {
int mid = lo + hi + 1 >> 1;
vi p(lid.begin() + mid, lid.end());
p.pb(i);
int x = Query(p) - SZ(p);
if (x <= c) {
lo = mid;
} else {
hi = mid - 1;
}
}
cerr << i << ' ' << lid[lo] << '\n';
tmp.pb({min(i, lid[lo]), max(i, lid[lo])});
//tmp.pb({i, lid[lo]});
}
sort(ALL(tmp));
REP (i, 0, SZ(tmp)) {
if ((i != 0 && tmp[i - 1] == tmp[i]) || (i != SZ(tmp) - 1 && tmp[i + 1] == tmp[i])) {
continue;
}
occ[tmp[i].FI][tmp[i].SE]++;
}
}
swap(lid, rid);
}
REP (i, 1, 2 * n + 1) {
REP (j, i + 1, 2 * n + 1) {
if (occ[i][j] == 2) {
cerr << "ANSWER: " << i << ' ' << j << '\n';
Answer(i, j);
}
}
}
}
Compilation message
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:67:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
67 | int mid = lo + hi >> 1;
| ~~~^~~~
chameleon.cpp:85:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
85 | int mid = lo + hi >> 1;
| ~~~^~~~
chameleon.cpp:100:39: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
100 | int mid = lo + hi + 1 >> 1;
| ~~~~~~~~^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
