제출 #951741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
951741		pcc	Super Dango Maker (JOI22_dango3)	C++17	22 / 100	136 ms	604 KiB

dango3

#include "dango3.h"

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

namespace {

const int mxn = 1e5+10;
vector<int> perm;
bitset<mxn> done;

int ask(vector<int> vv){
	//cerr<<"ASK:";for(auto &i:vv)cerr<<i<<' ';cerr<<endl;
	return Query(vv);
}

}  // namespace
/*
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);
}
*/


void Solve(int N, int M) {
	for(int i = 1;i<=N*M;i++)perm.push_back(i);
	mt19937 seed(7124);
	shuffle(perm.begin()+1,perm.end(),seed);
	for(int i = 1;i<=M;i++){
		int l = 0,r = perm.size()-1;
		vector<int> v;
		while(l != r){
			int mid = (l+r)>>1;
			vector<int> tmp;
			for(int i = 0;i<=mid;i++)tmp.push_back(perm[i]);
			if(tmp.size()<N)l = mid+1;
			else if(ask(tmp) != 0)r = mid;
			else l = mid+1;
		}
		for(int i = 0;i<=l;i++)v.push_back(perm[i]);
		while(v.size()>N){
			auto tmp = v.back();
			v.pop_back();
			if(ask(v) == 0)v.insert(v.begin(),tmp);
			//for(auto &j:v)cerr<<j<<' ';cerr<<endl;
		}
		for(auto &j:v)perm.erase(find(perm.begin(),perm.end(),j));
		//cerr<<"ANS:";for(auto &j:v)cerr<<j<<' ';cerr<<endl;
		Answer(v);
	}
	return;
}

컴파일 시 표준 에러 (stderr) 메시지

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:46:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |    if(tmp.size()<N)l = mid+1;
      |       ~~~~~~~~~~^~
dango3.cpp:51:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   while(v.size()>N){
      |         ~~~~~~~~^~

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