oj.uz

답안 #860442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860442 2023-10-13T02:35:27 Z nguyentunglam 최후의 만찬 (IOI12_supper) C++17
0 / 100
 311 ms 19236 KB 
#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
  int T = log2(N) + 1;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < T; j++) WriteAdvice(C[i] >> j & 1);
  }
}

#include "assistant.h"

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;

int query[N];

bool chosen[N];

vector<int> nxt[N];

void Assist(unsigned char *A, int N, int K, int R) {
  int T = log2(N) + 1;
  int cnt = 0;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < T; j++) {
      if (int(A[cnt])) query[i] |= (1 << j);
      cnt++;
    }
  }

  for(int i = N - 1; i >= 0; i--) nxt[query[i]].push_back(i);

  priority_queue<pair<int, int> > Q;
  for(int i = 0; i < K; i++) {
    int tmp = nxt[i].empty() ? N : nxt[i].back();
    Q.push({tmp, i});
    chosen[i] = 1;
  }

  for(int i = 0; i < N; i++) {
    GetRequest();
    int x = query[i];
    if (chosen[x] == 0) {
      if (Q.empty()) return;
      int useless, j; tie(useless, j) = Q.top(); Q.pop();
      chosen[j] = 0;
      PutBack(j);

      chosen[x] = 1;
//      if (nxt[x].empty()) return;
//      nxt[x].pop_back();
//      int tmp = nxt[x].empty() ? N : nxt[i].back();
      Q.push({N, x});
    }
  }
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 219 ms 15068 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 3080 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 274 ms 18084 KB Output isn't correct - not an optimal way
2 Incorrect 271 ms 18096 KB Output isn't correct - not an optimal way
3 Incorrect 274 ms 18136 KB Output isn't correct - not an optimal way
4 Incorrect 272 ms 18176 KB Output isn't correct - not an optimal way
5 Incorrect 311 ms 18480 KB Output isn't correct - not an optimal way
6 Incorrect 272 ms 18160 KB Output isn't correct - not an optimal way
7 Incorrect 282 ms 18384 KB Output isn't correct - not an optimal way
8 Incorrect 285 ms 18044 KB Output isn't correct - not an optimal way
9 Incorrect 281 ms 18248 KB Output isn't correct - not an optimal way
10 Incorrect 271 ms 19236 KB Output isn't correct - not an optimal way