제출 #704950

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

dango3

#include "dango3.h"

#include <bits/stdc++.h>

using namespace std;

mt19937 rnd(228);

void Solve(int n, int m) {
    const int N = n * m;

    vector<int> ord(N);
    iota(ord.begin(), ord.end(), 1);
    shuffle(ord.begin(), ord.end(), rnd);

    deque<int> st(ord.begin(), ord.end());

    while (st.size() > n) {
        vector<int> now;
        int full = st.size() / n;

        while (now.size() < n) {
            int x = st.front();
            st.pop_front();

            if (Query(vector(st.begin(), st.end())) == full - 1) {
                now.push_back(x);
                continue;
            } else {
                st.push_back(x);
            }
        }

        Answer(now);
    }

    Answer(vector(st.begin(), st.end()));
}

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

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:18:22: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |     while (st.size() > n) {
      |            ~~~~~~~~~~^~~
dango3.cpp:22:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |         while (now.size() < n) {
      |                ~~~~~~~~~~~^~~

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