제출 #568710

#제출 시각아이디문제언어결과실행 시간메모리
568710jamielimSuper Dango Maker (JOI22_dango3)C++17
0 / 100
6078 ms1048576 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; namespace { int n; set<int> s,t; vector<int> v,q; void solve(){ if((int)v.size()==n){ Answer(v); return; } int dangos=(int)v.size()/n; int d=(dangos+1)/2; s.clear();t.clear(); for(int i:v)s.insert(i); for(auto it=s.begin();it!=s.end();++it){ for(auto it2=s.begin();it2!=s.end();++it){ if(it2==it)continue; q.push_back(*it2); } if(Query(q)>=d){ // sum of SZ(s) over all calls to solve -> (sum of dangos)*n? t.insert(*it); s.erase(it); if((int)s.size()==d*n)break; } q.clear(); } v.clear(); for(int i:s)v.push_back(i); solve(); v.clear(); for(int i:t)v.push_back(i); solve(); v.clear(); } } void Solve(int N, int M) { n=N; for(int i=0;i<N;i++){ for(int j=0;j<M;j++){ v.push_back(M*i+j+1); } } solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...