Submission #1145361

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
11453612025-02-04 15:07:49lightentheshadowLibrary (JOI18_library)C++20
0 / 100
15 ms416 KiB
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
bool found[1005];
void Solve(int n) {
vector<int> ans; ans.clear();
vector<int> ask;
for (int i = 1; i <= n; i++)
ask.push_back(0);
/// Find one of the sides
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
if (j == i) ask[j - 1] = 0;
else ask[j - 1] = 1;
int res = Query(ask);
if (res == 1) {
ans.push_back(i);
found[i] = 1;
break;
}
}
/// Find other ones
vector<int> contender, A, B;
for (int turn = 2; turn <= n; turn++) {
contender.clear();
for (int i = 1; i <= n; i++)
if (!found[i]) contender.push_back(i);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...