oj.uz

Submission #1037778

# Submission time Handle Problem Language Result Execution time Memory
1037778 2024-07-29T08:15:50 Z Mr_Husanboy Mechanical Doll (IOI18_doll) C++17
37 / 100
 101 ms 13996 KB 
#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()

template<typename T>
int len(T &a){
  return a.size();
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


void create_circuit(int m, vector<int> a) {
  int n = a.size();
  vector<int> c(m + 1);
  a.push_back(0);
  c[0] = a[0];
  vector<vector<int>> pos(m + 1);
  for(int i = 0; i < n; i ++){
    pos[a[i]].push_back(i);
  }

  vector<int> x, y;

  auto addx = [&](int from, int to)->void{
    while(len(x) < -from) x.push_back(0);
    x[-from - 1] = to;
  };
  auto addy = [&](int from, int to)->void{
    while(len(y) < -from) y.push_back(0);
    y[-from - 1] = to;
  };

  for(int i = 1; i <= m; i ++){
    if(len(pos[i]) == 0) continue;

    int b = 32 - __builtin_clz(len(pos[i]) - 1);
    int cur = -len(x);
    c[i] = cur - 1;
    for(int j = 0; j < len(pos[i]) - 1; j ++){
      int x = 1;
      for(int bit = 0; bit < b; bit ++){
        if(j >> bit & 1){
          if(bit < b - 1){
            addy(cur - x, cur - (x * 2 + 1));
          }else{
            addy(cur - x, a[pos[i][j] + 1]);
          }
          x = x * 2 + 1;
        }else{
          if(bit < b - 1)
            addx(cur - x, cur - x * 2);
          else
            addx(cur - x, a[pos[i][j] + 1]);
          x *= 2;
        }
      }
    }
    for(int j = len(pos[i]) - 1; j < (1 << b) - 1; j ++){
      int x = 1;
      for(int bit = 0; bit < b; bit ++){
        if(j >> bit & 1){
          if(bit < b - 1){
            addy(cur - x, cur - (x * 2 + 1));
          }else{
            addy(cur - x, cur - 1);
          }
          x = x * 2 + 1;
        }else{
          if(bit < b - 1){
            addx(cur - x, cur - x * 2);
          }else
            addx(cur - x, cur - 1);
          x = x * 2;
        }
      }
    }
    int x = 1;
    for(int bit = 0; bit < b; bit ++){
      if(bit < b - 1){
        addy(cur - x, cur - (x * 2 + 1));
      }else addy(cur - x, a[pos[i].back() + 1]);
      x = x * 2 + 1;
    
    }
  }
  answer(c, x, y);

}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 36 ms 6088 KB Output is correct
3 Partially correct 81 ms 8144 KB Output is partially correct
4 Partially correct 64 ms 8772 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Output is partially correct
2 Correct 36 ms 6088 KB Output is correct
3 Partially correct 81 ms 8144 KB Output is partially correct
4 Partially correct 64 ms 8772 KB Output is partially correct
5 Partially correct 77 ms 12016 KB Output is partially correct
6 Partially correct 96 ms 12800 KB Output is partially correct
7 Partially correct 73 ms 12584 KB Output is partially correct
8 Partially correct 71 ms 12824 KB Output is partially correct
9 Partially correct 63 ms 8908 KB Output is partially correct
10 Partially correct 101 ms 13996 KB Output is partially correct
11 Partially correct 80 ms 13224 KB Output is partially correct
12 Partially correct 72 ms 8828 KB Output is partially correct
13 Partially correct 45 ms 8324 KB Output is partially correct
14 Partially correct 44 ms 8324 KB Output is partially correct
15 Partially correct 46 ms 8128 KB Output is partially correct
16 Partially correct 2 ms 604 KB Output is partially correct
17 Partially correct 39 ms 7032 KB Output is partially correct
18 Partially correct 41 ms 7300 KB Output is partially correct
19 Partially correct 47 ms 7676 KB Output is partially correct
20 Partially correct 57 ms 10000 KB Output is partially correct
21 Partially correct 68 ms 11704 KB Output is partially correct
22 Partially correct 62 ms 9284 KB Output is partially correct