이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include "doll.h"
#define MAXN 200007
using namespace std;
int m,power,n;
int a[MAXN],s;
vector< pair<int,int> > edges;
vector<int> from,to,c;
int rev(int x){
int res=0;
for(int i=1;i<power;i*=2){
res*=2; res+=x%2; x/=2;
}
return res;
}
void build(int v,int l,int r,int num){
if(l+1==r){
num*=2;
if(rev(num)<n)edges.push_back({-v,a[rev(num)]});
else if(rev(num)==power-1)edges.push_back({-v,0});
else edges.push_back({v,-1});
num++;
if(rev(num)<n)edges.push_back({-v,a[rev(num)]});
else if(rev(num)==power-1)edges.push_back({-v,0});
else edges.push_back({v,-1});
}else{
int tt=(l+r)/2;
build(2*v,l,tt,2*num);
build(2*v+1,tt+1,r,2*num+1);
edges.push_back({-v,-2*v});
edges.push_back({-v,-2*v-1});
}
}
void create_circuit(int M, vector<int> A){
m=M; n=int(A.size());
for(int i=0;i<n;i++){
a[i]=A[i];
}
power=1;
while(power<n+1)power*=2;
build(1,0,power-1,0);
for(int i=0;i<=m;i++)c.push_back(-1);
for(int i=0;i<edges.size();i++){
from.push_back(edges[i].first);
to.push_back(edges[i].second);
}
answer(from,to,c);
}
/*
int main(){
}
*/
컴파일 시 표준 에러 (stderr) 메시지
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:53:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for(int i=0;i<edges.size();i++){
| ~^~~~~~~~~~~~~
# | 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... |