#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int a[110], b[110];
int n;
int minValue(int N, int W) {
n=N;
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
a[0]=1;
playRound(a, b);
for (int i=1; i<N; ++i) if (b[i]==0) return i;
return 0;
}
int maxValue(int N, int W) {
n=N;
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
for (int i=0; i<N; ++i){
a[i]=1;
}
playRound(a, b);
// for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
// cout << '\n';
for (int i=0; i<N; ++i){
a[i]=(b[i]>a[i] && a[i])?2:0;
}
playRound(a, b);
// for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
// cout << '\n';
for (int i=0; i<N; ++i){
a[i]=(b[i]>a[i] && a[i])?4:0;
}
playRound(a, b);
// for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
// cout << '\n';
for (int i=0; i<N; ++i){
a[i]=(b[i]>a[i] && a[i])?11:0;
}
playRound(a, b);
for (int i=0; i<N; ++i) if (b[i]>a[i] && a[i]) return i;
// for (int i=0; i<N; ++i) if (b[i]) cout << i+1 << ' ';
// cout << '\n';
return 0;
}
int ans[110], ans2[110];
int greaterValue(int N, int W) {
n=N;
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
for (int i=0; i<N; ++i){
a[i]=1;
}
playRound(a, b);
if ((b[0]>a[0])!=(b[1]>a[1])){
if (b[0]>a[0]) return 0;
return 1;
}
if (b[0]>a[0] && b[1]>a[1]){
for (int i=0; i<N; ++i) a[i]=(i==0 || i==1)?10:0;
playRound(a, b);
if (b[0]>a[0]) return 0;
return 1;
}
// bitset<1225> bs[11];
// for (int i=0; i<=10; ++i) bs[i].reset();
// for (int v=1; v<=10; ++v){
// int cur=0;
// for (int x=0; x<N; ++x) for (int y=x+1; y<N; ++y) if (x<50 && y<50){
// for (int i=0; i<N; ++i) a[i]=(i==x || i==y)?v:0;
// playRound(a, b);
// bs[v].set(cur++, b[x]!=b[y]);
// }
// }
// for (int i=0; i<1024; ++i){
// bitset<1225> tot;
// for (int j=0; j<10; ++j) if (i>>j&1) tot|=bs[j+1];
// if (tot.all()){
// for (int j=0; j<10; ++j) if (i>>j&1) cout << j+1 << ' ';
// cout << '\n';
// }
// }
for (int v:{1, 3, 6}){
for (int i=0; i<N; ++i) a[i]=(i==0 || i==1)?v:0;
playRound(a, b);
if ((b[0]>a[0])!=(b[1]>a[1])){
if (b[0]>a[0]) return 0;
return 1;
}
}
return 0;
}
bool compare(int x, int y){
if (ans[x]!=ans[y]){
if (ans[x]) return 0;
return 1;
}
if (ans[x] && ans[y]){
for (int i=0; i<n; ++i) a[i]=(i==x || i==y)?10:0;
playRound(a, b);
if (b[x]>a[x]) return 0;
return 1;
}
for (int v:{6, 3, 1}){
for (int i=0; i<n; ++i) a[i]=(i==x || i==y)?v:0;
playRound(a, b);
if ((b[x]>a[x])!=(b[y]>a[y])){
if (b[x]>a[x]) return 0;
return 1;
}
}
return 0;
}
void allValues(int N, int W, int *P) {
n=N;
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
auto comp=[&](int x, int y) -> bool {
for (int i=0; i<N; ++i) a[i]=(i==x || i==y)?100:0;
playRound(a, b);
return (b[y]>a[y]);
};
auto merge_sort=[&](auto self, vector<int> &v) -> void {
int sz=(int)v.size();
if (sz<=1) return;
vector<int> vl(v.begin(), v.begin()+sz/2);
vector<int> vr(v.begin()+sz/2, v.end());
self(self, vl);
self(self, vr);
merge(vl.begin(), vl.end(), vr.begin(), vr.end(), v.begin(), comp);
};
vector<int> v(N);
iota(v.begin(), v.end(), 0);
merge_sort(merge_sort, v);
for (int i=0; i<N; ++i) P[v[i]]=i+1;
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
for (int i=0; i<n; ++i){
a[i]=1;
}
playRound(a, b);
for (int i=0; i<n; ++i) ans[i]=b[i]>a[i];
for (int i=0; i<n; ++i){
a[i]=ans[i]?2:0;
}
playRound(a, b);
for (int i=0; i<n; ++i) ans2[i]=b[i]>a[i];
auto merge_sort=[&](auto self, vector<int> &v) -> void {
int sz=(int)v.size();
if (sz<=1) return;
vector<int> vl(v.begin(), v.begin()+sz/2);
vector<int> vr(v.begin()+sz/2, v.end());
self(self, vl);
self(self, vr);
merge(vl.begin(), vl.end(), vr.begin(), vr.end(), v.begin(), compare);
};
mt19937 rng(69420);
vector<vector<int>> v(4);
for (int i=0; i<n; ++i) v[(ans[i]<<1)|ans2[i]].push_back(i);
merge_sort(merge_sort, v[0]);
merge_sort(merge_sort, v[1]);
merge_sort(merge_sort, v[2]);
merge_sort(merge_sort, v[3]);
v[0].insert(v[0].end(), v[1].begin(), v[1].end());
v[0].insert(v[0].end(), v[2].begin(), v[2].end());
v[0].insert(v[0].end(), v[3].begin(), v[3].end());
for (int i=0; i<N; ++i) P[v[0][i]]=i+1;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
344 KB |
Output is correct |
| 2 |
Correct |
3 ms |
344 KB |
Output is correct |
| 3 |
Correct |
3 ms |
344 KB |
Output is correct |
| 4 |
Correct |
3 ms |
456 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
344 KB |
Output is correct |
| 2 |
Correct |
10 ms |
344 KB |
Output is correct |
| 3 |
Correct |
10 ms |
344 KB |
Output is correct |
| 4 |
Correct |
10 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
51 ms |
460 KB |
Output is partially correct |
| 2 |
Partially correct |
60 ms |
452 KB |
Output is partially correct |
| 3 |
Partially correct |
54 ms |
464 KB |
Output is partially correct |
| 4 |
Partially correct |
54 ms |
464 KB |
Output is partially correct |
| 5 |
Partially correct |
50 ms |
468 KB |
Output is partially correct |
| 6 |
Partially correct |
52 ms |
456 KB |
Output is partially correct |
| 7 |
Partially correct |
50 ms |
464 KB |
Output is partially correct |
| 8 |
Partially correct |
52 ms |
476 KB |
Output is partially correct |
| 9 |
Partially correct |
52 ms |
468 KB |
Output is partially correct |
| 10 |
Partially correct |
49 ms |
472 KB |
Output is partially correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
456 KB |
Output is correct |
| 2 |
Correct |
26 ms |
344 KB |
Output is correct |
| 3 |
Correct |
26 ms |
344 KB |
Output is correct |
| 4 |
Correct |
25 ms |
344 KB |
Output is correct |
| 5 |
Correct |
24 ms |
344 KB |
Output is correct |
| 6 |
Correct |
25 ms |
344 KB |
Output is correct |
| 7 |
Correct |
24 ms |
444 KB |
Output is correct |
| 8 |
Correct |
25 ms |
452 KB |
Output is correct |
| 9 |
Correct |
24 ms |
344 KB |
Output is correct |
| 10 |
Correct |
25 ms |
344 KB |
Output is correct |
| 11 |
Correct |
24 ms |
344 KB |
Output is correct |
| 12 |
Correct |
16 ms |
344 KB |
Output is correct |
| 13 |
Correct |
24 ms |
452 KB |
Output is correct |
| 14 |
Correct |
24 ms |
344 KB |
Output is correct |
| 15 |
Correct |
22 ms |
344 KB |
Output is correct |
| 16 |
Correct |
22 ms |
452 KB |
Output is correct |
| 17 |
Correct |
23 ms |
348 KB |
Output is correct |
| 18 |
Correct |
22 ms |
344 KB |
Output is correct |
| 19 |
Correct |
23 ms |
344 KB |
Output is correct |
| 20 |
Correct |
22 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
6 ms |
344 KB |
Output is partially correct |
| 2 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 3 |
Partially correct |
11 ms |
452 KB |
Output is partially correct |
| 4 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 5 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 6 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 7 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 8 |
Partially correct |
9 ms |
596 KB |
Output is partially correct |
| 9 |
Partially correct |
9 ms |
600 KB |
Output is partially correct |
| 10 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 11 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 12 |
Partially correct |
6 ms |
344 KB |
Output is partially correct |
| 13 |
Partially correct |
10 ms |
452 KB |
Output is partially correct |
| 14 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 15 |
Partially correct |
9 ms |
340 KB |
Output is partially correct |
| 16 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 17 |
Partially correct |
12 ms |
344 KB |
Output is partially correct |
| 18 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 19 |
Partially correct |
9 ms |
456 KB |
Output is partially correct |
| 20 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 21 |
Partially correct |
10 ms |
448 KB |
Output is partially correct |
| 22 |
Partially correct |
9 ms |
452 KB |
Output is partially correct |
| 23 |
Partially correct |
8 ms |
344 KB |
Output is partially correct |
| 24 |
Partially correct |
9 ms |
456 KB |
Output is partially correct |
| 25 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 26 |
Partially correct |
11 ms |
456 KB |
Output is partially correct |
| 27 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 28 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 29 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 30 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 31 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 32 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 33 |
Partially correct |
10 ms |
344 KB |
Output is partially correct |
| 34 |
Partially correct |
8 ms |
344 KB |
Output is partially correct |
| 35 |
Partially correct |
9 ms |
344 KB |
Output is partially correct |
| 36 |
Partially correct |
9 ms |
348 KB |
Output is partially correct |
| 37 |
Partially correct |
9 ms |
460 KB |
Output is partially correct |
| 38 |
Partially correct |
8 ms |
344 KB |
Output is partially correct |
| 39 |
Partially correct |
8 ms |
600 KB |
Output is partially correct |
| 40 |
Partially correct |
9 ms |
348 KB |
Output is partially correct |
