oj.uz

Submission #363055

# Submission time Handle Problem Language Result Execution time Memory
363055 2021-02-05T03:40:58 Z casperwang Last supper (IOI12_supper) C++14
43 / 100
 357 ms 17340 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;

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

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(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 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(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: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:82:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   82 |       auto [_t, p] = seg.qry();
      |            ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3172 KB Output is correct
2 Correct 2 ms 3044 KB Output is correct
3 Correct 4 ms 3300 KB Output is correct
4 Correct 6 ms 3332 KB Output is correct
5 Correct 7 ms 3336 KB Output is correct
6 Correct 12 ms 3652 KB Output is correct
7 Correct 8 ms 3332 KB Output is correct
8 Correct 17 ms 3732 KB Output is correct
9 Correct 13 ms 3656 KB Output is correct
10 Correct 12 ms 3724 KB Output is correct
11 Correct 15 ms 3632 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 4112 KB Output is correct
2 Correct 106 ms 8100 KB Output is correct
3 Correct 319 ms 16672 KB Output is correct
4 Correct 219 ms 13172 KB Output is correct
5 Correct 314 ms 14828 KB Output is correct
6 Correct 332 ms 15536 KB Output is correct
7 Correct 284 ms 15004 KB Output is correct
8 Correct 302 ms 15088 KB Output is correct
9 Correct 144 ms 12308 KB Output is correct
10 Correct 254 ms 14452 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 12576 KB Output is correct
2 Correct 272 ms 14440 KB Output is correct
3 Correct 268 ms 14616 KB Output is correct
4 Correct 250 ms 14020 KB Output is correct
5 Correct 208 ms 13540 KB Output is correct
6 Correct 263 ms 14420 KB Output is correct
7 Correct 259 ms 14568 KB Output is correct
8 Correct 357 ms 17340 KB Output is correct
9 Correct 176 ms 12804 KB Output is correct
10 Correct 269 ms 14420 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
17.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 15032 KB Output is partially correct - 772365 bits used
2 Correct 272 ms 14972 KB Output is partially correct - 742095 bits used
3 Correct 269 ms 14704 KB Output is partially correct - 712470 bits used
4 Correct 271 ms 14872 KB Output is partially correct - 712005 bits used
5 Correct 279 ms 14636 KB Output is partially correct - 710610 bits used
6 Correct 268 ms 14988 KB Output is partially correct - 712155 bits used
7 Correct 268 ms 14664 KB Output is partially correct - 711090 bits used
8 Correct 267 ms 14688 KB Output is partially correct - 713340 bits used
9 Correct 263 ms 14616 KB Output is partially correct - 712830 bits used
10 Correct 350 ms 17228 KB Output is partially correct - 1117620 bits used