제출 #1165198

#제출 시각아이디문제언어결과실행 시간메모리
1165198mychecksedadSuper Dango Maker (JOI22_dango3)C++20
0 / 100
1 ms576 KiB
#include "dango3.h" #include<bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' #define ff first #define ss second #define pii pair<int,int> #define vi vector<int> namespace { int variable_example = 1; } // namespace void Solve(int n, int m) { vector<int> v; for(int i = 0; i < n; ++i){ for(int j = 0; j < m; ++j) v.pb(i*m + j + 1); } int cur = m; vector<vi> ans(m); while(v.size()){ vector<int> V(all(v)); int idx = V.back(); V.pop_back(); v.pop_back(); int x = Query(V); int cc = cur; cur = x; while(x == cc && x>0){ cc++; for(int j: ans[cc]) V.pb(j); x = Query(V); } ans[x].pb(idx); } for(auto v: ans) Answer(v); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...