oj.uz

답안 #713740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713740 2023-03-23T01:38:01 Z LittleOrange 자동 인형 (IOI18_doll) C++17
47 / 100
 90 ms 9092 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] = -1;
  }
  if (N == 1){
    for (int i = 1; i <= M; ++i) C[i] = 0;
    vector<int> X,Y; 
    answer(C, X, Y);
    return;
  }
  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);
  answer(C, X, Y);
}

Compilation message

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

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 0 ms 212 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Correct 37 ms 5424 KB Output is correct
3 Partially correct 61 ms 8348 KB Output is partially correct
4 Partially correct 70 ms 8632 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 212 KB Output is partially correct
2 Correct 37 ms 5424 KB Output is correct
3 Partially correct 61 ms 8348 KB Output is partially correct
4 Partially correct 70 ms 8632 KB Output is partially correct
5 Partially correct 90 ms 9092 KB Output is partially correct
6 Partially correct 75 ms 8912 KB Output is partially correct
7 Partially correct 73 ms 8988 KB Output is partially correct
8 Partially correct 74 ms 8728 KB Output is partially correct
9 Partially correct 59 ms 8376 KB Output is partially correct
10 Partially correct 69 ms 8776 KB Output is partially correct
11 Partially correct 72 ms 8684 KB Output is partially correct
12 Partially correct 61 ms 8396 KB Output is partially correct
13 Correct 41 ms 6080 KB Output is correct
14 Partially correct 67 ms 8520 KB Output is partially correct
15 Partially correct 65 ms 8620 KB Output is partially correct
16 Partially correct 2 ms 596 KB Output is partially correct
17 Correct 39 ms 5748 KB Output is correct
18 Correct 37 ms 5636 KB Output is correct
19 Partially correct 61 ms 8264 KB Output is partially correct
20 Partially correct 71 ms 8628 KB Output is partially correct
21 Partially correct 71 ms 8604 KB Output is partially correct
22 Partially correct 72 ms 8656 KB Output is partially correct