제출 #710229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
710229		alvingogo	Super Dango Maker (JOI22_dango3)	C++17	2 / 100	14 ms	996 KiB

dango3

#include <bits/stdc++.h>
#include "dango3.h"
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

void Solve(int n,int m){
    n*=m;
    vector<vector<int> > ans(m);
    vector<int> vis(n+1);
    for(int i=0;i<n/m-1;i++){
        vector<int> gg=ans[0];
        int lst=0;
        int c=0;
        for(int j=0;j<n/m;j++){
            int l=lst+1,r=n;
            while(r>l){
                int mid=(l+r)/2;
                auto v=gg;
                for(int k=lst+1;k<=mid;k++){
                    if(vis[k]){
                        continue;
                    }
                    v.push_back(k);
                }
                if(Query(v)){
                    r=mid;
                }
                else{
                    l=mid+1;
                }
            }
            ans[c].push_back(l);
            vis[l]=1;
            c++;
            for(int k=lst+1;k<l;k++){
                if(vis[k]){
                    continue;
                }
                gg.push_back(k);
            }
            lst=l;
        }
    } 
    int c=0;
    for(int i=1;i<=n;i++){
        if(!vis[i]){
            ans[c].push_back(i);
            c++;
        }
    }
    for(auto h:ans){
        Answer(h);
    }
}

/*
g++ -std=gnu++17 -O2 -o grader grader.cpp temp6.cpp
.\grader.exe
*/

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