#include "dango3.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ldb long double
#define db double
#define fin(x) freopen(x,"r",stdin)
#define fout(x) freopen(x,"w",stdout)
#define fo(i,l,r) for(int i=(l);i<=(r);i++)
#define foi(i,l,r) for(int i=(l);i>=(r);i--)
#define el cout<<'\n';
#define cel cerr<<'\n';
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define gb(x,i) (((x)>>(i))&1)
#define mask(i) (1LL<<(i))
#define TIME (1.0 * clock()/CLOCKS_PER_SEC)
using namespace std;
const int mxN=1e5+4;
const int bl=60;
const ll base=1e9+7;
const ll inf=1e9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll l,ll r)
{
return l+(1ll*rng()*rng()%(r-l+1)+(r-l+1))%(r-l+1);
}
template<class X,class Y>bool maximize(X &a,Y b)
{
if(a<b) return a=b,true;
return false;
}
template<class X,class Y>bool minimize(X &a, Y b)
{
if(a>b) return a=b,true;
return false;
}
void add(auto &a,auto b)
{
a+=b;
if(a>=base) a-=base;
if(a<0) a+=base;
}
int per;
void tryy(int sl,vector<int>id)
{
if(sl==1)
{
Answer(id);
return;
}
int mid=sl/2;
vector<int>tl;
fo(i,0,per*mid-1) tl.pb(id.back()),id.pop_back();
while(Query(tl)<mid) tl.pb(id.back()),id.pop_back();
int run=(int)tl.size()-1;
while((int)tl.size()>per*mid)
{
swap(tl[run],tl.back());
int x=tl.back();
tl.pop_back();
if(Query(tl)<mid) tl.pb(x);
else id.pb(x);
run--;
}
tryy(mid,tl),tryy(sl-mid,id);
}
void Solve(int n,int m)
{
vector<int>cc;
fo(i,1,n*m) cc.pb(i);
per=n,tryy(m,cc);
}
Compilation message
dango3.cpp:42:10: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
42 | void add(auto &a,auto b)
| ^~~~
dango3.cpp:42:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
42 | void add(auto &a,auto b)
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
504 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
348 KB |
Output is correct |
2 |
Correct |
4 ms |
348 KB |
Output is correct |
3 |
Correct |
4 ms |
348 KB |
Output is correct |
4 |
Correct |
4 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
54 ms |
636 KB |
Output is correct |
2 |
Correct |
44 ms |
596 KB |
Output is correct |
3 |
Correct |
100 ms |
628 KB |
Output is correct |
4 |
Correct |
104 ms |
856 KB |
Output is correct |
5 |
Correct |
12 ms |
600 KB |
Output is correct |
6 |
Correct |
12 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
184 ms |
724 KB |
Wrong Answer [3] |
2 |
Halted |
0 ms |
0 KB |
- |