Submission #1924501

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PB push_back
using namespace std;
typedef pair<int, int> P1;
typedef pair<int, pair<int, int> > P2;
static const int INF = 1ll<<60;
static const int dx[] = { 1, -1, 0, 0, };
static const int dy[] = { 0, 0, 1, -1 };
static const int mod = 1000000007;

int N;
int C[505],S[505],F[505];

signed main(){
    cin>>N;
    for(int i=0;i<N-1;++i)cin>>C[i]>>S[i]>>F[i];
    for(int i=0;i<N;++i){
        int T = 0;
        for(int j=i;j<N-1;++j){
            //cout<<T<<endl;
            if(T<S[j]){
                T = S[j] + C[j];
            }
            else{
                int cost = (T-S[j])/F[j];
                if(cost * F[j] < T - S[j])cost++;
                T = S[j] + F[j] * cost + C[j];
            }
        }
        cout<<T<<endl;
    }
}

Submission Info

Judge Result