영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Your task is to construct an array x_1,x_2,…,x_n consisting of n integers.
The array must satisfy m constraints of the form (l,r,s): the sum x_l + x_{l+1} + … + x_r must equal s.
Input
The first line has two integers n and m: the length of the array and the number of constraints.
The next m lines each have three integers l, r and s: the description of the constraints.
Output
If a solution exists, print YES on the first line.
On the second line, print n integers x_1, x_2,…, x_n: the contents of the array. All elements of the array must satisfy -10^15 ≤ x_i ≤ 10^15 and the array must satisfy all given constraints. You can print any valid solution.
If no solution exists, just print NO.
Constraints
- 1 ≤ n ≤ 5000
- 0 ≤ m ≤ 2 · 10^5
- 1 ≤ l ≤ r ≤ n
- -10^9 ≤ s ≤ 10^9
예제
예제 1
5 3 1 3 3 3 5 3 4 4 -1
YES 0 2 1 -1 3