// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "messy.h"
std::vector<int> restore_permutation(int n, int w, int r) {
string curr = string(n,'0');
rev(i,n-1,1){
curr[i] = '1';
add_element(curr);
debug(curr);
}
compile_set();
vector<int> p(n);
rep(i,n) p[i] = i;
int mn_ones = inf1;
pii px = {0,0};
rep(i,1<<n){
string s = "";
rev(bit,n-1,0){
if(i & (1 << bit)){
s.pb('1');
}
else{
s.pb('0');
}
}
bool there = check_element(s);
if(!there) conts;
debug(s);
int ones = count(all(s),'1');
int zeros = n - ones;
if(ones > mn_ones) conts;
bool flag = false;
rep(i,n){
if(i < zeros){
if(s[i] == '1'){
flag = true;
px.ff = i;
}
}
else{
if(s[i] == '0'){
px.ss = i;
}
}
}
if(flag){
mn_ones = ones;
}
}
swap(p[px.ff], p[px.ss]);
return p;
}
Compilation message
messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:48:18: warning: statement has no effect [-Wunused-value]
48 | #define debug(x) 42
| ^~
messy.cpp:70:9: note: in expansion of macro 'debug'
70 | debug(curr);
| ^~~~~
messy.cpp:48:18: warning: statement has no effect [-Wunused-value]
48 | #define debug(x) 42
| ^~
messy.cpp:95:9: note: in expansion of macro 'debug'
95 | debug(s);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
n = 8 |
| 2 |
Correct |
1 ms |
300 KB |
n = 8 |
| 3 |
Correct |
1 ms |
212 KB |
n = 8 |
| 4 |
Correct |
1 ms |
212 KB |
n = 8 |
| 5 |
Correct |
0 ms |
212 KB |
n = 8 |
| 6 |
Correct |
1 ms |
296 KB |
n = 8 |
| 7 |
Correct |
1 ms |
212 KB |
n = 8 |
| 8 |
Correct |
1 ms |
300 KB |
n = 8 |
| 9 |
Correct |
1 ms |
212 KB |
n = 8 |
| 10 |
Correct |
1 ms |
212 KB |
n = 8 |
| 11 |
Correct |
1 ms |
212 KB |
n = 8 |
| 12 |
Correct |
1 ms |
212 KB |
n = 8 |
| 13 |
Correct |
1 ms |
212 KB |
n = 8 |
| 14 |
Correct |
1 ms |
212 KB |
n = 8 |
| 15 |
Correct |
1 ms |
212 KB |
n = 8 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
grader returned WA |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
n = 32 |
| 2 |
Incorrect |
0 ms |
212 KB |
grader returned WA |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
grader returned WA |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
grader returned WA |
| 2 |
Halted |
0 ms |
0 KB |
- |
