[백준/BOJ] 13335번 트럭 (C++)

www.acmicpc.net/problem/13335

13335번: 트럭

똑같은 문제

 

transferhwang.tistory.com/228

[프로그래머스/Level 2] 다리를 지나는 트럭 (C++)

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n, w, L, time = 1;
vector<int> truck;

void cross() {
    queue<int> ready;
    for(int i = 0; i < truck.size(); i++) {
        ready.push(truck[i]);
    }
    
    vector<pair<int, int > > onBridge;
    int sum = 0;
    while(1) {
        if(ready.empty() && onBridge.empty()) break;
        
        if(!ready.empty() && sum + ready.front() <= L) {
            onBridge.push_back({ready.front(), 0});
            sum += ready.front();
            ready.pop();
        }
        
        for(int i = 0; i < onBridge.size(); i++) {
            onBridge[i].second++;
        }
        
        time++;
        
        if(onBridge[0].second == w) {
            sum -= onBridge[0].first;
            onBridge.erase(onBridge.begin());;
        }
    }
}

int main(void) {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    cin>>n>>w>>L;
    for(int i = 0; i < n; i++) {
        int x;
        cin>>x;
        truck.push_back(x);
    }
    
    cross();
    cout<<time;
}