oj.uz

답안 #547170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547170 2022-04-09T18:26:23 Z Leo121 최후의 만찬 (IOI12_supper) C++14
0 / 100
 406 ms 20344 KB 
#include <bits/stdc++.h>
#include "advisor.h"
#define forn(i, a, b) for(int i = int(a); i <= int(b); ++ i)
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
    int bits = log2(N);
    forn(i, 0, N - 1){
        forn(j, 0, bits){
            ((C[i] & (1 << j))) ? WriteAdvice(1) : WriteAdvice(0);
        }
    }
}


#include <bits/stdc++.h>
#include "assistant.h"
#define forn(i, a, b) for(int i = int(a); i <= int(b); ++ i)
using namespace std;
const int lim = 1e5;
bool cubeta[lim + 2];
int apu[lim + 2];
struct ura{
    int numero, sigaparicion;
    const bool operator < (const ura & a) const {
        if(sigaparicion == a.sigaparicion){
            return numero < a.numero;
        }
        return sigaparicion > a.sigaparicion;
    }
};
priority_queue<ura> pq;
priority_queue<ura> pqinv;
vector<int> pos[lim + 2];
void Assist(unsigned char *A, int N, int K, int R) {
    forn(i, 0, K - 1){
        cubeta[i] = 1;
    }
    forn(i, K, N - 1){
        cubeta[i] = 0;
    }
    forn(i, 0, N - 1){
        apu[i]= 0;
    }
    int bits = log2(N);
    int numero;
    forn(i, 0, N - 1){
        numero = 0;
        forn(j, 0, bits){
            if(A[(i * (bits + 1)) + j] == 1){
                numero |= (1 << j);
            }
        }
        pos[numero].push_back(i);
    }
    forn(i, 0, N - 1){
        pos[i].push_back(N);
    }
    forn(i, 0, K - 1){
        pq.push({i, pos[i][apu[i]]});
        pqinv.push({i, -1 * pos[i][apu[i]]});
    }
    int sig;
    ura aux;
    forn(i, 0, N - 1){
        sig = GetRequest();
        if(cubeta[sig]){
            continue;
        }
        cubeta[sig] = 1;
        while(!pqinv.empty()){
            aux = pqinv.top();
            if(cubeta[aux.numero]){
                if(-1 * aux.sigaparicion < i){
                    if(pos[aux.numero][apu[aux.numero]] == aux.sigaparicion){
                        apu[aux.numero] ++;
                        if(aux.sigaparicion != N){
                            pq.push({i, pos[aux.numero][apu[aux.numero]]});
                            pq.push({i, -1 * pos[aux.numero][apu[aux.numero]]});
                        }
                    }
                }
            }
            if(-1 * aux.sigaparicion >= i){
                break;
            }
            pqinv.pop();
        }
        aux = pq.top();
        PutBack(aux.numero);
        apu[aux.numero] ++;
        cubeta[aux.numero] = 0;
        pq.pop();
        if(pos[sig][apu[sig]] <= i){
            apu[sig] ++;
        }
        pq.push({sig, pos[sig][apu[sig]]});
        pqinv.push({sig, -1 * pos[sig][apu[sig]]});
    }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2948 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 4640 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 305 ms 16948 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2940 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 406 ms 20192 KB Output isn't correct - not an optimal way
2 Incorrect 369 ms 20168 KB Output isn't correct - not an optimal way
3 Incorrect 387 ms 20184 KB Output isn't correct - not an optimal way
4 Incorrect 376 ms 20216 KB Output isn't correct - not an optimal way
5 Incorrect 376 ms 20168 KB Output isn't correct - not an optimal way
6 Incorrect 385 ms 20192 KB Output isn't correct - not an optimal way
7 Incorrect 376 ms 20144 KB Output isn't correct - not an optimal way
8 Incorrect 386 ms 20344 KB Output isn't correct - not an optimal way
9 Incorrect 375 ms 20168 KB Output isn't correct - not an optimal way
10 Incorrect 376 ms 19972 KB Output isn't correct - not an optimal way