Submission #615957


Source Code Expand

#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define each(it,n) for(__typeof((n).begin()) it=(n).begin();it!=(n).end();++it)

using namespace std;

int main() {
    int N;
    cin >> N;
    vector<pair<int, int> > a(N - 1);
    rep(i, N - 1) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.begin(), a.end());
    
    vector<char> used(N);
    vector<int> ans(N);
    rep(i, N - 1) {
        int val = a[i].first;
        int index = a[i].second;
        if (!used[index]) ans[index] = val, used[index] = true;
        if (!used[index + 1]) ans[index + 1] = val, used[index + 1] = true;
    }

    rep(i, N) {
        if (i) cout << " ";
        cout << ans[i];
    }
    cout << endl;
    
    return 0;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User y3eadgbe
Language C++ (GCC 4.9.2)
Score 80
Code Size 790 Byte
Status AC
Exec Time 125 ms
Memory 1960 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 80 / 80
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt
Case Name Status Exec Time Memory
sample1.txt AC 26 ms 796 KB
sample2.txt AC 25 ms 924 KB
sample3.txt AC 23 ms 928 KB
subtask0_0.txt AC 122 ms 1824 KB
subtask0_1.txt AC 95 ms 1952 KB
subtask0_10.txt AC 88 ms 1828 KB
subtask0_11.txt AC 102 ms 1956 KB
subtask0_12.txt AC 120 ms 1776 KB
subtask0_13.txt AC 94 ms 1956 KB
subtask0_14.txt AC 105 ms 1952 KB
subtask0_2.txt AC 87 ms 1696 KB
subtask0_3.txt AC 111 ms 1752 KB
subtask0_4.txt AC 92 ms 1960 KB
subtask0_5.txt AC 91 ms 1832 KB
subtask0_6.txt AC 109 ms 1836 KB
subtask0_7.txt AC 81 ms 1700 KB
subtask0_8.txt AC 99 ms 1956 KB
subtask0_9.txt AC 125 ms 1952 KB