Submission #677767

#TimeUsernameProblemLanguageResultExecution timeMemory
677767DwightKSchruteSuper Dango Maker (JOI22_dango3)C++17
100 / 100
3903 ms796 KiB
/* #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") */ #include<bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef vector<int>vi; typedef vector<vector<int>>vvi; typedef vector<ll>vl; typedef vector<vl> vvl; typedef pair<int,int>pi; typedef pair<ll,ll> pl; typedef vector<pl> vpl; typedef vector<ld> vld; typedef pair<ld,ld> pld; typedef vector<pi> vpi; //typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;} #define all(x) x.begin(),x.end() #define YES out("YES") #define NO out("NO") #define out(x){cout << x << "\n"; return;} #define outfl(x){cout << x << endl;return;} #define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";} #define pb push_back #define umap unordered_map template<typename T> void read(vector<T>& v){ int n=v.size(); for(int i=0; i<n; i++) cin >> v[i]; } template<typename T> vector<T>UNQ(vector<T>a){ vector<T>ans; for(T t:a) if(ans.empty() || t!=ans.back()) ans.push_back(t); return ans; } #include "dango3.h" int N,M; int max_cnt(vi a){ vector<bool>in(N*M+1); for(int x:a) in[x]=1; vi rest; for(int i=1; i<=N*M; i++) if(!in[i]) rest.pb(i); return M- Query(rest); } void Solve(int n,int m){ N=n,M=m; vvi groups(m); for(int i=1; i<=n*m; i++){ int l=0,r=m-1,color=0; while(l<=r){ int mid=(l+r)/2; vi cur; for(int j=0; j<=mid; j++) for(int x:groups[j]) cur.pb(x); cur.pb(i); if(max_cnt(cur)==mid+2) l=mid+1; else r=mid-1,color=mid; } groups[color].pb(i); } for(const vi& group:groups) Answer(group); } /* 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...