oj.uz

답안 #927125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927125 2024-02-14T09:49:34 Z GrindMachine 자동 인형 (IOI18_doll) C++17
18 / 100
 19 ms 2392 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "doll.h"

void create_circuit(int m, std::vector<int> a) {
    // int N = A.size();
    // std::vector<int> C(M + 1);
    // C[0] = -1;
    // for (int i = 1; i <= M; ++i) {
    //     C[i] = 1;
    // }
    // std::vector<int> X(N), Y(N);
    // for (int k = 0; k < N; ++k) {
    //     X[k] = Y[k] = A[k];
    // }
    // answer(C, X, Y);

    int n = sz(a);
    vector<int> b(m+1);
    b[0] = 1;
    b[1] = -1;

    int siz = 1;
    while(siz < n) siz <<= 1;

    ll chain_siz = __lg(siz);
    vector<int> sx(chain_siz+1), sy(chain_siz+1);

    rep1(i,chain_siz-1){
        sx[i] = -1;
        sy[i] = -(i+1);
    }
    sx[chain_siz] = -1;
    sy[chain_siz] = 0;
    
    rev(bit,chain_siz-1,0){
        if(!((n-1)&(1<<bit))) conts;
        if(bit){
            ll pos_on_chain = chain_siz-bit;
            ll ptr = sz(sx);
            sx.pb(0), sy.pb(0);
            sx[pos_on_chain] = -ptr;
            sx[ptr] = sy[ptr] = 1;
        }
        else{
            sx[chain_siz] = 1;
        }
    }

    sx.erase(sx.begin());
    sy.erase(sy.begin());
    answer(b,sx,sy);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 11 ms 1468 KB Output is correct
3 Correct 12 ms 1372 KB Output is correct
4 Correct 15 ms 1880 KB Output is correct

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 11 ms 1468 KB Output is correct
3 Correct 12 ms 1372 KB Output is correct
4 Correct 15 ms 1880 KB Output is correct
5 Incorrect 19 ms 2392 KB wrong motion
6 Halted 0 ms 0 KB -