Submission #690915

#	Time	Username	Problem	Language	Result	Execution time	Memory
690915		penguin133	Super Dango Maker (JOI22_dango3)	C++17	0 / 100	127 ms	448 KiB

dango3

#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;
			}
		}
		for(auto x : fin)cout << x << ' ';
		cout << '\n';
		Answer(fin);
	}
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 15
• Subtask 4: 0 / 78