oj.uz

Submission #713749

# Submission time Handle Problem Language Result Execution time Memory
713749 2023-03-23T02:15:11 Z LittleOrange Mechanical Doll (IOI18_doll) C++17
49 / 100
 80 ms 9544 KB 
#include "doll.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
 
void create_circuit(int M, std::vector<int> A) {
  int N = A.size();
  std::vector<int> C(M + 1);
  C[0] = A[0];
  for (int i = 1; i <= M; ++i) C[i]=0;
  if (N == 1){
    for (int i = 1; i <= M; ++i) C[i] = 0;
    vector<int> X,Y; 
    answer(C, X, Y);
    return;
  }
  vector<ll> ctr(M);
  ll mxctr = 0;
  for(ll i : A) ctr[i-1]++;
  for(ll i : ctr) mxctr = max(mxctr,i);
  if (mxctr == 1){
    vector<int> X,Y;
    A.push_back(0);
    for(ll i = 0;i<N;i++) C[A[i]] = A[i+1];
    answer(C, X, Y);
    return;
  }
  for (int i = 1; i <= M; ++i) {
    C[i] = -1;
  }
  ll GN = 1<<(__lg(N-1)+1);
  while (A.size()<GN) A.push_back(-1);
  A.push_back(0);
  vector<int> X(GN-1),Y(GN-1);
  ll it = 0;
  function<ll(ll,ll,ll)> dfs;
  dfs = [&](ll cnt, ll st, ll lv){
    if (cnt==1){
        return A[st+1];
    }
    ll i = it++;
    X[i] = dfs(cnt-cnt/2,st,lv+1);
    Y[i] = dfs(cnt/2,st+(1<<lv),lv+1);
    return -1-i;
  };
  dfs(GN,0,0);
  if (it==0){
    for(ll &i : C) if (i==-1) i = 0;
  }
  answer(C, X, Y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:32:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
   32 |   while (A.size()<GN) A.push_back(-1);
      |          ~~~~~~~~^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2384 KB Output is correct
3 Correct 12 ms 1744 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 9 ms 1748 KB Output is correct
6 Correct 21 ms 2636 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2384 KB Output is correct
3 Correct 12 ms 1744 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 9 ms 1748 KB Output is correct
6 Correct 21 ms 2636 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 41 ms 6204 KB Output is correct
9 Incorrect 78 ms 9544 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2384 KB Output is correct
3 Correct 12 ms 1744 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 9 ms 1748 KB Output is correct
6 Correct 21 ms 2636 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 41 ms 6204 KB Output is correct
9 Incorrect 78 ms 9544 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Correct 35 ms 5028 KB Output is correct
3 Partially correct 61 ms 7988 KB Output is partially correct
4 Partially correct 66 ms 8236 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Correct 35 ms 5028 KB Output is correct
3 Partially correct 61 ms 7988 KB Output is partially correct
4 Partially correct 66 ms 8236 KB Output is partially correct
5 Partially correct 79 ms 8868 KB Output is partially correct
6 Partially correct 71 ms 8624 KB Output is partially correct
7 Partially correct 74 ms 8624 KB Output is partially correct
8 Partially correct 71 ms 8388 KB Output is partially correct
9 Partially correct 64 ms 8040 KB Output is partially correct
10 Partially correct 80 ms 8384 KB Output is partially correct
11 Partially correct 67 ms 8288 KB Output is partially correct
12 Partially correct 78 ms 8016 KB Output is partially correct
13 Correct 45 ms 5688 KB Output is correct
14 Partially correct 68 ms 8240 KB Output is partially correct
15 Partially correct 64 ms 8344 KB Output is partially correct
16 Partially correct 2 ms 596 KB Output is partially correct
17 Correct 39 ms 5292 KB Output is correct
18 Correct 44 ms 5244 KB Output is correct
19 Partially correct 68 ms 7976 KB Output is partially correct
20 Partially correct 72 ms 8244 KB Output is partially correct
21 Partially correct 71 ms 8260 KB Output is partially correct
22 Partially correct 68 ms 8248 KB Output is partially correct