oj.uz

답안 #764241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764241 2023-06-23T09:22:23 Z t6twotwo 자동 인형 (IOI18_doll) C++17
63 / 100
 78 ms 9636 KB 
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> ord(int lg) {
    int N = 1 << lg;
    vector<int> ans(N), s(N);
    int x = 1, t = 0;
    while (1) {
        if (x >= N) {
            ans[x - N] = t++;
            if (x == 2 * N - 1) {
                break;
            }
            x = 1;
        } else {
            if (s[x] == 0) {
                s[x] = 1;
                x = x * 2;
            } else {
                s[x] = 0;
                x = x * 2 + 1;
            }
        }
    }
    return ans;
}
void create_circuit(int M, vector<int> A) {
    int N = A.size();
    vector<int> f(M + 1);
    for (int i = 0; i < N; i++) {
        f[A[i]]++;
    }
    if (*max_element(f.begin(), f.end()) <= 4) {
        vector<int> S1(M + 1), S2(M + 1), S3(M + 1);
        int K = 0;
        for (int i = 1; i <= M; i++) {
            if (f[i] == 2) {
                S1[i] = K++;
            } else if (f[i] > 2) {
                S1[i] = K++;
                S2[i] = K++;
                S3[i] = K++;
            }
        }
        vector<int> X(K), Y(K), C(M + 1);
        for (int i = 1; i <= M; i++) {
            if (f[i] > 1) {
                C[i] = ~S1[i];
                if (f[i] > 2) {
                    X[S1[i]] = ~S2[i];
                    Y[S1[i]] = ~S3[i];
                    if (f[i] == 3) {
                        Y[S2[i]] = ~S1[i];
                    }
                }
            }
        }
        C[0] = A[0];
        vector<int> cnt(M + 1);
        for (int i = 0; i < N; i++) {
            if (f[A[i]] == 1) {
                C[A[i]] = i + 1 < N ? A[i + 1] : 0;
            } else if (f[A[i]] == 2) {
                if (cnt[A[i]] == 0) {
                    X[S1[A[i]]] = A[i + 1];
                } else {
                    Y[S1[A[i]]] = i + 1 < N ? A[i + 1] : 0;
                }
            } else if (f[A[i]] == 3) {
                if (cnt[A[i]] == 0) {
                    X[S2[A[i]]] = A[i + 1];
                } else if (cnt[A[i]] == 1) {
                    X[S3[A[i]]] = A[i + 1];
                } else {
                    Y[S3[A[i]]] = i + 1 < N ? A[i + 1] : 0;
                }
            } else if (f[A[i]] == 4) {
                if (cnt[A[i]] == 0) {
                    X[S2[A[i]]] = A[i + 1];
                } else if (cnt[A[i]] == 1) {
                    X[S3[A[i]]] = A[i + 1];
                } else if (cnt[A[i]] == 2) {
                    Y[S2[A[i]]] = A[i + 1];
                } else {
                    Y[S3[A[i]]] = i + 1 < N ? A[i + 1] : 0;
                }
            }
            cnt[A[i]]++;
        }
        answer(C, X, Y);
        return;
    }
    int lg = __lg(N - 1) + 1;
    int K = 1 << lg;
    vector<int> C(M + 1, -1), X(K - 1, -1), Y(K - 1, -1);
    C[0] = A[0];
    for (int i = 0; i < (K / 2) - 1; i++) {
        X[i] = ~(2 * i + 1);
        Y[i] = ~(2 * i + 2);
    }
    auto a = ord(lg);
    for (int i = 0; i < K / 2; i++) {
        if (a[i * 2] < N - 1) {
            X[i + K / 2 - 1] = A[a[i * 2] + 1];
        }
        if (a[i * 2 + 1] < N - 1) {
            Y[i + K / 2 - 1] = A[a[i * 2 + 1] + 1];
        }
    }
    Y[K - 2] = 0;
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 14 ms 3924 KB Output is correct
3 Correct 11 ms 2900 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3412 KB Output is correct
6 Correct 16 ms 4180 KB Output is correct
7 Correct 1 ms 256 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 14 ms 3924 KB Output is correct
3 Correct 11 ms 2900 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3412 KB Output is correct
6 Correct 16 ms 4180 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 24 ms 4948 KB Output is correct
9 Correct 28 ms 5460 KB Output is correct
10 Correct 38 ms 7360 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 14 ms 3924 KB Output is correct
3 Correct 11 ms 2900 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 3412 KB Output is correct
6 Correct 16 ms 4180 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 24 ms 4948 KB Output is correct
9 Correct 28 ms 5460 KB Output is correct
10 Correct 38 ms 7360 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 49 ms 8660 KB Output is correct
15 Correct 27 ms 4692 KB Output is correct
16 Correct 42 ms 6868 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 45 ms 7876 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is partially correct
2 Correct 36 ms 4944 KB Output is correct
3 Partially correct 64 ms 8500 KB Output is partially correct
4 Partially correct 71 ms 9076 KB Output is partially correct

Subtask #6
28.0000000112 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Correct 36 ms 4944 KB Output is correct
3 Partially correct 64 ms 8500 KB Output is partially correct
4 Partially correct 71 ms 9076 KB Output is partially correct
5 Partially correct 78 ms 9636 KB Output is partially correct
6 Partially correct 73 ms 9348 KB Output is partially correct
7 Partially correct 78 ms 9544 KB Output is partially correct
8 Partially correct 73 ms 9148 KB Output is partially correct
9 Partially correct 64 ms 8524 KB Output is partially correct
10 Partially correct 78 ms 9108 KB Output is partially correct
11 Partially correct 70 ms 9068 KB Output is partially correct
12 Partially correct 65 ms 8400 KB Output is partially correct
13 Correct 39 ms 5044 KB Output is correct
14 Partially correct 72 ms 8804 KB Output is partially correct
15 Partially correct 72 ms 8904 KB Output is partially correct
16 Partially correct 2 ms 596 KB Output is partially correct
17 Correct 37 ms 4832 KB Output is correct
18 Correct 38 ms 4940 KB Output is correct
19 Partially correct 69 ms 8572 KB Output is partially correct
20 Partially correct 72 ms 9088 KB Output is partially correct
21 Partially correct 71 ms 9040 KB Output is partially correct
22 Partially correct 71 ms 9052 KB Output is partially correct