oj.uz

답안 #363010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363010 2021-02-05T02:34:35 Z casperwang 최후의 만찬 (IOI12_supper) C++14
8 / 100
 305 ms 16056 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;
const int P = 13;
vector <int> nxt[MAXN+1];
vector <int> cur;
vector <int> pos;
vector <int> id;

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) {
  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;
}

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);
  for (int i = 0; i < N; 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(pos[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;
const int P = 13;
vector <int> id;

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

int fnd(unsigned char *A, int a) {
  int st = a * P, num = 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++);
      PutBack(num);
      id[req] = id[num];
      id[num] = -1;
    }
  }
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3232 KB Output is correct
2 Correct 2 ms 3044 KB Output is correct
3 Correct 4 ms 3300 KB Output is correct
4 Correct 9 ms 3368 KB Output is correct
5 Correct 20 ms 3836 KB Output is correct
6 Correct 17 ms 3740 KB Output is correct
7 Correct 7 ms 3500 KB Output is correct
8 Correct 17 ms 3812 KB Output is correct
9 Correct 18 ms 3632 KB Output is correct
10 Correct 11 ms 3500 KB Output is correct
11 Correct 13 ms 3728 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 4124 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 198 ms 11956 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 268 ms 14548 KB Error - Putting back a color that is not on the scaffold
2 Incorrect 260 ms 14092 KB Error - Putting back a color that is not on the scaffold
3 Incorrect 238 ms 13932 KB Error - Putting back a color that is not on the scaffold
4 Incorrect 252 ms 13892 KB Error - Putting back a color that is not on the scaffold
5 Incorrect 240 ms 14140 KB Error - Putting back a color that is not on the scaffold
6 Incorrect 234 ms 14132 KB Error - Putting back a color that is not on the scaffold
7 Incorrect 241 ms 13936 KB Error - Putting back a color that is not on the scaffold
8 Incorrect 232 ms 13932 KB Error - Putting back a color that is not on the scaffold
9 Incorrect 234 ms 13720 KB Error - Putting back a color that is not on the scaffold
10 Incorrect 305 ms 16056 KB Error - Putting back a color that is not on the scaffold