oj.uz

Submission #547169

# Submission time Handle Problem Language Result Execution time Memory
547169 2022-04-09T18:21:23 Z AlexRex0 Last supper (IOI12_supper) C++14
0 / 100
 375 ms 19160 KB 
#include <bits/stdc++.h>
#include "advisor.h"
using namespace std;


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;

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];
    int pos = 0;
    for(int i = 1; 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;
    }
    int apariciones[100002];
    int sigAparicion[100002];
    int ultima[100002];
    for(int i = N; i >= 0; --i){
        apariciones[i] = INT_MAX;
        ultima[i] = INT_MAX;
    }
    for(int i = N; i >= 1; --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
    priority_queue<pair<int, int> > colaP;
    bool andamio[100002];
    for(int i = 0; i < N; ++i){
        if(i < K){
            andamio[i] = true;
            colaP.push({apariciones[i], ultima[i]});
        }else{
            andamio[i] = false;
        }
    }
    for(int i = 1; i <= N; ++i){
        int sigColor = GetRequest();
        if(!andamio[sigColor]){
            pair<int, int> aux;
            aux = colaP.top();
            colaP.pop();
            PutBack(aux.second);
            andamio[aux.second] = false;
            andamio[sigColor] = true;
            colaP.push({sigAparicion[i], sigColor});
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 3972 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 40 ms 5456 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 288 ms 16116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 18988 KB Execution killed with signal 11
2 Runtime error 346 ms 19116 KB Execution killed with signal 11
3 Runtime error 331 ms 19116 KB Execution killed with signal 11
4 Runtime error 323 ms 19032 KB Execution killed with signal 11
5 Runtime error 349 ms 19096 KB Execution killed with signal 11
6 Runtime error 321 ms 19036 KB Execution killed with signal 11
7 Runtime error 351 ms 19064 KB Execution killed with signal 11
8 Runtime error 318 ms 19156 KB Execution killed with signal 11
9 Runtime error 375 ms 19160 KB Execution killed with signal 11
10 Runtime error 321 ms 19148 KB Execution killed with signal 11