답안 #1060651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060651	2024-08-15T20:24:18 Z	ArthuroWich	자동 인형 (IOI18_doll)	C++17	2 / 100	196 ms	17996 KB

doll

#include "doll.h"
#include<bits/stdc++.h>
using namespace std;
struct node {
    int l = -1, r = -1, y = 0;
};
int timer = 2, dep;
vector<int> x, y;
node tree[500005];
void build(int n, int d) {
    if (dep-1 == d) {
        return;
    }
    tree[n].l = -timer;
    timer++;
    tree[n].r = -timer;
    timer++;
    build(-tree[n].l, d+1);
    build(-tree[n].r, d+1);
}
void create(int n, int d, int v) {
    if (dep-1 == d) {
        if (tree[n].y == 0) {
            tree[n].l = v;
        } else {
            tree[n].r = v;
        }
    } else {
        if (tree[n].y == 0) {
            create(-tree[n].l, d+1, v);
        } else {
            create(-tree[n].r, d+1, v);
        }
    }
    tree[n].y ^= 1;
}
void create_circuit(int m, vector<int> a) {
    vector<int> d(m+1, 0);
    a.push_back(0);
    vector<set<int>> edges(m+1);
    d[0] = a.front();
    for (int i = 1; i < a.size(); i++) {
        edges[a[i-1]].insert(a[i]);
    }
    a.pop_back();
    vector<int> c;
    for (int i = 0; i < a.size(); i++) {
        if (edges[a[i]].size() == 0) {
            d[a[i]] = 0;
        } else if (edges[a[i]].size() == 1) {
            d[a[i]] = *edges[a[i]].begin();
        } else {
            c.push_back(a[i]);
        }
    }
    a = c;
    if (!a.empty()) {
        int n = a.size(), s;
        dep = ceil(log2(n));
        s = 1 << dep;
        build(1, 0);
        for (int i = 1; i < s; i++) {
            if (i < n) {
                create(1, 0, a[i]);
            } else {
                create(1, 0, -1);
            }
        }
        create(1, 0, 0);
        for (int i = 1; i < s; i++) {
            cout << tree[i].y << endl;
            x.push_back(tree[i].l);
            y.push_back(tree[i].r);
        }
    }
    answer(d, x, y);
}

Compilation message

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

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	16 ms	10328 KB	Output is correct
3	Correct	19 ms	8280 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	7 ms	6236 KB	Output is correct
6	Correct	23 ms	12592 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct

Subtask #2
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	16 ms	10328 KB	Output is correct
3	Correct	19 ms	8280 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	7 ms	6236 KB	Output is correct
6	Correct	23 ms	12592 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Incorrect	196 ms	17996 KB	DO NOT PRINT ANYTHING TO STANDARD OUTPUT
9	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	16 ms	10328 KB	Output is correct
3	Correct	19 ms	8280 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	7 ms	6236 KB	Output is correct
6	Correct	23 ms	12592 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Incorrect	196 ms	17996 KB	DO NOT PRINT ANYTHING TO STANDARD OUTPUT
9	Halted	0 ms	0 KB	-