oj.uz

답안 #363103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363103 2021-02-05T04:53:25 Z casperwang 최후의 만찬 (IOI12_supper) C++14
0 / 100
 408 ms 21824 KB 
#include <bits/stdc++.h>
#include "advisor.h"
#define pb emplace_back
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 100000;
int P;
vector <int> nxt[MAXN+1];
vector <int> cur;
vector <int> pos;
vector <int> id;
set <int> appr;

class Seg {
private:
  pii arr[MAXN*4+5];
  void pull(int now) {
    arr[now] = max(arr[now*2], arr[now*2+1]);
  }
public:
  void build(int now, int l, int r) {
    if (l == r) {
      arr[now] = pii(*nxt[l].begin(), l);
      return;
    }
    int mid = l + r >> 1;
    build(now*2  , l, mid);
    build(now*2+1,mid+1,r);
    pull(now);
    return;
  }
  void mdy(int p, int id, int now, int l, int r) {
    if (l == p && r == p) {
      arr[now] = pii(nxt[id][cur[id]], l);
      return;
    } else if (l > p || r < p) return;
    int mid = l + r >> 1;
    mdy(p, id, now*2  , l, mid);
    mdy(p, id, now*2+1,mid+1,r);
    pull(now);
    return;
  }
  pii qry() {
    return arr[1];
  }
} seg;

void init(int *C, int N, int K, int M) {
  P = __lg(K)+1;
  id.resize(N);
  cur.resize(N);
  pos.resize(K);
  for (int i = 0; i < N; i++) nxt[C[i]].pb(i);
  for (int i = 0; i < N; i++) nxt[i].pb(N);
  for (int i = 0; i < K; i++) pos[i] = i, id[i] = i;
  for (int i = K; i < N; i++) id[i] = -1;
  appr.clear();
}

void Write(int num) {
  for (int i = 0; i < P; i++) {
    if ((1<<i) & num)
      WriteAdvice(1);
    else
      WriteAdvice(0);
  }
}

void ComputeAdvice(int *C, int N, int K, int M) {
  init(C, N, K, M);
  seg.build(1, 0, K-1);
  int stp = N;
  for (int i = N-1; i >= 0; i--) {
    if (appr.count(C[i])) {
      stp = i+1;
      break;
    }
    appr.insert(C[i]);
  }
  for (int i = 0; i < stp; i++) {
    cur[C[i]]++;
    if (id[C[i]] != -1) {
      seg.mdy(id[C[i]], C[i], 1, 0, K-1);
    } else {
      auto [_t, p] = seg.qry();
      Write(p);
      id[pos[p]] = -1;
      id[C[i]] = p;
      pos[p] = C[i];
      seg.mdy(p, C[i], 1, 0, K-1);
    }
  }
}

#include <bits/stdc++.h>
#include "assistant.h"
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 100000;
int P;
vector <int> id;
vector <int> pos;

void init(int N, int K, int M) {
  P = __lg(K)+1;
  id.resize(N);
  pos.resize(K);
  for (int i = 0; i < K; i++) id[i] = i, pos[i] = i;
  for (int i = K; i < N; i++) id[i] = -1;
}

int fnd(unsigned char *A, int a, int R) {
  int st = a * P, num = 0;
  if (st > R) return 0;
  for (int i = st; i < st + P; i++) {
    if ((int)A[i]) num += (1<<(i-st));
  }
  return num;
}

void Assist(unsigned char *A, int N, int K, int R) {
  init(N, K, R);
  int now = 0;
  for (int i = 0; i < N; i++) {
    int req = GetRequest();
    if (id[req] == -1) {
      int num = fnd(A, now++, R);
      PutBack(pos[num]);
      id[req] = id[pos[num]];
      id[pos[num]] = -1;
      pos[num] = req;
    }
  }
}

Compilation message

advisor.cpp: In member function 'void Seg::build(int, int, int)':
advisor.cpp:33:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |     int mid = l + r >> 1;
      |               ~~^~~
advisor.cpp: In member function 'void Seg::mdy(int, int, int, int, int)':
advisor.cpp:44:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |     int mid = l + r >> 1;
      |               ~~^~~
advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:92:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   92 |       auto [_t, p] = seg.qry();
      |            ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 3968 KB Output is correct
2 Correct 101 ms 8124 KB Output is correct
3 Incorrect 148 ms 15688 KB Output isn't correct - not an optimal way
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 12408 KB Output is correct
2 Correct 269 ms 14584 KB Output is correct
3 Correct 269 ms 14640 KB Output is correct
4 Correct 249 ms 14288 KB Output is correct
5 Correct 206 ms 13160 KB Output is correct
6 Correct 276 ms 14816 KB Output is correct
7 Correct 259 ms 14344 KB Output is correct
8 Correct 408 ms 21824 KB Output is correct
9 Incorrect 170 ms 13816 KB Output isn't correct - not an optimal way
10 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 286 ms 14920 KB Output is partially correct - 769275 bits used
2 Correct 274 ms 14832 KB Output is partially correct - 740820 bits used
3 Correct 270 ms 14600 KB Output is partially correct - 711405 bits used
4 Correct 266 ms 14608 KB Output is partially correct - 711900 bits used
5 Correct 268 ms 14596 KB Output is partially correct - 709410 bits used
6 Correct 270 ms 14416 KB Output is partially correct - 709110 bits used
7 Correct 276 ms 14600 KB Output is partially correct - 709695 bits used
8 Correct 265 ms 14548 KB Output is partially correct - 711345 bits used
9 Correct 268 ms 14420 KB Output is partially correct - 712485 bits used
10 Incorrect 123 ms 15084 KB Output isn't correct - not an optimal way