oj.uz

Submission #805438

# Submission time Handle Problem Language Result Execution time Memory
805438 2023-08-03T16:39:19 Z aymanrs Last supper (IOI12_supper) C++14
65 / 100
 100 ms 10804 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "advisor.h"
using namespace std;
using namespace __gnu_pbds;
using Set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
void ComputeAdvice(int *C, int N, int K, int M) {
  set<pair<int, int>> q;
  int s[N], nx[N];
  bool f[N] = {false};
  fill(s, s+N, N);
  int c[N];
  for(int i = N-1;i >= 0;i--) {
    nx[i] = s[C[i]];
    s[C[i]] = i;
  }
  int sz = 0;
  Set pbd;
  vector<int> bad;
  for(int i = 0;i < K;i++){
    WriteAdvice(s[i] != N);
    if(s[i] != N) {
      sz++;
      pbd.insert(i);
      q.insert({s[i], i});
    } else {
      bad.push_back(i);
    }
    f[i] = true;
    c[i] = i;
  }
  for(int i = 0;i < N-1;i++){
    if(f[C[i]]) {
      int ind = q.begin()->second;
      q.erase(q.begin());
      WriteAdvice(nx[i] != N);
      if(nx[i] == N) {
        sz--;
        bad.push_back(ind);
        pbd.erase(pbd.find(ind));
      }
      else {
        q.insert({nx[i], ind});
      }
      continue;
    }
    if(!bad.empty()){
      int ind = bad.back();
      bad.pop_back();
      WriteAdvice(nx[i] != N);
      if(nx[i] != N) {
        sz++;
        pbd.insert(ind);
        q.insert({nx[i], ind});
      } else bad.push_back(ind);
      f[c[ind]] = false;
      f[C[i]] = true;
      c[ind] = C[i];
      continue;
    }
    int ind = q.rbegin()->second;
    int L = log2(sz-1) + 1;
    int pind = pbd.order_of_key(ind);
    for(int b = 0;b < L;b++) WriteAdvice(1&(pind>>b));
    WriteAdvice(nx[i] != N);
    q.erase(prev(q.end()));
    if(nx[i] == N) {
      sz--;
      pbd.erase(pbd.find(ind));
      bad.emplace_back(ind);
    }
    else q.insert({nx[i], ind});
    f[c[ind]] = false;
    f[C[i]] = true;
    c[ind] = C[i];
  }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "assistant.h"
using namespace std;
using namespace __gnu_pbds;
using Set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
void Assist(unsigned char *A, int N, int K, int R) {
  int c[N], indo[N];
  bool f[N] = {false};
  int cur = 0, sz = 0;
  Set pbd;
  vector<pair<int, int>> bad;
  for(int i = 0;i < K;i++){
    f[i] = true;
    c[i] = i;
    indo[i] = i;
    if(A[cur++]){
      sz++;
      pbd.insert(i);
    } else bad.emplace_back(i, i);
  }
  for(int i = 0;i < N-1;i++){
    int r = GetRequest();
    if(f[r]) {
      if(!A[cur++]){
        sz--;
        pbd.erase(pbd.find(indo[r]));
        bad.emplace_back(r, indo[r]);
      }
      continue;
    }
    if(!bad.empty()){
      PutBack(bad.back().first);
      int ind = bad.back().second;
      f[r] = true;
      f[bad.back().first] = false;
      indo[r] = ind;
      c[ind] = r;
      bad.pop_back();
      if(A[cur++]) {
        sz++;
        pbd.insert(ind);
      } else bad.emplace_back(r, ind);
      continue;
    }
    int pind = 0, L = log2(sz-1)+1;
    for(int b = 0;b < L;b++) {
      if(A[cur]) pind |= 1 << b;
      cur++;
    }
    int ind = *pbd.find_by_order(pind);
    PutBack(c[ind]);
    f[r] = true;
    f[c[ind]] = false;
    c[ind] = r;
    indo[r] = ind;
    if(!A[cur++]){
      sz--;
      pbd.erase(pbd.find(ind));
      bad.emplace_back(r, ind);
    }
  }
  int r = GetRequest();
  if(f[r]) return;
  for(int i = 0;i < N;i++) if(f[i]) {
    PutBack(i);
    return;
  }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 508 KB Output is correct
2 Correct 2 ms 516 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 3 ms 800 KB Output is correct
5 Correct 3 ms 796 KB Output is correct
6 Correct 5 ms 772 KB Output is correct
7 Correct 3 ms 924 KB Output is correct
8 Correct 3 ms 936 KB Output is correct
9 Correct 5 ms 996 KB Output is correct
10 Correct 5 ms 988 KB Output is correct
11 Correct 4 ms 924 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1364 KB Output is correct
2 Correct 46 ms 4296 KB Output is correct
3 Correct 96 ms 10804 KB Output is correct
4 Correct 74 ms 6488 KB Output is correct
5 Correct 87 ms 7016 KB Output is correct
6 Correct 84 ms 7320 KB Output is correct
7 Correct 82 ms 8408 KB Output is correct
8 Correct 70 ms 8544 KB Output is correct
9 Correct 95 ms 7284 KB Output is correct
10 Correct 100 ms 9272 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 7424 KB Output is correct
2 Correct 84 ms 8852 KB Output is correct
3 Correct 84 ms 8880 KB Output is correct
4 Correct 86 ms 8940 KB Output is correct
5 Correct 85 ms 8660 KB Output is correct
6 Correct 83 ms 8852 KB Output is correct
7 Correct 84 ms 9096 KB Output is correct
8 Correct 73 ms 9540 KB Output is correct
9 Correct 76 ms 9348 KB Output is correct
10 Correct 84 ms 8984 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1012 KB Output is correct
2 Correct 3 ms 1020 KB Output is correct
3 Incorrect 1 ms 648 KB Error - advice is too long
4 Halted 0 ms 0 KB -

Subtask #5
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 8832 KB Output is correct - 131759 bits used
2 Correct 82 ms 8932 KB Output is correct - 121999 bits used
3 Correct 83 ms 8876 KB Output is correct - 124999 bits used
4 Correct 83 ms 8992 KB Output is correct - 124999 bits used
5 Correct 86 ms 8948 KB Output is correct - 124999 bits used
6 Correct 87 ms 8860 KB Output is correct - 124999 bits used
7 Correct 82 ms 8900 KB Output is correct - 124827 bits used
8 Correct 83 ms 8948 KB Output is correct - 124909 bits used
9 Correct 93 ms 8984 KB Output is correct - 124999 bits used
10 Correct 71 ms 8728 KB Output is correct - 139339 bits used