#include "dango3.h"
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
return uniform_int_distribution<ll>(l,r)(rng);
}
#define maxn 405
#define maxm 30
ll n,m;
vector<ll> v;
vector<ll> w;
bool ok[maxn*maxm];
ll ask(){
w.clear();
for(ll i = 1;i<=n*m;i++) if(ok[i]) w.pb(i);
return Query(w);
}
ll c = 2000;
void Solve(int N, int M) {
n = N; m = M;
for(ll i = 1;i<=n*m;i++) v.pb(i);
shuffle(all(v),rng);
for(ll i = m;i>=1;i--){
vector<ll> w,ans;
ll len;
lol:;
w.clear();
len = min((ll)v.size(),c);
shuffle(all(v),rng);
for(ll i = 0;i<len;i++) w.pb(v[i]);
for(ll x : w) ok[x] = 1;
if(!ask()){
for(ll x : w) ok[x] = 0;
goto lol;
}
for(ll x : w){
ok[x] = 0;
if(!ask()) ans.pb(x),ok[x] = 1;
}
Answer(ans);
for(ll x : ans) v.erase(find(all(v),x));
for(ll x : ans) ok[x] = 0;
}
}
/**
3 2
3 3 1 2 1 2
4 4
2 2 3 2 4 4 3 2 3 1 1 3 4 1 4 1
**/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
30 ms |
340 KB |
Output is correct |
2 |
Correct |
32 ms |
340 KB |
Output is correct |
3 |
Correct |
31 ms |
340 KB |
Output is correct |
4 |
Correct |
32 ms |
356 KB |
Output is correct |
5 |
Correct |
31 ms |
340 KB |
Output is correct |
6 |
Correct |
32 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
916 ms |
420 KB |
Output is correct |
2 |
Correct |
919 ms |
460 KB |
Output is correct |
3 |
Correct |
935 ms |
460 KB |
Output is correct |
4 |
Correct |
925 ms |
456 KB |
Output is correct |
5 |
Correct |
901 ms |
436 KB |
Output is correct |
6 |
Correct |
930 ms |
440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1930 ms |
488 KB |
Output is correct |
2 |
Correct |
1918 ms |
532 KB |
Output is correct |
3 |
Correct |
1927 ms |
532 KB |
Output is correct |
4 |
Correct |
1912 ms |
532 KB |
Output is correct |
5 |
Correct |
1950 ms |
532 KB |
Output is correct |
6 |
Correct |
1906 ms |
536 KB |
Output is correct |