Submission #954313

#TimeUsernameProblemLanguageResultExecution timeMemory
954313LCJLYSuper Dango Maker (JOI22_dango3)C++17
7 / 100
5111 ms1172 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; //code #define show(x,y) cout << y << " " << #x << endl; #define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl; #define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl; #define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl; typedef pair<int,int>pii; typedef pair<pii,pii>pi2; //Query() Answer() void Solve(int n, int m) { vector<int>arr[m]; arr[0].push_back(1); vector<int>v; for(int x=n*m;x>=2;x--){ v.push_back(x); } for(int x=2;x<=n*m;x++){ unordered_set<int>se; for(int y=0;y<m;y++){ for(auto it:arr[y]) se.insert(it); vector<int>que; for(int i=1;i<=n*m;i++){ if(i==x) continue; if(se.find(i)!=se.end()) continue; que.push_back(i); } int hold=Query(que); if(hold==m-y-1){ arr[y].push_back(x); break; } } } for(int x=0;x<m;x++){ Answer(arr[x]); } } //code
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...