Submission #892304

#TimeUsernameProblemLanguageResultExecution timeMemory
892304vjudge1Super Dango Maker (JOI22_dango3)C++17
0 / 100
1653 ms1288 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,q; vector<ll> lst; vector<vll> col(n+5); set<ll> st; for(i=1;i<=n*m;i++)st.ins(i); for(i=1;i<n;i++){ vector<ll> cur; for(j=1;j<=m;j++){ ll l=0,r=st.sz; while(l+1<r){ ll mid=(l+r)/2; vector<ll> v=lst; auto it=st.begin(); for(q=0;q<mid;q++){ v.pb(*it); it++; } ll x=Query(v); if(x>0)r=mid; else l=mid; } auto it=st.begin(); for(q=1;q<r;q++)it++; cur.pb(*it); st.erase(it); } for(auto j : cur){ col[i].pb(j); lst.pb(j); } }for(auto i : st){ col[n].pb(i); } for(i=1;i<=n;i++){ for(auto j : col[i])cout<<j<<' '; cout<<endl; } 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...