#include "advisor.h"
void ComputeAdvice(int *C, int N, int K, int M) {
/// funciona para mandar el numero WriteAdvice();
int bitsOcupo = 0;
if(N <= 5000){
bitsOcupo = 13;
}else{
bitsOcupo = 17;
}
for(int i = 0; i < N; ++i){
int num = C[i];
int bits = 0;
while(num > 0){
WriteAdvice(num % 2);
bits++;
num/=2;
}
for(int j = bits + 1; j <= bitsOcupo; ++j){
WriteAdvice(0);
}
}
}
#include <bits/stdc++.h>
#include "assistant.h"
using namespace std;
priority_queue<pair<int, int> > colaP;
int apariciones[100002];
int sigAparicion[100002];
int ultima[100002];
void Assist(unsigned char *A, int N, int K, int R) {
int bitsOcupo = 0;
if(N <= 5000){
bitsOcupo = 13;
}else{
bitsOcupo = 17;
}
int secOriginal[100002];
/// pongo los que tengo actualmente en el andamio
int pos = 0;
for(int i = 0; i < N; ++i){
int num = 0;
int pot = 1;
for(int j = 1; j <= bitsOcupo; ++j){
if((int)A[pos] == 1){
num+= pot;
}
//cout << (int)A[pos] << ' ';
pot*=2;
pos++;
}
secOriginal[i] = num;
}
for(int i = N - 1; i >= 0; --i){
apariciones[i] = INT_MAX;
ultima[i] = INT_MAX;
}
for(int i = N - 1; i >= 0; --i){
sigAparicion[i] = apariciones[secOriginal[i]];
ultima[secOriginal[i]] = sigAparicion[i];
apariciones[secOriginal[i]] = i;
}
/// el first es la posicion de la siguiente aparicion
/// el second es el color
bool andamio[100002];
for(int i = 0; i < N; ++i){
if(i < K){
andamio[i] = true;
colaP.push({ultima[i], i});
}else{
andamio[i] = false;
}
}
for(int i = 0; i < N; ++i){
int sigColor = GetRequest();
if(!andamio[sigColor]){
pair<int, int> aux;
aux = colaP.top();
colaP.pop();
PutBack(aux.second);
//cout << '\n' << aux.second << '\n';
andamio[aux.second] = false;
andamio[sigColor] = true;
colaP.push({sigAparicion[i], sigColor});
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1020 KB |
Output is correct |
2 |
Incorrect |
1 ms |
1024 KB |
Output isn't correct - not an optimal way |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
35 ms |
2388 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
280 ms |
12092 KB |
Output isn't correct - not an optimal way |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
508 KB |
Error - advice is too long |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
330 ms |
14664 KB |
Output isn't correct - not an optimal way |
2 |
Incorrect |
365 ms |
14768 KB |
Output isn't correct - not an optimal way |
3 |
Incorrect |
328 ms |
14764 KB |
Output isn't correct - not an optimal way |
4 |
Incorrect |
363 ms |
14616 KB |
Output isn't correct - not an optimal way |
5 |
Incorrect |
335 ms |
14804 KB |
Output isn't correct - not an optimal way |
6 |
Incorrect |
337 ms |
14748 KB |
Output isn't correct - not an optimal way |
7 |
Incorrect |
330 ms |
14772 KB |
Output isn't correct - not an optimal way |
8 |
Incorrect |
319 ms |
14716 KB |
Output isn't correct - not an optimal way |
9 |
Incorrect |
332 ms |
14792 KB |
Output isn't correct - not an optimal way |
10 |
Incorrect |
349 ms |
14716 KB |
Output isn't correct - not an optimal way |