/*
PROG: source
LANG: C++11
_____
.' '.
/ 0 0 \
| ^ |
| \ / |
\ '---' /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include "library.h"
using namespace std;
using namespace __gnu_pbds;
struct chash
{
int operator()(int x) const
{
x ^= (x >> 20) ^ (x >> 12);
return x ^ (x >> 7) ^ (x >> 4);
}
int operator()(long long x) const
{
return x ^ (x >> 32);
}
};
template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;
template<class T>
void readi(T &x)
{
T input = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
input = input * 10 + (c - '0');
c = getchar();
}
if (negative)
{
input = -input;
}
x = input;
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int aout[20];
int ilen = 0;
while(output)
{
aout[ilen] = ((output % 10));
output /= 10;
ilen++;
}
for (int i = ilen - 1; i >= 0; i--)
{
putchar(aout[i] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
return ((1ll << 15) * rand() + rand()) % mod;
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 1013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
int N;
vi quer;
vi vals;
vi ans;
int conv(vector<int> v)
{
for (int i = 0; i < N; i++)
{
quer[i] = 0;
}
for (int x : v)
{
quer[x] = 1;
}
return Query(quer);
}
bool check_edge(int x)
{
for (int i = 0; i < N; i++)
{
quer[i] = 1;
}
quer[x] = 0;
return (Query(quer) == 1);
}
int go(int u, vector<int> cand)
{
// cerr << "go " << u << " :";
// for (int x : cand)
// {
// cerr << ' ' << x;
// }
// cerr << endl;
if (cand.size() == 1)
{
return cand[0];
}
vector<int> lt, rt;
for (int i = 0; i < cand.size() / 2; i++)
{
lt.PB(cand[i]);
}
for (int i = cand.size() / 2; i < cand.size(); i++)
{
rt.PB(cand[i]);
}
int ledge = (lt.size() - conv(lt));
lt.PB(u);
ledge += (lt.size() - conv(lt));
lt.pop_back();
if (ledge)
{
return go(u, lt);
}
else
{
return go(u, rt);
}
}
void Solve(int n)
{
N = n;
quer.resize(N);
//find any guy on the edge:
for (int i = 0; i < N; i++)
{
vals.PB(i);
}
for (int i = 0; i < N; i++)
{
if (check_edge(i))
{
ans.PB(i);
vals.erase(find(vals.begin(), vals.end(), i));
break;
}
}
// for (int x : vals)
// {
// cerr << "vals has " << x << endl;
// }
for (int i = 0; i < N - 1; i++)
{
ans.PB(go(ans[i], vals));
vals.erase(find(vals.begin(), vals.end(), ans[i + 1]));
}
for (int i = 0; i < N; i++)
{
ans[i]++;
}
Answer(ans);
}
Compilation message
library.cpp: In function 'int go(int, std::vector<int>)':
library.cpp:184:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < cand.size() / 2; i++)
~~^~~~~~~~~~~~~~~~~
library.cpp:188:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = cand.size() / 2; i < cand.size(); i++)
~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
47 ms |
248 KB |
Wrong Answer [8] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
47 ms |
248 KB |
Wrong Answer [8] |
| 2 |
Halted |
0 ms |
0 KB |
- |
