백준 2980. 도로와 신호등 :: 돼지개발자

출저 : https://www.acmicpc.net/problem/2980

"시뮬레이션"

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
class Main {
 
    static int N,L;
    static int[] map;
    static Node[] nodes;
    static int cur, time;
    public static void main (String[] args) throws IOException {
    
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        
        N = Integer.parseInt(st.nextToken());
        L = Integer.parseInt(st.nextToken());
        
        map = new int[L+1];
        nodes = new Node[N+1];
        
        for (int i = 1; i <= N; i++) {
            st = new StringTokenizer(br.readLine());
            int d = Integer.parseInt(st.nextToken());
            int r = Integer.parseInt(st.nextToken());
            int g = Integer.parseInt(st.nextToken());
            
            map[d] = i;
            nodes[i] = new Node(d, r, g);
        }
        
        while(true) {
            if(map[cur] != 0) {
                Node node = nodes[map[cur]];
                int sub = time % (node.r + node.g);
                if(sub < node.r) {    // red
                    time += (node.r - sub);
                }
            }
            
            time++;
            cur++;
            
            if(cur == L) break;
        }
        System.out.println(time);
    }
}
 
class Node {
    int d;
    int r;
    int g;
    Node ( int d, int r, int g) {
        this.d = d;
        this.r = r;
        this.g = g;
    }
}