Submission #2135649

---

Source Code Expand

#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

int N,X;
bool add(vector<int>& v){
	int car = 1;
	int pos = 1;
	while(car && pos <= N){
		v[pos]++;
		if( v[pos] == X+1 ){
			v[pos] = 0;
			++pos;
		}else{
			car = 0;
		}
	}
	if( car ){
		return false;
	}
	return true;
}
void solve(){
	int M;
	cin >> N >> X >> M;
	vector<vector<int> > LRS(M,vector<int>(3));
	for(int i=0;i<M;++i){
		cin>>LRS[i][0]>>LRS[i][1]>>LRS[i][2];
	}
	vector<int> num(11,0);
	vector<int> ANS;
	int ANS_SUM = -1;
	do{
		bool flag = true;
		for(int i=0;i<M;++i){
			int res = 0;
			for(int j=LRS[i][0];j<=LRS[i][1];++j){
				res += num[j];
			}
			if( res != LRS[i][2] ){
				flag = false;
				break;
			}
		}
		if( flag ){
			int res = 0;
			for(int i=1;i<=N;++i){
				res += num[i];
			}
			if( ANS_SUM < res ){
				ANS_SUM = res;
				ANS = num;
			}
		}
	}while(add(num));
	if( ANS_SUM == -1 ){
		cout << -1 << endl;
	}else{
		for(int i=1;i<=N;++i){
			if( i>1 )cout << " ";
			cout << ANS[i];
		}
		cout << endl;
	}
}
#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Judge Result