| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 331415 | Sho10 | Restore Array (RMI19_restore) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,a[5005],check=0;
bool cmp(kth x,kth y){
return x.r<y.r;
}
map<ll,ll>viz;
struct kth{
int l,r,value,k;
};
kth b[100005];
void solve(ll pos,ll val){
if(check==1){
return;
}
a[pos]=val;
if(pos==n){
for(ll i=1;i<=m;i++)
{
ll cnt=0;
for(ll j=b[i].l;j<=b[i].r;j++)
{
if(a[j]==0){
cnt++;
}
}
if(b[i].value==0){
if(cnt<b[i].k){
a[pos]=-1;
return;
}
}
if(b[i].value==1){
if(cnt>=b[i].k){
a[pos]=-1;
return;
}
}
}
check=1;
for(ll i=1;i<=n;i++)
{
cout<<a[i]<<' ';
}
a[pos]=-1;
return;
}
solve(pos+1,0);
solve(pos+1,1);
a[pos]=-1;
return;
}
int32_t main(){
CODE_START;
cin>>n>>m;
if(n<=18&&m<=200){
for(ll i=1;i<=m;i++)
{
cin>>b[i].l>>b[i].r>>b[i].k>>b[i].value;
b[i].l++;
b[i].r++;
}
solve(1,0);
solve(1,1);
if(check==1){
return 0;
}
rc("-1");
}else {
for(ll i=1;i<=n;i++)
{
a[i]=-1;
}
for(ll i=1;i<=m;i++)
{
cin>>b[i].l>>b[i].r>>b[i].k>>b[i].value;
b[i].l++;
b[i].r++;
if(b[i].value==1&&b[i].k==1){
for(ll j=b[i].l;j<=b[i].r;j++)
{
if(a[j]==0){
rc("-1");
}
a[j]=1;
}
}else if(b[i].value==0&&b[i].k==b[i].r-b[i].l+1){
for(ll j=b[i].l;j<=b[i].r;j++)
{
if(a[j]==1){
rc("-1");
}
a[j]=0;
}
}
}
sort(b+1,b+m+1,cmp);
for(ll i=1;i<=n;i++)
{
if(a[i]==-1){
a[i]=0;
viz[i]=1;
}
}
for(ll i=1;i<=m;i++){
if(b[i].value==0&&b[i].k==b[i].r-b[i].l+1){
continue;
}
if(b[i].value==1&&b[i].k==1){
continue;
}
if(b[i].value==0&&b[i].k==1){
ll s1=0;
for(ll j=b[i].l;j<=b[i].r;j++)
{
if(a[j]==0){
s1=1;
}
}
if(s1==0){
rc("-1");
}
continue;
}
ll cnt=0;
for(ll j=b[i].l;j<=b[i].r;j++)
{
if(a[j]==1){
cnt++;
}
}
if(cnt!=0){
continue;
}
ll check=0;
for(ll j=b[i].l;j<=b[i].r;j++)
{
if(viz[j]==1&&a[j]==0){
a[j]=1;
viz[j]=0;
check=1;
break;
}
}
if(check==0){
rc("-1");
}
}
for(ll i=1;i<=n;i++)
{
cout<<a[i]<<' ';
}
}
}
/*
Subtask 1:
4 5
0 1 2 1
0 2 2 0
2 2 1 0
0 1 1 0
1 2 1 0
*/