Submission #616137


Source Code Expand

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int n;
  cin>>n;
  vector<int> a(n-1),re(n);
  rep(i,n-1) cin>>a[i];
  vector<pii> b(n-1);
  rep(i,n-1) b[i]=pii(a[i],i);
  sort(rall(b));
  for(pii p:b){
    re[p.Y]=re[p.Y+1]=p.X;
  }
  rep(i,n){
    if(i)cout<<" ";
    cout<<re[i];
  }
  return 0;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User nuip
Language C++11 (GCC 4.9.2)
Score 80
Code Size 1602 Byte
Status AC
Exec Time 75 ms
Memory 2340 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 27 ms 932 KB
sample2.txt AC 24 ms 804 KB
sample3.txt AC 26 ms 812 KB
subtask0_0.txt AC 69 ms 2084 KB
subtask0_1.txt AC 59 ms 2336 KB
subtask0_10.txt AC 57 ms 2208 KB
subtask0_11.txt AC 61 ms 2208 KB
subtask0_12.txt AC 68 ms 2072 KB
subtask0_13.txt AC 56 ms 2208 KB
subtask0_14.txt AC 64 ms 2336 KB
subtask0_2.txt AC 57 ms 2088 KB
subtask0_3.txt AC 65 ms 2080 KB
subtask0_4.txt AC 60 ms 2340 KB
subtask0_5.txt AC 57 ms 2084 KB
subtask0_6.txt AC 65 ms 2080 KB
subtask0_7.txt AC 54 ms 2088 KB
subtask0_8.txt AC 60 ms 2212 KB
subtask0_9.txt AC 75 ms 2336 KB