이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "doll.h"
#include <bits/stdc++.h>
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
/**********************/
/* YOU ARE INVITED TO */
/* */
/* SUFFER */
/* */
/* ######## */
/* # JOIN # */
/* ######## */
/* */
/**********************/
vector<bool> tree;
int N;
pii trial(int node){
if (node*2 + 1 > N - 2){ //last node??
tree[node] = tree[node] ^ 1;
return mp(tree[node] ^ 1, node);
}
if (tree[node]){ // baruun child
tree[node] = tree[node] ^ 1;
return trial(node*2 + 2);
}
else{
tree[node] = tree[node] ^ 1;
return trial(node*2 + 1);
}
}
void create_circuit(int m, vector<int> a) {
a.pb(0);
int n = a.size();
vector<int> c(m + 1);
N = 1 << (int) ceil( log((double) n)/log(2.0) );
vector<int> x, y;
// we want n output
// we have N output
// we have N - n output to spare
// we can exchange 2 with 1 by removing 1
int treesz = n - 1;
x.resize(n - 1);
y.resize(n - 1);
tree.resize(n - 1);
// cout << N << '\n';
c[0] = -1; //connect it to first switch
for (int i = 0; i < n; i++){
pii tmp = trial(0);
if (i < n - 1){
c[a[i]] = -1;
// cout << tmp.xx << "&" << tmp.yy << "&" << a[i] << '\n';
if (tmp.xx == 0){
x[tmp.yy] = a[i];
}
else{
y[tmp.yy] = a[i];
}
}
else if (i == n - 1){
if (tmp.xx == 0){
x[tmp.yy] = 0;
}
else{
y[tmp.yy] = 0;
}
}
else{
if (tmp.xx == 0){
x[tmp.yy] = -1;
}
else{
y[tmp.yy] = -1;
}
}
}
for (int i = 0; i * 2 + 1 <= n - 2; i++){
x[i] = -(i*2 + 1 + 1);
y[i] = -(i*2 + 2 + 1);
}
// switch with N different outputs
// for (int X : y){
// cout << X << ' ';
// }
answer(c, x, y);
}
// int main(){ // DRIVER - CHAN
// create_circuit(4, {1, 2, 1, 3});
// }
컴파일 시 표준 에러 (stderr) 메시지
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:49:6: warning: unused variable 'treesz' [-Wunused-variable]
49 | int treesz = n - 1;
| ^~~~~~
# | 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... |