Codeforces Round #325 (Div. 2) C 模拟

链接：戳这里

C. Gennady the Dentist

time limit per test1 second

memory limit per test256 megabytes

inputstandard input

outputstandard output

Gennady is one of the best child dentists in Berland. Today n children got an appointment with him, they lined up in front of his office.

All children love to cry loudly at the reception at the dentist. We enumerate the children with integers from 1 to n in the order they go in the line. Every child is associated with the value of his cofidence pi. The children take turns one after another to come into the office; each time the child that is the first in the line goes to the doctor.

While Gennady treats the teeth of the i-th child, the child is crying with the volume of vi. At that the confidence of the first child in the line is reduced by the amount of vi, the second one — by value vi - 1, and so on. The children in the queue after the vi-th child almost do not hear the crying, so their confidence remains unchanged.

If at any point in time the confidence of the j-th child is less than zero, he begins to cry with the volume of dj and leaves the line, running towards the exit, without going to the doctor's office. At this the confidence of all the children after the j-th one in the line is reduced by the amount of dj.

All these events occur immediately one after the other in some order. Some cries may lead to other cries, causing a chain reaction. Once in the hallway it is quiet, the child, who is first in the line, goes into the doctor's office.

Help Gennady the Dentist to determine the numbers of kids, whose teeth he will cure. Print their numbers in the chronological order.

Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 4000) — the number of kids in the line.

Next n lines contain three integers each vi, di, pi (1 ≤ vi, di, pi ≤ 106) — the volume of the cry in the doctor's office, the volume of the cry in the hall and the confidence of the i-th child.

Output
In the first line print number k — the number of children whose teeth Gennady will cure.

In the second line print k integers — the numbers of the children who will make it to the end of the line in the increasing order.

Examples
input
5
4 2 2
4 1 2
5 2 4
3 3 5
5 1 2
output
2
1 3 
input
5
4 5 1
5 3 9
4 1 2
2 1 8
4 1 9
output
4
1 2 4 5 
Note
In the first example, Gennady first treats the teeth of the first child who will cry with volume 4. The confidences of the remaining children will get equal to  - 2, 1, 3, 1, respectively. Thus, the second child also cries at the volume of 1 and run to the exit. The confidence of the remaining children will be equal to 0, 2, 0. Then the third child will go to the office, and cry with volume 5. The other children won't bear this, and with a loud cry they will run to the exit.

In the second sample, first the first child goes into the office, he will cry with volume 4. The confidence of the remaining children will be equal to 5,  - 1, 6, 8. Thus, the third child will cry with the volume of 1 and run to the exit. The confidence of the remaining children will be equal to 5, 5, 7. After that, the second child goes to the office and cry with the volume of 5. The confidences of the remaining children will be equal to 0, 3. Then the fourth child will go into the office and cry with the volume of 2. Because of this the confidence of the fifth child will be 1, and he will go into the office last.

题意：

n个小孩排成队看牙医，每个小孩有三个属性，v,d,p，v表示看牙医之后会哭，对后面排队的人造成的影响是v-1递减，p表示小孩的自信值，如果自信值小于0，则会跑走不看牙医，然后跑走之后会对后面的小孩造成自信减去di的价值

这里需要注意的是，一个小孩跑走后，则前面的小孩不会对他造成影响，也就是不再队列里了

思路：

模拟这个过程就可以了

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
#define MAX 1000100
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
#define INF (1ll<<60)-1
using namespace std;
int n;
struct node{
    ll v,d,p;
}s[4010];
int vis[4010];
int used[4010];
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%I64d%I64d%I64d",&s[i].v,&s[i].d,&s[i].p);
    int ans=0;
    for(int i=1;i<=n;i++){
        if(vis[i]) continue;
        if(s[i].p>=0){
            int cnt=s[i].v;
            ans++;
            used[i]=1;
            for(int j=i+1;j<=n;j++){
                if(vis[j]) continue;
                s[j].p-=cnt;
                cnt--;
                if(cnt==0) break;
            }
            ll y=0;
            for(int j=i+1;j<=n;j++){
                if(vis[j]) continue;
                s[j].p-=y;
                if(s[j].p<0){
                    y+=s[j].d;
                    vis[j]=1;
                }
            }
        }
    }
    cout<<ans<<endl;
    for(int i=1;i<=n;i++) {
        if(used[i]) cout<<i<<" ";
    }
    cout<<endl;
    return 0;
}