Submission #4074121

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <deque>
#include <queue>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <set>
#define INF 1000000000000
using namespace std;
using ll = long long;
int main(){
    ll n;
    cin >> n;
    vector<ll> c(n);
    vector<ll> s(n);
    vector<ll> f(n);
    for(ll i=0;i<n-1;i++){
        cin >> c[i] >> s[i] >> f[i];
    }
    ll total;
    for(ll i=0;i<n-1;i++){
        total = 0;
        for(ll j=i;j<n-1;j++){
            if(total<=s[j]){
                total+=abs(total-s[j]);
            }else{
                ll temp = s[j];
                while(total>temp){
                    temp+=f[j];
                }
                total+=abs(total-temp);
            }
            total+=c[j];
        }
        cout << total << endl;
    }
    cout << 0 << endl;
}

Submission Info

Judge Result