oj.uz

Submission #1023243

# Submission time Handle Problem Language Result Execution time Memory
1023243 2024-07-14T14:03:27 Z codefox Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
100 / 100
 2341 ms 24556 KB 
#pragma GCC target("popcnt")   
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>

using namespace std;

int ps[930];
bool done = true;

void init()
{
  int k = 0;
  for (int j = 30; j < (1<<12); j++)
  {
    if (__builtin_popcount(j)==6)
    {
      k++;
      ps[k] = j;
    }
  }
  done = false;
}

int encode(int n, int a, int b)
{
  if (done) init();
  for (int h = 0; h< 12; h++)
  {
    if ((ps[a]&(1<<h)) && ((ps[b]&(1<<h))==0)) return h+1;
  }
}
#pragma GCC target("popcnt")    
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>

using namespace std;

int ps[930];
bool done = true;

void init()
{
  int k = 0;
  for (int j = 30; j < (1<<12); j++)
  {
    if (__builtin_popcount(j)==6)
    {
      k++;
      ps[k] = j;
    }
  }
  done = false;
}

int decode(int n, int q, int h) 
{
  if (done) init();
  h--;
  if (ps[q]&(1<<h)) return true;
  return false;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
   31 | }
      | ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2341 ms 24556 KB Output is correct - maxh = 12
2 Correct 2146 ms 24492 KB Output is correct - maxh = 12