#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;
vector<int> haha[100001];
void ComputeAdvice(int *c, int n, int k, int m) {
int br = 0,z = 1;
while(z <= n) {
z*=2;
br++;
}
vector<int> ans(0);
vector<int> p(n);
vector<bool> bruh(n);
int a,b;
priority_queue<pair<int,int>> idk;
for(int i = 0; i < n; i++) {
haha[c[i]].push_back(i);
}
for(int i = 0; i < n; i++) {
haha[i].push_back(INT_MAX);
}
for(int i = 0; i < k; i++) {
bruh[i] = true;
p[i]++;
idk.push({haha[i][0],i});
}
for(int i = 0; i < n; i++) {
if(bruh[c[i]]) {
ans.push_back(INT_MAX);
}
else {
a = idk.top().first;
b = idk.top().second;
bruh[b] = false;
idk.pop();
p[b]++;
ans.push_back(b);
p[c[i]]++;
idk.push({haha[c[i]][p[c[i]]],c[i]});
bruh[c[i]] = true;
}
}
for(int i = 0; i < n; i++) {
for(int j = br-1; j >= 0; j--) {
if((1 << j)&ans[i]) {
WriteAdvice(1);
}
else {
WriteAdvice(0);
}
}
}
}
#include<bits/stdc++.h>
#include "assistant.h"
using namespace std;
void Assist(unsigned char *a, int n, int k, int r) {
int br = 0,z = 1,x = 0;
while(z <= n) {
z*=2;
br++;
}
int y = 0;
for(int i = 0; i < n; i++) {
GetRequest();
x = 0;
for(int j = 0; j < br; j++) {
x*=2;
x+=(int)a[y];
y++;
}
if(x < n) {
PutBack(x);
}
}
}
Compilation message
advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:15:9: warning: variable 'a' set but not used [-Wunused-but-set-variable]
15 | int a,b;
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2960 KB |
Output is correct |
2 |
Incorrect |
1 ms |
2952 KB |
Output isn't correct - not an optimal way |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
24 ms |
4564 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
224 ms |
16244 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
3096 KB |
Error - advice is too long |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
281 ms |
19596 KB |
Output isn't correct - not an optimal way |
2 |
Incorrect |
278 ms |
19612 KB |
Output isn't correct - not an optimal way |
3 |
Incorrect |
276 ms |
19460 KB |
Output isn't correct - not an optimal way |
4 |
Incorrect |
281 ms |
19600 KB |
Output isn't correct - not an optimal way |
5 |
Incorrect |
274 ms |
19548 KB |
Output isn't correct - not an optimal way |
6 |
Incorrect |
280 ms |
19464 KB |
Output isn't correct - not an optimal way |
7 |
Incorrect |
273 ms |
19508 KB |
Output isn't correct - not an optimal way |
8 |
Incorrect |
280 ms |
19488 KB |
Output isn't correct - not an optimal way |
9 |
Incorrect |
275 ms |
19456 KB |
Output isn't correct - not an optimal way |
10 |
Correct |
283 ms |
19676 KB |
Output is partially correct - 1700000 bits used |