#include <iostream>
#include <vector>
#include "doll.h"
using namespace std;
int l[1000000],r[1000000],num[25],d[1000000];
void create_circuit(int M, std::vector<int> A) {
int n = A.size();
n++;
A[n-1]=-1;
int t=1,p=0;
while(t<n)
{
t*=2;
p++;
}
std::vector<int> C(M + 1);
C[0] = -1;
for (int i = 1; i <= M; ++i) {
C[i] = 1;
}
std::vector<int> X(t-1), Y(t-1);
for (int k = 0; k < n; ++k) {
X[k] = Y[k] = A[k];
}
num[1]=-1;
for(int i=1;i<=t+1;i++)
{
num[1]++;
for(int j=1;j<=p+1;j++)
{
if(num[j]==2)
{
num[j]=0;
num[j+1]++;
}
else break;
}
int q=1;
for(int j=p;j>=1;j--)
{
d[i]+=q*num[j];
q*=2;
}
}
for(int i=1;i<=t-1;i++)
{
l[i]=(i*2)*-1;
r[i]=(i*2+1)*-1;
if(i*2>t-1)l[i]=-1;
if(i*2+1>t-1)r[i]=-1;
}
//for(int i=1;i<=t-1;i++)cout<<l[i]<<" ";
//cout<<endl;
//for(int i=1;i<=t-1;i++)cout<<r[i]<<" ";
//cout<<endl;
for(int i=1;i<=n;i++)
{
if(d[i]%2==1)r[(t+d[i])/2]=A[i-1];
else l[(t+d[i])/2]=A[i-1];
//cout<<d[i]%2<<" "<<(t+d[i])/2<<endl;
}
//for(int i=t/2;i<=t-1;i++)cout<<l[i]<<" "<<r[i]<<" ";
//cout<<endl;
C[0]=-1;
for(int i=1;i<=M;i++)C[i]=-1;
r[t-1]=0;
//cout<<endl;
for(int i=0;i<t-1;i++)X[i]=l[i+1];
//cout<<endl;
for(int i=0;i<t-1;i++)Y[i]=r[i+1];
//for(int i=0;i<t-1;i++)cout<<X[i]<<" ";
//cout<<endl;
//for(int i=0;i<t-1;i++)cout<<Y[i]<<" ";
//cout<<endl;
answer(C, X, Y);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
204 KB |
Output is partially correct |
2 |
Partially correct |
77 ms |
10564 KB |
Output is partially correct |
3 |
Partially correct |
79 ms |
10584 KB |
Output is partially correct |
4 |
Partially correct |
86 ms |
11068 KB |
Output is partially correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
204 KB |
Output is partially correct |
2 |
Partially correct |
77 ms |
10564 KB |
Output is partially correct |
3 |
Partially correct |
79 ms |
10584 KB |
Output is partially correct |
4 |
Partially correct |
86 ms |
11068 KB |
Output is partially correct |
5 |
Partially correct |
105 ms |
11564 KB |
Output is partially correct |
6 |
Partially correct |
115 ms |
11380 KB |
Output is partially correct |
7 |
Partially correct |
96 ms |
11452 KB |
Output is partially correct |
8 |
Partially correct |
96 ms |
11196 KB |
Output is partially correct |
9 |
Partially correct |
83 ms |
10544 KB |
Output is partially correct |
10 |
Partially correct |
105 ms |
11204 KB |
Output is partially correct |
11 |
Partially correct |
116 ms |
11076 KB |
Output is partially correct |
12 |
Partially correct |
83 ms |
10564 KB |
Output is partially correct |
13 |
Partially correct |
82 ms |
10660 KB |
Output is partially correct |
14 |
Partially correct |
80 ms |
10828 KB |
Output is partially correct |
15 |
Partially correct |
90 ms |
10856 KB |
Output is partially correct |
16 |
Partially correct |
4 ms |
588 KB |
Output is partially correct |
17 |
Correct |
58 ms |
5996 KB |
Output is correct |
18 |
Partially correct |
80 ms |
10564 KB |
Output is partially correct |
19 |
Partially correct |
81 ms |
10496 KB |
Output is partially correct |
20 |
Partially correct |
97 ms |
11072 KB |
Output is partially correct |
21 |
Partially correct |
94 ms |
11076 KB |
Output is partially correct |
22 |
Partially correct |
95 ms |
11076 KB |
Output is partially correct |