이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// #pragma GCC optimize("O3","unroll-loops")
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
// #define
// #define int long long
#define all(v) v.begin(), v.end()
#define fi first
#define se second
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
// declare
/*int Query(vector <int> m){
for (int x : m) cout << x << ' ';
cout << "\n";
fflush(stdout);
int ans;
cin >> ans;
return ans;
}
void Answer(vector <int> v){
for (int x : v) cout << x << ' ';
cout << "\n";
fflush(stdout);
}*/
void Solve(int n)
{
if (n <= 2){
vector <int> ans;
for (int i = 1; i <= n; ++i) ans.push_back(i);
Answer(ans);
return;
}
int idx;
vector <int> m(n, 1);
for (int i = 1; i <= n; ++i)
{
m[i - 1] = 0;
int ans = Query(m);
if (ans == 1)
{
idx = i;
break;
}
m[i - 1] = 1;
}
vector <int> ans = {idx};
vector <bool> vs(n, false);
for (int i = 1; i < n; ++i){
vs[idx] = true;
vector <int> now;
for (int j = 1; j <= n; ++j)
if (!vs[j])
now.push_back(j);
int l = 1, r = now.size();
while (l < r){
int md = l + r >> 1;
vector <int> m(n, 0);
for (int i = l; i <= md; ++i)
m[now[i - 1] - 1] = 1;
int c1 = Query(m);
m[idx - 1] = 1;
int c2 = Query(m);
if (c1 == c2) r = md;
else l = md + 1;
}
ans.push_back(now[l - 1]);
idx = now[l - 1];
}
Answer(ans);
}
// 4 2 5 3 1
/*signed main()
{
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int t = 1, n;
// cin >> t;
cin >> n;
while (t--)
Solve(n);
cerr << "\nTIME: " << 1000 * clock() / CLOCKS_PER_SEC << "ms.";
}*/
컴파일 시 표준 에러 (stderr) 메시지
library.cpp: In function 'void Solve(int)':
library.cpp:61:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
61 | int md = l + r >> 1;
| ~~^~~
library.cpp:38:9: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
38 | int idx;
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |