제출 #1094553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094553		Izzy	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	140 ms	7244 KiB

ho_t1

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

int n;

int main() {
    cin >> n;
    vector<pair<int, int>> ties(n + 1);
    vector<int> current(n);
    for (int i = 0; i <= n; i++) {
        cin >> ties[i].first;
        ties[i].second = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> current[i];
    }
    sort(ties.begin(), ties.end());
    sort(current.begin(), current.end());
    
    vector<int> start = {0};
    vector<int> shifted = {0};

    int temp1 = 0;
    int temp2 = 0;
    for (int i = 0; i < n; i++) {
        temp1 = max(temp1, ties[i].first - current[i]);
        start.push_back(temp1);
    }
    start.push_back(max(temp1, ties[n].first - current[n - 1]));
    for (int i = n - 1; i >= 0; i--) {
        temp2 = max(temp2, ties[i + 1].first - current[i]);
        shifted.push_back(temp2);
    }
    reverse(shifted.begin(), shifted.end());
    //indexing issue below?
    vector<int> answers(n + 1);
    for (int i = 0; i <= n; i++) {
        answers[ties[i].second] = max(start[i], shifted[i]);
    }
    for (auto i: answers) {
        cout << i << ' ';
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91