Submission #1924501


Source Code Expand

Copy
#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

Submission Time
Task C - Special Trains
User koutarou
Language C++14 (GCC 5.4.1)
Score 300
Code Size 876 Byte
Status AC
Exec Time 4 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt AC 4 ms 256 KB
02.txt AC 4 ms 256 KB
03.txt AC 4 ms 256 KB
04.txt AC 4 ms 256 KB
05.txt AC 4 ms 256 KB
06.txt AC 4 ms 256 KB
07.txt AC 4 ms 256 KB
08.txt AC 4 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 2 ms 256 KB
11.txt AC 4 ms 256 KB
12.txt AC 2 ms 256 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB