oj.uz

답안 #1021997

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021997 2024-07-13T08:47:12 Z ZanP 자동 인형 (IOI18_doll) C++17
85.553 / 100
 73 ms 17180 KB 
#include "doll.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
struct xyswitch {
    int x, y;
    bool gox = true;
    xyswitch() {}
    xyswitch(int x, int y) { this->x = x; this->y = y; }
};
void answer(vector<int> C, vector<int> X, vector<int> Y);
vector<xyswitch> xyswitches;

void make_switches(int m, int filler, int base_switch) {
    int f1 = min(filler, (m + filler) / 2), f2 = filler - f1;
    int s1 = ((m + filler) / 2) - f1, s2 = ((m + filler) / 2) - f2;

    xyswitches.push_back(xyswitch());
    int sn = xyswitches.size() - 1;
    if (s1 == 0) { xyswitches[sn].x = -base_switch; }
    else if (s1 == 1 && f1 == 0) {
        xyswitches[sn].x = 0;
    }
    else {
        xyswitches[sn].x = -((int)xyswitches.size() + 1);
        make_switches(s1, f1, base_switch);
    }

    if (s2 == 1 && f2 == 0) {
        xyswitches[sn].y = 0;
    }
    else {
        xyswitches[sn].y = -((int)xyswitches.size() + 1);
        make_switches(s2, f2, base_switch);
    }
}

void connect(int val, int swid)
{
    xyswitch & sw = xyswitches[-(swid)-1];
    if (sw.gox)
    {
        sw.gox = !sw.gox;
        if (sw.x == 0) { sw.x = val; }
        else { connect(val, sw.x); }
    }
    else
    {
        sw.gox = !sw.gox;
        if (sw.y == 0) { sw.y = val; }
        else { connect(val, sw.y); }
    }
}


    

void create_circuit(int M, std::vector<int> A) {
    int n = A.size();
    vector<vector<int>> repetitions;
    repetitions.resize(M+1);
    vector<int> c(M+1,0);
    for (int i = 0; i < n - 1; i++) {
        repetitions[A[i]].push_back(A[i + 1]);
    }
    repetitions[A[n - 1]].push_back(0);

    for (int i = 1; i <= M; i++)
    {
        int m = repetitions[i].size(), mxtwo = 1;
        while (mxtwo < m) { mxtwo *= 2; }
        if (m == 0) { continue; }
        if (m == 1) {
            c[i] = repetitions[i][0];
        }
        else {
            c[i] = -(int)xyswitches.size() - 1;
            make_switches(repetitions[i].size(), mxtwo - m, xyswitches.size() + 1);
            for (int j = 0; j < repetitions[i].size(); j++) {
                connect(repetitions[i][j], c[i]);
            }
        }
    }
    int s = xyswitches.size();
    vector<int> x(s), y(s);
    c[0] = A[0];
    for (int i = 0; i < s; i++) {
        x[i] = xyswitches[i].x;
        y[i] = xyswitches[i].y;
    }
    answer(c, x, y);
}

Compilation message

doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:81:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for (int j = 0; j < repetitions[i].size(); j++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 17 ms 6492 KB Output is correct
3 Correct 14 ms 5208 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 21 ms 7772 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 17 ms 6492 KB Output is correct
3 Correct 14 ms 5208 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 21 ms 7772 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 32 ms 8148 KB Output is correct
9 Correct 32 ms 9168 KB Output is correct
10 Correct 47 ms 11988 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 17 ms 6492 KB Output is correct
3 Correct 14 ms 5208 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 21 ms 7772 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 32 ms 8148 KB Output is correct
9 Correct 32 ms 9168 KB Output is correct
10 Correct 47 ms 11988 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 73 ms 14728 KB Output is correct
15 Correct 30 ms 7888 KB Output is correct
16 Correct 49 ms 12124 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 51 ms 14432 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 44 ms 7500 KB Output is correct
3 Correct 59 ms 7604 KB Output is correct
4 Correct 71 ms 11424 KB Output is correct

Subtask #6
41.5530038336 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 44 ms 7500 KB Output is correct
3 Correct 59 ms 7604 KB Output is correct
4 Correct 71 ms 11424 KB Output is correct
5 Partially correct 64 ms 17000 KB Output is partially correct
6 Partially correct 62 ms 17052 KB Output is partially correct
7 Partially correct 59 ms 17180 KB Output is partially correct
8 Partially correct 55 ms 16028 KB Output is partially correct
9 Partially correct 43 ms 8564 KB Output is partially correct
10 Partially correct 64 ms 13680 KB Output is partially correct
11 Partially correct 47 ms 14008 KB Output is partially correct
12 Partially correct 32 ms 9876 KB Output is partially correct
13 Partially correct 40 ms 11876 KB Output is partially correct
14 Partially correct 45 ms 11604 KB Output is partially correct
15 Partially correct 41 ms 11340 KB Output is partially correct
16 Partially correct 1 ms 604 KB Output is partially correct
17 Partially correct 29 ms 9008 KB Output is partially correct
18 Partially correct 32 ms 9672 KB Output is partially correct
19 Partially correct 31 ms 8896 KB Output is partially correct
20 Partially correct 54 ms 14008 KB Output is partially correct
21 Partially correct 47 ms 13336 KB Output is partially correct
22 Partially correct 49 ms 13136 KB Output is partially correct