Submission #1000569

#TimeUsernameProblemLanguageResultExecution timeMemory
1000569De3b0oSuper Dango Maker (JOI22_dango3)C++17
100 / 100
2641 ms1128 KiB
#include "dango3.h" #include<bits/stdc++.h> #define ll long long #define F first #define S second #define in insert #define pb push_back #define ppb pop_back() #define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define cans cout << ans << "\n"; #define yes cout << "Yes" << "\n"; #define no cout << "No" << "\n"; #define pll pair<ll,ll> #define lin cout << "\n"; #define sqr 340 #define mod 1000000007 #define mid ((l+r)/2) #define lc (2*x) #define rc (2*x+1) using namespace std; ll n , m; vector<int> ans[26]; bool vis[26][10001]; vector<ll> idx; void Solve(int N, int M) { n=N; m=M; for(int i = 1 ; n*m>=i ; i++) idx.pb(i); random_shuffle(idx.begin(),idx.end()); for(int h = 0 ; n*m>h ; h++) { ll i = idx[h]; ll l = 0 , r = m-1; ll f; while(l<=r) { ll j = mid; if(ans[j].size()==n) { l=mid+1; continue; } vector<int> q; for(int jj = 1 ; n*m>=jj ; jj++) { if(vis[j][jj]||jj==i) continue; q.pb(jj); } if(Query(q)==m-1) { f=j; r=j-1; } else l=j+1; } vis[f][i]=1; ans[f].pb(i); } for(int i = 0 ; m>i ; i++) Answer(ans[i]); }

Compilation message (stderr)

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:43:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   43 |             if(ans[j].size()==n)
      |                ~~~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...