# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690916 | penguin133 | Super Dango Maker (JOI22_dango3) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
}
#include <bits/stdc++.h>
using namespace std;
//#include "dango3.h"
int vis[405];
void Solve(int N, int M) {
for(int i=1;i<=M;i++){
vector <int> fin;
for(int j=1;j<=N*M;j++){
if(vis[j])continue;
vector <int> stuf;
for(int k=1;k<=N*M;k++){
if(vis[k] || k == j)continue;
stuf.push_back(k);
}
if(Query(stuf) == M - i){
fin.push_back(j);
vis[j] = 1;
}
}
Answer(fin);
}
}