#include "dango3.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
mt19937_64 rng (chrono :: system_clock :: now().time_since_epoch().count());
void Solve(int n, int m)
{
int i,cur_n,a[10005],num_taken,id,query_ans;
bool taken[10005];
set<int> s;
for (i=1;i<n*m+1;i++) s.insert(i);
for (int w=1;w<m;w++)
{
vector<int> ans;
cur_n=0;
for (auto u:s)
{
cur_n++;
a[cur_n]=u;
}
shuffle(a+1,a+cur_n+1,rng);
// for (i=1;i<cur_n+1;i++) cout<<a[i]<<" ";
// cout<<"\n";
for (i=1;i<cur_n+1;i++) taken[i]=false;
taken[1]=true;
ans.pb(a[1]);
s.erase(a[1]);
num_taken=1;
id=1;
while (num_taken<n)
{
id++;
vector<int> query_v;
for (i=1;i<cur_n+1;i++) if (!taken[i] and i!=id) query_v.pb(a[i]);
query_ans=Query(query_v);
if (query_ans==m-w)
{
taken[id]=true;
ans.pb(a[id]);
num_taken++;
s.erase(a[id]);
}
}
// for (auto u:ans) cout<<u<<" ";
// cout<<"\n";
Answer(ans);
}
vector<int> final_ans;
for (auto u:s) final_ans.pb(u);
Answer(final_ans);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
432 KB |
Output is correct |
2 |
Correct |
13 ms |
468 KB |
Output is correct |
3 |
Correct |
16 ms |
428 KB |
Output is correct |
4 |
Correct |
16 ms |
340 KB |
Output is correct |
5 |
Correct |
13 ms |
432 KB |
Output is correct |
6 |
Correct |
16 ms |
472 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
490 ms |
720 KB |
Output is correct |
2 |
Correct |
547 ms |
724 KB |
Output is correct |
3 |
Correct |
550 ms |
724 KB |
Output is correct |
4 |
Correct |
513 ms |
724 KB |
Output is correct |
5 |
Correct |
506 ms |
724 KB |
Output is correct |
6 |
Correct |
531 ms |
724 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2323 ms |
1068 KB |
Output is correct |
2 |
Correct |
2206 ms |
1044 KB |
Output is correct |
3 |
Correct |
2204 ms |
1044 KB |
Output is correct |
4 |
Correct |
2412 ms |
1044 KB |
Output is correct |
5 |
Correct |
1808 ms |
1052 KB |
Output is correct |
6 |
Correct |
2577 ms |
1044 KB |
Output is correct |