제출 #951547

#제출 시각아이디문제언어결과실행 시간메모리
951547Darren0724Super Dango Maker (JOI22_dango3)C++17
7 / 100
770 ms796 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; const int N=10005; void Solve(int n, int m) { vector<int> vis(N); for (int i = 0; i < m; i++) { vector<int> a; for(int j=1;j<=n*m;j++){ if(!vis[j]){ a.push_back(j); } } int sz=a.size(); vector<int> t(sz,1); for(int j=0;j<sz;j++){ t[j]=0; vector<int> v; for(int k=0;k<sz;k++){ if(t[k]){ v.push_back(a[k]); } } if(Query(v)==0){ t[j]=1; } } vector<int> v; for(int k=0;k<sz;k++){ if(t[k]){ v.push_back(a[k]); vis[a[k]]=1; } } Answer(v); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...