Submission #793956

#	Time	Username	Problem	Language	Result	Execution time	Memory
793956		MetalPower	Super Dango Maker (JOI22_dango3)	C++17	0 / 100	1770 ms	712 KiB

dango3

#include "dango3.h"

#include <bits/stdc++.h>
using namespace std;

bool ans[10005];
vector<int> pos[30];

void Solve(int N, int M) {
  	for(int i = 1; i <= N * M; i++){
  		int l = 1, r = M;
  		while(l < r){
  			int mid = l + r >> 1;
  			memset(ans, 0, sizeof ans);

  			for(int j = 1; j <= mid; j++){
  				for(int x : pos[j]) ans[x] = true;
  			}
  			ans[i] = true;

  			vector<int> vec;
  			for(int i = 1; i <= N * M; i++){
  				if(!ans[i]) vec.push_back(i);
  			}

  			int curr = Query(vec);
  			if(curr >= M - mid) r = mid;
  			else l = mid + 1;
  		}
  		pos[l].push_back(i);
  	}
}

Compilation message (stderr)

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:13:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |      int mid = l + r >> 1;
      |                ~~^~~

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