Codeforces Round #387 (Div. 2)C. Servers（模拟）

C. Servers
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n servers in a laboratory, each of them can perform tasks. Each server has a unique id — integer from 1 to n.

It is known that during the day q tasks will come, the i-th of them is characterized with three integers: ti — the moment in seconds in which the task will come, ki — the number of servers needed to perform it, and di — the time needed to perform this task in seconds. All ti are distinct.

To perform the i-th task you need ki servers which are unoccupied in the second ti. After the servers begin to perform the task, each of them will be busy over the next di seconds. Thus, they will be busy in seconds ti, ti + 1, …, ti + di - 1. For performing the task, ki servers with the smallest ids will be chosen from all the unoccupied servers. If in the second ti there are not enough unoccupied servers, the task is ignored.

Write the program that determines which tasks will be performed and which will be ignored.

Input
The first line contains two positive integers n and q (1 ≤ n ≤ 100, 1 ≤ q ≤ 105) — the number of servers and the number of tasks.

Next q lines contains three integers each, the i-th line contains integers ti, ki and di (1 ≤ ti ≤ 106, 1 ≤ ki ≤ n, 1 ≤ di ≤ 1000) — the moment in seconds in which the i-th task will come, the number of servers needed to perform it, and the time needed to perform this task in seconds. The tasks are given in a chronological order and they will come in distinct seconds.

Output
Print q lines. If the i-th task will be performed by the servers, print in the i-th line the sum of servers’ ids on which this task will be performed. Otherwise, print -1.

Examples
input
4 3
1 3 2
2 2 1
3 4 3
output
6
-1
10
input
3 2
3 2 3
5 1 2
output
3
3
input
8 6
1 3 20
4 2 1
6 5 5
10 1 1
15 3 6
21 8 8
output
6
9
30
-1
15
36
Note
In the first example in the second 1 the first task will come, it will be performed on the servers with ids 1, 2 and 3 (the sum of the ids equals 6) during two seconds. In the second 2 the second task will come, it will be ignored, because only the server 4 will be unoccupied at that second. In the second 3 the third task will come. By this time, servers with the ids 1, 2 and 3 will be unoccupied again, so the third task will be done on all the servers with the ids 1, 2, 3 and 4 (the sum of the ids is 10).

In the second example in the second 3 the first task will come, it will be performed on the servers with ids 1 and 2 (the sum of the ids is 3) during three seconds. In the second 5 the second task will come, it will be performed on the server 3, because the first two servers will be busy performing the first task.

题意：给定1~N台服务器，有Q次离线询问，每次询问给定服务器开始时间，需要的服务器数量，需要运行的时间，找到满足条件的服务器编号和的最小值，找不到就输出-1.

思路：对于每次询问都遍历所有的服务器查询是否满足要求，如果满足则贪心出最小编号和并更新服务器状态。时间复杂度O(N*Q)

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<string>
using namespace std;
const int maxn=100005;
struct node
{
    int t;
    int k;
    int d;
}Q[maxn];
int num[105];
int main()
{
    int N,q;
    scanf("%d%d",&N,&q);
    memset(num,0,sizeof(num));
    for(int i=0;i<q;i++)
        scanf("%d%d%d",&Q[i].t,&Q[i].k,&Q[i].d);
    for(int i=0;i<q;i++)
    {
        int flag_num=0;//空闲服务器数量
        for(int j=1;j<=N&&flag_num<Q[i].k;j++)
            if(num[j]<Q[i].t)
                flag_num++;
        if(flag_num==Q[i].k)
        {
            long long int result=0;
            for(int j=1;j<=N&&flag_num>0;j++)
            {
                if(num[j]<Q[i].t)
                {
                    num[j]=Q[i].t+Q[i].d-1;
                    flag_num--;
                    result+=j;
                }
            }
            printf("%I64d\n",result);
        }
        else
            printf("-1\n");
    }
    return 0;
}