oj.uz

답안 #764221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764221 2023-06-23T08:50:20 Z t6twotwo 자동 인형 (IOI18_doll) C++17
35 / 100
 100 ms 9220 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();
    if (M == 1) {
        int lg = __lg(N - 1) + 1;
        int K = 1 << lg;
        vector<int> C{1, -1}, X(K - 1, -1), Y(K - 1, -1);
        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] = 1;
            }
            if (a[i * 2 + 1] < N - 1) {
                Y[i + K / 2 - 1] = 1;
            }
        }
        Y[K - 2] = 0;
        answer(C, X, Y);
        return;
    }
    if (N == 16) {
        vector<int> C(M + 1, -1), X(15), Y(15);
        for (int i = 0; i < 7; i++) {
            X[i] = ~(2 * i + 1);
            Y[i] = ~(2 * i + 2);
        }
        C[0] = A[0];
        auto a = ord(4);
        for (int i = 0; i < 8; i++) {
            X[i + 7] = A[a[i * 2] + 1];
            Y[i + 7] = i == 7 ? 0 : A[a[i * 2 + 1] + 1];
        }
        answer(C, X, Y);
        return;
    }
    vector<int> f(M + 1);
    for (int i = 0; i < N; i++) {
        f[A[i]]++;
    }
    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);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 14 ms 4052 KB Output is correct
3 Correct 15 ms 3004 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 17 ms 4308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 14 ms 4052 KB Output is correct
3 Correct 15 ms 3004 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 17 ms 4308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 41 ms 4972 KB Output is correct
9 Correct 28 ms 5552 KB Output is correct
10 Correct 49 ms 7372 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 1 ms 304 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 14 ms 4052 KB Output is correct
3 Correct 15 ms 3004 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 1364 KB Output is correct
6 Correct 17 ms 4308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 41 ms 4972 KB Output is correct
9 Correct 28 ms 5552 KB Output is correct
10 Correct 49 ms 7372 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 50 ms 8764 KB Output is correct
15 Correct 28 ms 4812 KB Output is correct
16 Correct 42 ms 6972 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 47 ms 7984 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #5
9.0000000036 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 296 KB Output is partially correct
2 Correct 37 ms 5084 KB Output is correct
3 Partially correct 63 ms 8712 KB Output is partially correct
4 Partially correct 100 ms 9220 KB Output is partially correct

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 296 KB Output is partially correct
2 Correct 37 ms 5084 KB Output is correct
3 Partially correct 63 ms 8712 KB Output is partially correct
4 Partially correct 100 ms 9220 KB Output is partially correct
5 Incorrect 35 ms 6124 KB wrong motion
6 Halted 0 ms 0 KB -