#include "doll.h"
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
//#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
vector<ll> binorder(ll n){
if (n==0) return {0};
vector<ll> ans;
vector<ll> sus = binorder(n-1);
for (auto&i : sus){
ans.push_back(i*2);
}
for (auto&i : sus){
ans.push_back(i*2 + 1);
}
return ans;
}
void create_circuit(int M, vector<int> A) {
ll offset = 0;
ll N = A.size();
reverse(A.begin(), A.end());
vector<ll> X;
vector<ll> Y;
vector<ll> ans;
ans.push_back(-1);
FOR(i, 1, M+1){
ans.push_back(-1);
}
ll screwthis = -1;
FORNEG(i, 30, -1){
if (N&(1<<i)){
N -= (1<<i);
vector<ll> things;
vector<ll> order = binorder(i);
if (i==0){
Y.push_back(0);
X.push_back(A[0]);
continue;
}
FOR(j, 1, (1<<(i))){
X.push_back(-(j*2+offset));
Y.push_back(-(j*2+1+offset));
}
ll shit = 0;
FOR(j,(1<<(i)), (1<<(i+1))){
X.push_back(A[order[shit++]]);
if (A.size() >= order[shit-1] + (1<<i)){
Y.push_back(A[order[shit-1] + (1<<i)]);
}else{
Y.push_back(offset-1);
}
}
break;
}
}
// for (auto&i : ans){
// cout << i << " ";
// }cout << endl;
// for (auto&i : X){
// cout << i << " ";
// }cout << endl;
// for (auto&i : Y){
// cout << i << " ";
//
// }cout << endl;
Y[Y.size()-1] = 0;
answer(ans, X, Y);
}
Compilation message
doll.cpp: In function 'void create_circuit(int, std::vector<int>)':
doll.cpp:81:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
81 | if (A.size() >= order[shit-1] + (1<<i)){
| ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
doll.cpp:49:6: warning: unused variable 'screwthis' [-Wunused-variable]
49 | ll screwthis = -1;
| ^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
state 'Y' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
state 'Y' |
2 |
Halted |
0 ms |
0 KB |
- |