oj.uz

Submission #925461

# Submission time Handle Problem Language Result Execution time Memory
925461 2024-02-11T16:49:02 Z anton Last supper (IOI12_supper) C++17
60 / 100
 390 ms 25996 KB 
#include<bits/stdc++.h>
using namespace std;


#define pii pair<int, int>
#include "advisor.h"

const int INF = 1e9;
void ComputeAdvice(int *C, int N, int K, int M) {

  vector<int> put_down;
  vector<vector<int>> oc;

  int log2 = 1;

  while((1<<log2)<N){
    log2++;
  }

  oc.resize(N);
  for(int i = 0; i<N; i++){
    oc[C[i]].push_back(i);
  }

  set<int> zeros;
  set<int> ones;

  for(int i = 0; i<N; i++){
    oc[i].push_back(INF);
    reverse(oc[i].begin(), oc[i].end());
    if(oc[i].size()==1 || (oc[i].size()==2 && i>=K)){
      zeros.insert(i);
    }
  }

  
  
  set<pii> cur_colors;
  for(int i = 0; i<K; i++){
    cur_colors.insert({oc[i].back(), i});
  }




  
  for(int i = 0; i<N; i++){
    
    int needed = C[i];
    if(cur_colors.find({oc[C[i]].back(), C[i]}) == cur_colors.end()){
      pii removing = *(--cur_colors.end());
      cur_colors.erase(removing);
      if(zeros.find(removing.second) == zeros.end()){
        put_down.push_back(removing.second);
      }
    }
    else{
      cur_colors.erase({oc[needed].back(), needed});
    }
    oc[needed].pop_back();
    cur_colors.insert({oc[needed].back(), needed});

    
  }

  vector<int> nz;
  
  map<int, int> non_zeros;

  for(int i = 0; i<N; i++){
    if(zeros.find(i) == zeros.end()){
      WriteAdvice(1);
      nz.push_back(i);
    }
    else{
      
      WriteAdvice(0);
    }
  }

  sort(nz.begin(), nz.end());
  for(int i = 0; i<nz.size(); i++)non_zeros[nz[i]] = i;

  for(auto e: put_down){
    for(int i = 0; i<log2; i++){
      WriteAdvice((non_zeros[e]&(1<<i))>>i);
    }
  }

}

#include<bits/stdc++.h>
using namespace std;


#define pii pair<int, int>

#include "assistant.h"

void Assist(unsigned char *A, int N, int K, int R) {
  int log2 = 1;

  while((1<<log2)<N){
    log2++;
  }
  set<int> cur_colors;
  for(int i = 0; i<K; i++){
    cur_colors.insert(i);
  }
  vector<int> put_down;
  set<int> zeros;
  vector<int> nz;
  
  map<int, int> non_zeros;
  for(int i = 0; i<N; i++){
    int val =A[i];
    if(val == 0){
      zeros.insert(i);
    }
    else{
      nz.push_back(i);
    }
  }
  sort(nz.begin(), nz.end());

  for(int i =N; i<R; i+=log2){
    int val = 0;
    for(int j = 0; j<log2; j++){
      val += A[j+i] * (1<<j);
    }
    put_down.push_back(nz[val]);
  }

  reverse(put_down.begin(), put_down.end());
  set<int> zeros_inside;

  for(int i = 0; i<K; i++){
    if(zeros.find(i)!=zeros.end()){
      zeros_inside.insert(i);
    }
  }
  for (int i = 0; i < N; i++) {
    int req = GetRequest();
    if(zeros_inside.size()>0 && cur_colors.find(req) == cur_colors.end()){
      //cout<<*zeros_inside.begin()<<endl;
      PutBack(*zeros_inside.begin());
      zeros_inside.erase(zeros_inside.begin());
  
    }
    else if(cur_colors.find(req) == cur_colors.end()){
      //cout<<put_down.back()<<endl;
      PutBack(put_down.back());
      cur_colors.erase(put_down.back());
      put_down.pop_back();
    }


    if(zeros.find(req) != zeros.end()){
      zeros_inside.insert(req);
    }
    else{
      cur_colors.insert(req);
    }
  }

}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:82:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |   for(int i = 0; i<nz.size(); i++)non_zeros[nz[i]] = i;
      |                  ~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 780 KB Output is correct
2 Correct 0 ms 796 KB Output is correct
3 Correct 2 ms 796 KB Output is correct
4 Correct 7 ms 1632 KB Output is correct
5 Correct 11 ms 1924 KB Output is correct
6 Correct 13 ms 1640 KB Output is correct
7 Correct 5 ms 1596 KB Output is correct
8 Correct 6 ms 1592 KB Output is correct
9 Correct 12 ms 1912 KB Output is correct
10 Correct 8 ms 1864 KB Output is correct
11 Correct 8 ms 1612 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2720 KB Output is correct
2 Correct 126 ms 10520 KB Output is correct
3 Correct 210 ms 20220 KB Output is correct
4 Correct 324 ms 21940 KB Output is correct
5 Correct 307 ms 20672 KB Output is correct
6 Correct 292 ms 19800 KB Output is correct
7 Correct 231 ms 19768 KB Output is correct
8 Correct 146 ms 16220 KB Output is correct
9 Correct 390 ms 25996 KB Output is correct
10 Correct 228 ms 20592 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 16408 KB Output is correct
2 Correct 228 ms 19912 KB Output is correct
3 Correct 227 ms 20236 KB Output is correct
4 Correct 228 ms 20260 KB Output is correct
5 Correct 215 ms 19608 KB Output is correct
6 Correct 224 ms 20244 KB Output is correct
7 Correct 232 ms 20496 KB Output is correct
8 Correct 156 ms 18784 KB Output is correct
9 Correct 173 ms 20160 KB Output is correct
10 Correct 250 ms 20304 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
34.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 19896 KB Output is partially correct - 431670 bits used
2 Correct 220 ms 19748 KB Output is partially correct - 406391 bits used
3 Correct 240 ms 20036 KB Output is partially correct - 393046 bits used
4 Correct 238 ms 20240 KB Output is partially correct - 394100 bits used
5 Correct 224 ms 20304 KB Output is partially correct - 397687 bits used
6 Correct 233 ms 20484 KB Output is partially correct - 396004 bits used
7 Correct 223 ms 20168 KB Output is partially correct - 395605 bits used
8 Correct 232 ms 20200 KB Output is partially correct - 393335 bits used
9 Correct 233 ms 19892 KB Output is partially correct - 395375 bits used
10 Correct 155 ms 18800 KB Output is correct - 132487 bits used