제출 #258610

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
258610		errorgorn	Restore Array (RMI19_restore)	C++14	0 / 100	1 ms	512 KiB

restore

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());


int n,k;

vector<iii> v[20];
int cnt[20];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n>>k;
	
	int a,b,c,d;
	while (k--){
		cin>>a>>b>>c>>d;
		c--;
		
		v[b].push_back(iii(ii(a,c),d));
	}
	
	rep(mask,0,1<<n){
		memset(cnt,0,sizeof(cnt));
		
		rep(x,0,n){
			if (mask&(1<<x)) rep(y,0,x+1) cnt[y]++;
			
			for (auto &it:v[x]){
				if (it.se==1){
					if (cnt[it.fi.fi]<it.fi.se) goto bad;
				}
				else{
					if (cnt[it.fi.fi]>(x-it.fi.fi)-it.fi.se) goto bad;
				}
			}
		}
		
		rep(x,0,n){
			if (mask&(1<<x)) cout<<1<<" ";
			else cout<<0<<" ";
		}
		cout<<endl;
		return 0;
		
		bad:;
	}
	
	cout<<"-1"<<endl;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55