oj.uz

답안 #839067

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839067 2023-08-28T14:57:17 Z beaconmc 자동 인형 (IOI18_doll) C++14
0 / 100
 0 ms 212 KB 
#include "doll.h"
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

typedef int ll;
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)





vector<ll> binorder(ll n){
  if (n==0) return {0};
  vector<ll> ans;
  vector<ll> sus = binorder(n-1);
  for (auto&i : sus){
    ans.push_back(i*2);
  }
  for (auto&i : sus){
    ans.push_back(i*2 + 1);
  }
  return ans;
}



void create_circuit(int M, vector<int> A) {
  ll offset = 0;
  ll N = A.size();

  reverse(A.begin(), A.end());


  vector<ll> X;
  vector<ll> Y;


  FORNEG(i, 30, -1){
    if (N&(1<<i)){

      N -= (1<<i);

      vector<ll> things;
      vector<ll> order = binorder(i);


      FOR(j,0,(1<<i)){
        things.push_back(A[A.size()-1]);
        A.pop_back();
      }


      if (i==0){
        X.push_back(offset+1);
        Y.push_back(things[0]);
        continue;
      }


      FOR(j, 1, (1<<(i))){
        X.push_back(-(j*2+offset));
        Y.push_back(-(j*2+1+offset));
      }

      ll shit = 0;
      FOR(j,(1<<(i)), (1<<(i+1))){

        Y.push_back(-1);
        X.push_back(things[order[shit++]]);
      }
    }
  }



  vector<ll> ans;
  ans.push_back(-1);
  FOR(i, 1, M+1){
    ans.push_back(-1);
  }
  // for (auto&i : ans){
  //   cout << i << " ";
  // }cout << endl;
  // for (auto&i : X){
  //   cout << i << " ";

  // }cout << endl;

  // for (auto&i : Y){
  //   cout << i << " ";

  // }cout << endl;
  Y[Y.size()-1] = 0;

  answer(ans, X, Y);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0.0 / 18.0

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

Subtask #6
0.0 / 56.0

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