Submission #710042

#	Time	Username	Problem	Language	Result	Execution time	Memory
710042		alvingogo	Super Dango Maker (JOI22_dango3)	C++17	2 / 100	1209 ms	772 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;i++){
        vector<int> gg=ans[0],zz;
        int c=0;
        for(int j=1;j<=n;j++){
            if(vis[j]){
                continue;
            }
            gg.push_back(j);
            int y=Query(gg);
            if(y==1){
                ans[c].push_back(j);
                c++;
                vis[j]=1;
                gg.pop_back();
            }
        }
    } 
    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