#include "doll.h"
#include<iostream>
#include<vector>
using namespace std;
int reverse(int a,int exp){
int ans=0;
while(exp--){ans*=2;
ans+=a%2;
a/=2;
}//cout<<endl;
return ans;
}
void create_circuit(int M, std::vector<int> A) {vector<int> C(M+1);
A.push_back(0);
for(int i=0;i<=M;i++)C[i]=-1;
C[0]=A[0];
A.erase(A.begin());
int N = A.size();
int pow=1;
int exp=0;
while(pow<N){
pow*=2;
exp++;
}
vector<int> X(pow-1);
vector<int> Y(pow-1);
for(int i=0;i<pow/2-1;i++){
X[i]=2*(-i-1);
Y[i]=2*(-i-1)-1;
//cout<<-i-1<<" "<<X[i]<<" "<<Y[i]<<endl;
}
for(int i=pow/2;i<pow;i++){
int orderX=2*i-pow;
int orderY=2*i+1-pow;
//cout<<orderX<<" "<<orderY<<endl;
//cout<<reverse(orderX,exp)<<endl;
//cout<<reverse(orderY,exp)<<endl;
int rX=reverse(orderX,exp);
int rY=reverse(orderY,exp);
//cout<<rX<<" "<<rY<<endl;
if(rX+N>=pow){
X[i-1]=A[rX-pow+N];
}else X[i-1]=-1;
if(rY+N>=pow){
Y[i-1]=A[rY-pow+N];
}else Y[i-1]=-1;
}
//cout<<pow<<endl;
answer(C,X,Y);
}
# |
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 |
Incorrect |
1 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 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
204 KB |
Output is partially correct |
2 |
Correct |
46 ms |
4996 KB |
Output is correct |
3 |
Partially correct |
75 ms |
7488 KB |
Output is partially correct |
4 |
Partially correct |
109 ms |
8016 KB |
Output is partially correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
2 ms |
204 KB |
Output is partially correct |
2 |
Correct |
46 ms |
4996 KB |
Output is correct |
3 |
Partially correct |
75 ms |
7488 KB |
Output is partially correct |
4 |
Partially correct |
109 ms |
8016 KB |
Output is partially correct |
5 |
Partially correct |
98 ms |
8488 KB |
Output is partially correct |
6 |
Partially correct |
96 ms |
8208 KB |
Output is partially correct |
7 |
Partially correct |
136 ms |
8244 KB |
Output is partially correct |
8 |
Partially correct |
91 ms |
8092 KB |
Output is partially correct |
9 |
Partially correct |
75 ms |
7496 KB |
Output is partially correct |
10 |
Partially correct |
87 ms |
8044 KB |
Output is partially correct |
11 |
Partially correct |
103 ms |
7992 KB |
Output is partially correct |
12 |
Partially correct |
77 ms |
7488 KB |
Output is partially correct |
13 |
Correct |
58 ms |
5664 KB |
Output is correct |
14 |
Partially correct |
87 ms |
7720 KB |
Output is partially correct |
15 |
Partially correct |
95 ms |
7744 KB |
Output is partially correct |
16 |
Partially correct |
4 ms |
588 KB |
Output is partially correct |
17 |
Correct |
51 ms |
5276 KB |
Output is correct |
18 |
Correct |
53 ms |
5172 KB |
Output is correct |
19 |
Partially correct |
77 ms |
7480 KB |
Output is partially correct |
20 |
Partially correct |
94 ms |
7988 KB |
Output is partially correct |
21 |
Partially correct |
97 ms |
7972 KB |
Output is partially correct |
22 |
Partially correct |
115 ms |
7956 KB |
Output is partially correct |