# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1126396 | luvna | Restore Array (RMI19_restore) | C++20 | 11 ms | 328 KiB |
#include<bits/stdc++.h>
#define MASK(i) (1 << (i))
#define pub push_back
#define all(v) v.begin(), v.end()
#define compact(v) v.erase(unique(all(v)), end(v))
#define pii pair<int,int>
#define fi first
#define se second
#define endl "\n"
#define sz(v) (int)(v).size()
#define dbg(x) "[" #x " = " << (x) << "]"
using namespace std;
template<class T> bool minimize(T& a, T b){if(a > b) return a = b, true;return false;}
template<class T> bool maximize(T& a, T b){if(a < b) return a = b, true;return false;}
typedef long long ll;
typedef long double ld;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r){return uniform_int_distribution<ll>(l, r)(rng);}
const int N = 5005;
int n, q;
int t[N], l[N], r[N], k[N];
namespace subtask1{
bool check(void){
return n <= 18 && q <= 200;
}
bool check(int mask){
for(int j = 1; j <= q; j++){
int cnt = 0;
for(int i = l[j]; i <= r[j]; i++) cnt += ((mask >> i & 1) == t[j]);
if(!t[j] && cnt < k[j]) return false;
if(t[j] && cnt < (r[j] - l[j] + 1) - k[j] + 1) return false;
}
return true;
}
void main(){
for(int mask = 0; mask < (1 << n); mask++){
if(check(mask)){
for(int i = 0; i < n; i++) cout << (mask >> i & 1) << " ";
return;
}
}
return cout << -1, void();
}
}
void solve(){
cin >> n >> q;
for(int i = 1; i <= q; i++) cin >> l[i] >> r[i] >> k[i] >> t[i];
if(subtask1::check()) subtask1::main();
}
signed main(){
ios_base::sync_with_stdio(NULL);
cin.tie(0); cout.tie(0);
#define task "task"
if(fopen(task".INP", "r")){
freopen(task".INP", "r", stdin);
freopen(task".OUT", "w", stdout);
}
int t; t = 1; //cin >> t;
while(t--) solve();
}
Compilation message (stderr)
# | 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... |