#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
#define f first
#define s second
#define pb push_back
#define vec vector
#define sz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
typedef pair<int,int> pii;
typedef long double ld;
//auto rng=bind(uniform_int_distribution<int>(1,1e9),mt19937(time(0)));
typedef long long ll;
const ll inf=1e18+100;
//const int N=49;
mt19937 rng(13193193);
int query(vector<int> q);
void solve(int n){
/// let's try
vec<int>pr(n);iota(all(pr),1);
int cnt=(n>50?2399:n>7?399:50);cnt--;
vec<vec<ll>>answ(n,vec<ll>(n+1,0));
vec<vec<int>>cntt(n,vec<int>(n+1,0));
// vec<int>p(n)
while(cnt--){
shuffle(all(pr),rng);
int how=query(pr);
if(how==n) return;
for(int i=0;i<n;i++){
answ[i][pr[i]]+=how;
cntt[i][pr[i]]++;
}
}
vec<pair<ld,pii>>vc;
for(int i=0;i<n;i++){
for(int j=1;j<=n;j++){
if(cntt[i][j]){
vc.pb({(ld)answ[i][j]/cntt[i][j],{i,j}});
}
else{
j=j;
///feels bad
}
}
}
fill(all(pr),0);
sort(rall(vc));
vec<bool>used(n+1,0);
vec<bool>used1(n+1,0);
for(auto &z : vc){
if(used[z.s.s]) continue;
if(used1[z.s.f]) continue;
// cerr<<
pr[z.s.f]=z.s.s;
used[z.s.s]=1;
used1[z.s.f]=1;
}
// for(auto &z : pr) cout<<z<<' ';
query(pr);
return ;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
200 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
200 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
200 KB |
Unexpected end of file - int32 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
