「CF1187C」Vasya And Array【构造】

C. Vasya And Array

time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

Vasya has an array $a_1,a_2,\dots ,a_n$.
You don’t know this array, but he told you $m$ facts about this array. The $i-th$ fact is a triple of numbers $t_i$, $l_i$ and $r_i$ $(0\le t_i\le 1,1\le l_i<r_i\le n)$ and it means:

if $t_i=1$ then subbarray $a_{l_i},a_{l_{i+1}},\dots ,a_{r_i}$ is sorted in non-decreasing order;
if $t_i=0$ then subbarray $a_{l_i},a_{l_{i+1}},\dots ,a_{r_i}$ is not sorted in non-decreasing order. A subarray is not sorted if there is at least one pair of consecutive elements in this subarray such that the former is greater than the latter.
For example if $a=[2,1,1,3,2]$ then he could give you three facts: $t_1=1,l_1=2,r_1=4$ (the subarray $[a_2,a_3,a_4]=[1,1,3]$ is sorted),$t_2=0,l_2=4,r_2=5$ (the subarray $[a_4,a_5]=[3,2]$ is not sorted), and $t_3=0,l_3=3,r_3=5$ (the subarray $[a_3,a_5]=[1,3,2]$ is not sorted).

You don’t know the array ?. Find any array which satisfies all the given facts.

Input

The first line contains two integers $n$ and $m$ $(2\le n\le 1000,1\le m\le 1000)$.
Each of the next ? lines contains three integers $t_i,l_{i}and{r}_i(0\le t_i\le 1,1\le l_i<r_i\le n)$.
If $t_i=1$ then subbarray $a_{l_i},a_{l_{i+1}},\dots ,a_{r_i}$ is sorted. Otherwise (if $t_i=0$) subbarray $a_{l_i},a_{l_{i+1}},\dots ,a_{r_i}$ is not sorted.

Output

If there is no array that satisfies these facts in only line print $NO$ (in any letter case).

If there is a solution, print $YES$ (in any letter case). In second line print $n$ integers $a_1,a_2,\dots ,a_n(1\le a_i\le 10^9)$ — the array $a$, satisfying all the given facts. If there are multiple satisfying arrays you can print any of them.

Examples

input

7 4
1 1 3
1 2 5
0 5 6
1 6 7

output

YES
1 2 2 3 5 4 4

input

4 2
1 1 4
0 2 3

output

NO

题意

• 就是构造一个长度为$n$的数组，然后给出$m$条描述条件，分为两种描述，一种是描述区间$[l,r]$内的数单调不减，另一种描述$[l,r]$内的数不是单调不减

题解

• 计需要构造的数组为$a$，用$mark[i]$表示$a[i+1]$是否需要大于等于$a[i]$，当给出第一种描述时，位置$[l,r-1]$内的位置的$mark$值都要标记为$1$，存下第二种描述，处理完第一种后，对于每一个第二种描述，检查$[l,r-1]$内的$mark$是否有$0$的情况，显然，如果没有，这种描述是无解的，$check$所有第二种描述都没问题之后，另$a[1]=n$，然后对于$1\le i<n$，如果$mark[i]=1$，不妨令$a[i+1]=a[i]$，否则令$a[i+1]=a[i]-1$;
• 感觉典型$CF$题特点啊，想清楚代码很短，不想好直接写$FST$，$Hacked$，还贼长贼长，这题列表全挂了

#include<bits/stdc++.h>

using namespace std;
const int maxn=1005;

int a[maxn][3],mark[maxn];

int main()
{
	int n,m;scanf("%d %d",&n,&m);
	for(int i=1,t,l,r;i<=m;i++){
		scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
		if(a[i][0]) for(int j=a[i][1];j<a[i][2];j++) mark[j]=1;
	}
	for(int i=1;i<=m;i++){
		bool ok=false;
		if(!a[i][0]){
			for(int j=a[i][1];j<a[i][2];j++){
				if(!mark[j]) {ok=true;break;}
			}
			if(!ok) return printf("NO\n"),0;
		}
	}
	int ans=n+1;
	printf("YES\n");
	for(int i=1;i<=n;i++) printf("%d%c",mark[i-1]?ans:--ans,i==n?'\n':' ');
}