oj.uz

답안 #1018772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018772 2024-07-10T09:38:13 Z ProtonDecay314 자동 인형 (IOI18_doll) C++17
6 / 100
 58 ms 12992 KB 
// AM+DG

/*

*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
#define L(i, varmn, varmx) for(ll i = varmn; i < varmx; i++)
#define LR(i, varmx, varmn) for(ll i = varmx; i > varmn; i--)
#define LI(i, varmn, varmx) for(int i = varmn; i < varmx; i++)
#define LIR(i, varmx, varmn) for(int i = varmx; i > varmn; i--)
#define pb push_back
#include "doll.h"

struct pot_switch {
    int id;
    int x;
    int y;
};

void construct_switches(int base_switch_num, const vi& to_connect, int p2, int offset, int size, vector<pot_switch>& switches_to_construct) {

    if(size == 2) {
        // Handle the special case here
        switches_to_construct.pb({base_switch_num - offset, to_connect[p2 + offset - ((p2 << 1) - 1)], to_connect[(p2 << 1) + offset - ((p2 << 1) - 1)]});
    } else if(size == 3) {
        // Handle the special case here
        switches_to_construct.pb({base_switch_num - offset, base_switch_num - (offset + p2), to_connect[(p2 << 1) + offset - ((p2 << 1) - 1)]});

        // Recurse towards the first child
        construct_switches(base_switch_num, to_connect, p2 << 1, offset + p2, size - (size >> 1), switches_to_construct);
    } else {
        // Recursive case
        switches_to_construct.pb({base_switch_num - offset, base_switch_num - (offset + p2), base_switch_num - (offset + (p2 << 1))});

        // Recurse left
        construct_switches(base_switch_num, to_connect, p2 << 1, offset + p2, size - (size >> 1), switches_to_construct);

        // Recurse right
        construct_switches(base_switch_num, to_connect, p2 << 1, offset + (p2 << 1), (size >> 1), switches_to_construct);
    }
}

void create_circuit(int m, std::vector<int> a) {
    int n = a.size();
    vi c(m + 1);
    c[0] = -1;
    for (int i = 1; i <= m; ++i) {
        c[i] = 1;
    }
    // vi x(N), y(N);
    // for (int k = 0; k < N; ++k) {
    //     x[k] = y[k] = a[k];
    // }

    vi x;
    vi y;

    vvi adjmat;

    LI(i, 0, m + 1) {
        vi adjmatr;
        adjmat.pb(adjmatr);
    }

    LI(i, -1, n) {
        if(i == -1) {
            adjmat[0].pb(a[i + 1]);
        } else if(i == n - 1) {
            adjmat[a[i]].pb(0);
        } else {
            adjmat[a[i]].pb(a[i + 1]);
        }
    }

    int last_switch = 0;
    LI(i, 0, m + 1) {
        int cur_num_next = adjmat[i].size();
        if(cur_num_next == 0) {
            c[i] = 0;
        } else if(cur_num_next == 1) {
            c[i] = adjmat[i][0];
        } else {
            /*
            Construct switches needs...
            whatever the last switch was,
            the list of things it should connect the leaf node to
            the current power of two separation (starts at 1 and doubles)
            the current offset (starts at 0)
            for the left tree, it increments by power * 1
            for the right, its power * 2
            Left tree must be of size ceil(N / 2)
            right is size floor(N / 2)

            */

            c[i] = last_switch - 1;

            vector<pot_switch> switches_to_construct;
            construct_switches(last_switch - 1, adjmat[i], 1, 0, cur_num_next, switches_to_construct);
            sort(switches_to_construct.begin(), switches_to_construct.end(), [](pot_switch s1, pot_switch s2) {return s1.id > s2.id;}); // Sort by decreasing ID
            LI(i, 0, cur_num_next - 1) {
                x.pb(switches_to_construct[i].x);
                y.pb(switches_to_construct[i].y);
            }
            last_switch -= cur_num_next - 1;
        }
    }

    answer(c, x, y);

    return;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 6896 KB Output is correct
3 Correct 17 ms 5532 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 5072 KB Output is correct
6 Correct 24 ms 8480 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 6896 KB Output is correct
3 Correct 17 ms 5532 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 5072 KB Output is correct
6 Correct 24 ms 8480 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 58 ms 8220 KB Output is correct
9 Correct 57 ms 10176 KB Output is correct
10 Correct 45 ms 12992 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 6896 KB Output is correct
3 Correct 17 ms 5532 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 5072 KB Output is correct
6 Correct 24 ms 8480 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 58 ms 8220 KB Output is correct
9 Correct 57 ms 10176 KB Output is correct
10 Correct 45 ms 12992 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 55 ms 10980 KB state 'Y'
15 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB state 'Y'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB state 'Y'
2 Halted 0 ms 0 KB -