#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define ppb pop_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,m;
vector<int> xo(vector<vector<int>> a,int mid){
set<int> st;
for(int i=1;i<=n*m;i++)st.insert(i);
for(int i=0;i<=mid;i++){
for(int j=0;j<sz(a[i]);j++){
st.erase(a[i][j]);
}
}
vector<int> vec;
for(int x:st)vec.pb(x);
return vec;
}
void Solve(int N, int M) {
n=N,m=M;
vector<vector<int>> a(M);
for(int i=1;i<=N*M;i++){
int l=0,r=M-1,res=M-1;
while(l<=r){
int m=(l+r)/2;
a[m].pb(i);
if(M-Query(xo(a,m))==m+2){
l=m+1;
}
else{
r=m-1;
res=m;
}
a[m].ppb();
}
// cout<<i<<" "<<res<<'\n';
a[res].pb(i);
}
for(int i=0;i<M;i++)Answer(a[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 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 |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
254 ms |
536 KB |
Output is correct |
2 |
Correct |
231 ms |
540 KB |
Output is correct |
3 |
Correct |
246 ms |
348 KB |
Output is correct |
4 |
Correct |
262 ms |
344 KB |
Output is correct |
5 |
Correct |
221 ms |
348 KB |
Output is correct |
6 |
Correct |
243 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
10009 ms |
1092 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
10013 ms |
1392 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |