이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(v) (int)v.size()
const int M = (1 << 19);
int x[M], y[M], cnt[M], maxSwitch;
void build(int u, int L, int R) {
maxSwitch = max(maxSwitch, u);
cnt[u] = 0;
if(L == R) return;
int mid = L + R >> 1, lc = u << 1, rc = lc | 1;
x[u] = lc, y[u] = rc;
build(lc, L, mid); build(rc, mid + 1, R);
}
void insert(int u, int L, int R, int nxt) {
if(L == R) {
if(~cnt[u] & 1) x[u] = -nxt;
else y[u] = -nxt;
cnt[u] ^= 1;
return;
} int mid = L + R >> 1, lc = u << 1, rc = lc | 1;
if(~cnt[u] & 1) {
cnt[u] ^= 1;
insert(lc, L, mid, nxt);
}
else {
cnt[u] ^= 1;
insert(rc, mid + 1, R, nxt);
}
}
void create_circuit(int m, vector<int> a) {
int n = a.size();
while(n + 1 < 2 || __builtin_popcount(n + 1) != 1) {
a.push_back(-1);
n++;
} a.push_back(0); n++;
build(1, 1, n / 2);
for(int i : a) insert(1, 1, n / 2, i);
vector<int> C(m + 1, -1), X, Y;
X.assign(x + 1, x + 1 + maxSwitch);
Y.assign(y + 1, y + 1 + maxSwitch);
for(int &i : X) i = -i;
for(int &i : Y) i = -i;
answer(C, X, Y);
}
컴파일 시 표준 에러 (stderr) 메시지
doll.cpp: In function 'void build(int, int, int)':
doll.cpp:16:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
16 | int mid = L + R >> 1, lc = u << 1, rc = lc | 1;
| ~~^~~
doll.cpp: In function 'void insert(int, int, int, int)':
doll.cpp:27:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
27 | } int mid = L + R >> 1, lc = u << 1, rc = lc | 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... |