Submission #892264

#TimeUsernameProblemLanguageResultExecution timeMemory
892264vjudge1Super Dango Maker (JOI22_dango3)C++17
2 / 100
378 ms952 KiB
#include <bits/stdc++.h> #include "dango3.h" #define ll int #define str string #define ins insert #define ld long double #define pb push_back #define pf push_front #define pof pop_front() #define pob pop_back() #define lb lower_bound #define ub upper_bound #define endl "\n" #define fr first #define sc second #define mpa make_pair #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define sz size() #define bc back() #define ar array #define vll vector<ll> using namespace std; void Solve(ll n,ll m) { ll i,j; vector<ll> lst; map<ll,ll> mp; vector<vll> col(n+5); for(i=1;i<n;i++){ vector<ll> v=lst; for(j=1;j<=n*m;j++){ if(mp[j])continue; v.pb(j); ll x=Query(v); if(x==1){ mp[j]++; col[i].pb(j); v.pop_back(); lst.pb(j); } } } for(i=1;i<=n*m;i++)if(!mp[i])col[n].pb(i); for(i=1;i<=m;i++){ vector<ll> v; for(j=1;j<=n;j++){ v.pb(col[j].bc); col[j].pop_back(); } Answer(v); } } /* 3 2 3 3 1 2 1 2 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...