Codeforces Round #481 (Div. 3) G. Petya's Exams

最新推荐文章于 2018-07-02 12:53:46 发布

皮蛋咸鱼白菜粥

最新推荐文章于 2018-07-02 12:53:46 发布

阅读量215

点赞数

分类专栏： acm 文章标签： acm codeforces

本文链接：https://blog.csdn.net/qq_36603180/article/details/80353121

版权

acm 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

Petya studies at university. The current academic year finishes with $n$ special days. Petya needs to pass $m$ exams in those special days. The special days in this problem are numbered from $1$ to $n$ .

There are three values about each exam:

$s_{i}$ — the day, when questions for the $i$ -th exam will be published,
$d_{i}$ — the day of the $i$ -th exam ( $s_{i} < d_{i}$ ),
$c_{i}$ — number of days Petya needs to prepare for the $i$ -th exam. For the $i$ -th exam Petya should prepare in days between $s_{i}$ and $d_{i} - 1$ , inclusive.

There are three types of activities for Petya in each day: to spend a day doing nothing (taking a rest), to spend a day passing exactly one exam or to spend a day preparing for exactly one exam. So he can't pass/prepare for multiple exams in a day. He can't mix his activities in a day. If he is preparing for the $i$ -th exam in day $j$ , then $s_{i} \leq j < d_{i}$ .

It is allowed to have breaks in a preparation to an exam and to alternate preparations for different exams in consecutive days. So preparation for an exam is not required to be done in consecutive days.

Find the schedule for Petya to prepare for all exams and pass them, or report that it is impossible.

Input

The first line contains two integers $n$ and $m$ $(2 \leq n \leq 100, 1 \leq m \leq n)$ — the number of days and the number of exams.

Each of the following $m$ lines contains three integers $s_{i}$ , $d_{i}$ , $c_{i}$ $(1 \leq s_{i} < d_{i} \leq n, 1 \leq c_{i} \leq n)$ — the day, when questions for the $i$ -th exam will be given, the day of the $i$ -th exam, number of days Petya needs to prepare for the $i$ -th exam.

Guaranteed, that all the exams will be in different days. Questions for different exams can be given in the same day. It is possible that, in the day of some exam, the questions for other exams are given.

Output

If Petya can not prepare and pass all the exams, print -1. In case of positive answer, print $n$ integers, where the $j$ -th number is:

$(m + 1)$ , if the $j$ -th day is a day of some exam (recall that in each day no more than one exam is conducted),
zero, if in the $j$ -th day Petya will have a rest,
$i$ ( $1 \leq i \leq m$ ), if Petya will prepare for the $i$ -th exam in the day $j$ (the total number of days Petya prepares for each exam should be strictly equal to the number of days needed to prepare for it).
Assume that the exams are numbered in order of appearing in the input, starting from $1$ .
If there are multiple schedules, print any of them.

题意：还剩下n天，要猪呢比m场考试，每天要么准备考试要么考试，要么休息，输出能通过全部考试的方案，没有为-1，每场考试有三个信息，1：第几天知道有这个考试，2：第几天考试，3：需要准备多少天才能通过考试。

题解：用结构体存一下，然后排序（排序方法很重要，先di再si），遍历一遍结构体数组，用一个数组记录（贪心）一下每天做的事，要考试的那天考试，从已知有考试的那天往下安排复习往下推知道到考试那天截止，准备好了则休息，不能满足终止输出-1

代码：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int n,m;
struct Exam
{
	int s, d, c,i;
}exam[110];

int out[110];
int cmp(const Exam &a, const Exam &b)
{
	if(a.d==b.d)
		return a.s<b.s;
	else
		return a.d<b.d;
}
int main()
{
	cin>>n>>m;
	{
		int p = 1;
		int k=1;
		memset(out,0,sizeof(out));
		for (int i = 1; i <= m; i++)
		{
			int s1, d1, c1;
			//cin >> exam[i].s >> exam[i].d >> exam[i].c;
			//s1 = exam[i].s; d1 = exam[i].d; c1 = exam[i].c;
			cin>>s1>>d1>>c1;
			exam[i].s = s1, exam[i].d= d1, exam[i].c = c1;
			exam[i].i = i;
		}
		sort(exam+1,exam+1+m,cmp);
		for(int i=1;i<=m;i++)
		{
			//cout<<exam[i].s <<" "<<exam[i].d<<endl;
			if(exam[i].d-exam[i].s==exam[i].c)
			{
			    if(out[exam[i].d]!=0)
                    p =0;
			}
			if (exam[i].d - exam[i].s < exam[i].c)
			{
				p = 0;
			}
			else
			{
				out[exam[i].d] = m + 1;
				k = exam[i].s;
				for(int j=0;j<exam[i].c;j++)
				{
				    while(out[k]!=0)
                        k++;
                    if(k>=exam[i].d)
                        p=0;
                    out[k++] = exam[i].i;
				}

			}

		}
		if (n < m * 2)
			p = 0;

		if (p == 0)
			cout << -1 << endl;
		else
		{
			for (int i = 1; i <= n; i++)
			{
					cout << out[i] << " ";
			}
		}
	}
}