oj.uz

답안 #713746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713746 2023-03-23T02:09:59 Z LittleOrange 자동 인형 (IOI18_doll) C++17
2 / 100
 40 ms 6136 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]++, mxctr = max(mxctr,ctr[i-1]);
  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;
  }
  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:30:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
   30 |   while (A.size()<GN) A.push_back(-1);
      |          ~~~~~~~~^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2352 KB Output is correct
3 Correct 12 ms 1744 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 20 ms 2608 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2352 KB Output is correct
3 Correct 12 ms 1744 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 20 ms 2608 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 40 ms 6136 KB wrong motion
9 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 16 ms 2352 KB Output is correct
3 Correct 12 ms 1744 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 20 ms 2608 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 40 ms 6136 KB wrong motion
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB wrong motion
2 Halted 0 ms 0 KB -