Submission #754894

#	Time	Username	Problem	Language	Result	Execution time	Memory
754894		Lobo	Super Dango Maker (JOI22_dango3)	C++17	0 / 100	3057 ms	704 KiB

dango3

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#include "dango3.h"

namespace {

int variable_example = 1;

}  // namespace

void Solve(int N, int M) {

	int n,m;
	n = N;
	m = M;
	vector<vector<int>> ans;
	vector<int> fq;
	ans.resize(m);
	fq.resize(n*m+1,0);

	for(int i = 1; i <= n*m; i++) {
		int l = 0;
		int r = m-1;
		while(l < r) {
			int mid = (l+r)>>1;

			for(int j = l; j <= mid; j++) {
				for(auto x : ans[j]) fq[x]++;
			}

			vector<int> vc;
			for(int j = 1; j <= n*m; j++) {
				if(fq[j] == 0 && i != j) vc.pb(j);
			}

			for(int j = l; j <= mid; j++) {
				for(auto x : ans[j]) fq[x]--;
			}

			int apmx = Query(vc);

			if(apmx <= mid-l+1) {
				r = mid;
			}
			else {
				l = mid+1;
			}
		}

		ans[l].pb(i);
	}

	for(int i = 0; i < m; i++) {
		Answer(ans[i]);
	}
	return;


  std::vector<int> x(3);
  x[0] = 1;
  x[1] = 2;
  x[2] = 3;
  variable_example = Query(x);
  for (int i = 0; i < M; i++) {
    std::vector<int> a(N);
    for (int j = 0; j < N; j++) {
      a[j] = N * i + j + 1;
    }
    Answer(a);
  }
}

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