# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
944126 | shoryu386 | 자동 인형 (IOI18_doll) | C++17 | 136 ms | 16556 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int ptr = -1;
vector<int> xLead, yLead;
#include "doll.h"
int construct(vector<int> item){
if (item.size() == 1){
return item[0];
}
vector<int> itemLeft, itemRight;
for (int x = 0; x < item.size(); x+=2){
itemLeft.push_back(item[x]);
}
for (int x = 1; x < item.size(); x+=2){
itemRight.push_back(item[x]);
}
int curNode = ptr;
//cerr << "Construct " << curNode << '\n';
//for (auto y : item) cerr << y << ' ';
//cerr << '\n';
ptr--;
if (itemLeft.size() > itemRight.size()){
itemRight.insert(itemRight.begin(), curNode);
swap(itemLeft, itemRight);
}
xLead[-curNode - 1] = ( construct(itemLeft) );
yLead[-curNode - 1] = ( construct(itemRight) );
return curNode;
}
void create_circuit(int m, std::vector<int> A) {
int n = A.size();
xLead.clear(); yLead.clear();
xLead.resize(2*n + 100); yLead.resize(2*n + 100);
ptr = -1;
vector<int> leads[m+1];
leads[0].push_back(A[0]);
for (int x = 0; x < n-1; x++){
leads[A[x]].push_back(A[x+1]);
}
leads[A[n-1]].push_back(0);
vector<int> connection(m+1);
for (int x = 0; x <= m; x++){
if (leads[x].size() == 0){
connection[x] = x;
}
else if (leads[x].size() == 1){
connection[x] = leads[x][0];
}
else{
//construct binary tree
connection[x] = construct(leads[x]);
}
//cerr << "leads " << x << '\n';
//for (auto y : leads[x]){
// cerr << y << ' ';
//}
//cerr << '\n';
}
xLead.resize(-ptr - 1); yLead.resize(-ptr - 1);
answer(connection, xLead, yLead);
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |