제출 #639690

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

dango3

#include "dango3.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int Query(vector<int> v, vector<int> u)
{
	for(int i : u)
		v.emplace_back(i);
	return Query(v);
}

void Solve(int N, int M)
{
	mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
	vector<int> v;
	for(int i = 1; i <= N * M; i++)
		v.emplace_back(i);
	shuffle(v.begin(), v.end(), rd);
	for(int i = M - 1; i > 0; i--)
	{
		vector<int> ign, ans;
		ans.emplace_back(v.back());
		v.pop_back();
		while(ans.size() < N)
		{
			int k = v.back();
			v.pop_back();
			if(Query(v, ign) == i)
				ans.emplace_back(k);
			else 
				ign.emplace_back(k);
		}
		for(int i : ign)
			v.emplace_back(i);
		Answer(ans);
	}
	Answer(v);
}

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

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:29:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |   while(ans.size() < N)
      |         ~~~~~~~~~~~^~~

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