제출 #915946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915946		Matjaz	Potatoes and fertilizers (LMIO19_bulves)	C++14	24 / 100	257 ms	14988 KiB

bulves

#include<vector>
#include<iostream>
#include <stdlib.h> 
#include <algorithm>
#include <stack>
#include <queue>

using namespace std;

int N;

int main(){
	cin >> N;
	vector<int> a(N), b(N);
    queue<int> QA;
    queue<int> QB;
    for (int i=0;i<N;i++){
        cin >> a[i] >> b[i];
        QA.push(a[i]);
        QB.push(b[i]);
    }
    
    long long cost = 0;
    long long overflow = 0;
    long long overflow_location = 0;
    
    while (!QA.empty() || !QB.empty()){
        if (overflow == 0 && QA.empty()) break;
        if (overflow == 0){
            overflow = QA.front();
            overflow_location = N - QA.size();
            QA.pop();
            continue;
        }
        if (overflow > 0){
            long long current_location = N - QB.size();
            long long fixed = min(overflow, (long long)QB.front());
            overflow -= QB.front();
            QB.pop();
            cost += abs(current_location - overflow_location) * fixed;
            if (overflow < 0) overflow_location = current_location;
        } else {
            long long current_location = N - QA.size();
            long long fixed = min(-overflow, (long long) QA.front());
            overflow += QA.front();
            QA.pop();
            cost += abs(current_location - overflow_location) * fixed;
            if (overflow > 0) overflow_location = current_location;
            
        }
    }
    
    

    cout << cost << endl;
	return 0;
}

• Subtask 1: 24 / 24
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 36