제출 #1060656

#제출 시각아이디문제언어결과실행 시간메모리
1060656ArthuroWich자동 인형 (IOI18_doll)C++17
9 / 100
142 ms23616 KiB
#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, -1); 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++) { x.push_back(tree[i].l); y.push_back(tree[i].r); } } answer(d, x, y); }

컴파일 시 표준 에러 (stderr) 메시지

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++) {
      |                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...