Submission #1167487

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
11674872025-03-16 07:42:57PlayVoltzLibrary (JOI18_library)C++20
100 / 100
80 ms488 KiB
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
#define pb push_back
void Solve(int n){
int prev=1;
vector<vector<int> > graph(n+1);
vector<int> vect(1, 1), temp;
for (int i=2; i<=n; ++i){
temp.assign(n, 0);
for (auto a:vect)temp[a-1]=1;
temp[i-1]=1;
int res=Query(temp);
if (res>prev)vect.pb(i);
else if (res==prev){
int low=-1, high=vect.size();
while (low+1<high){
int mid=(low+high)/2, c=1, f;
temp.assign(n, 0);
for (int j=mid; j<high; ++j)temp[vect[j]-1]=1;
temp[i-1]=1;
f=Query(temp);
for (int j=mid; j<high-1; ++j){
bool got=0;
for (auto a:graph[vect[j]])if (a==vect[j+1])got=1;
c+=!got;
}
if (c==f)low=mid;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...