Submission #88770

---

Source Code Expand

#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <fstream>
#include <cstring>
#include <iomanip>
#include <limits.h>
//#include <NTL/ZZ.h>
//#include <sys/time.h>
//#include <time.h>
using namespace std;
//using namespace NTL;
#define ll long long
int n,x,m;
vector <int> l,r,s,ans;
int maxi=0;
vector <int> cand;
int solve(int dep){

	if(dep==n){
		int total=0;
		for(int i=0;i<m;++i){
			 total=0;
			for(int j=l[i];j<=r[i];++j){
				total+=cand[j];
			}
			if(total!=s[i])return 0;
		}
		total=0;
		for(int i=0;i<n;++i){
			total+=cand[i];
		}
		if(total>maxi){
			for(int i=0;i<n;++i)ans[i]=cand[i];
			maxi=total;

		}
	}else{
		for(int i=0;i<=x;++i){
			cand.push_back(i);
			solve(dep+1);
			cand.pop_back();
		}
	}
	return 0;
}
int main(void)
{
	ans.clear(),l.clear(),r.clear(),s.clear();
	maxi=-1;
	cand.clear();	
	cin>>n>>x>>m;
	l.resize(m);r.resize(m);s.resize(m);
	ans.resize(n);

	for(int i=0;i<m;++i)cin>>l[i]>>r[i]>>s[i],--l[i],--r[i];

	solve(0);

	if(maxi==-1){
		cout<<-1;
		return 0;
	}

	for(int i=0;i<ans.size();++i){
		cout<<ans[i]<<" ";
	}

	return 0;
#if 0
	int T;
	cin>>T;
	for(int _t=1;_t<=T;++_t)
	{



		//	cout<<"Case #"<<_t<<": "<<result<<endl;
		cerr<<"cerr:"<<_t<<endl;
	}
#endif
}




//	cout.setf(ios::fixed);

Submission Info

Judge Result