Submission #616171


Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf  1000000007
#define pa pair<int,int>
using namespace std;



int main(){
int n;
int a[10010]={0};
int b[10010]={0};
cin>>n;

for(int i=0;i<n-1;i++) cin>>a[i];
b[0]=a[0];
a[n-1]=inf;
for(int i=1;i<n;i++){
if(b[i-1]==a[i-1]) b[i]=min(a[i-1],a[i]);
else if(b[i-1]<a[i-1]) b[i]=a[i-1];
}

cout<<b[0];
for(int i=1;i<n;i++) cout<<" "<<b[i];
cout<<endl;





return 0;
}

Submission Info

Submission Time
Task B - 積み鉛筆
User smiken
Language C++ (GCC 4.9.2)
Score 0
Code Size 575 Byte
Status RE
Exec Time 490 ms
Memory 924 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
AC × 3
RE × 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 28 ms 872 KB
sample2.txt AC 26 ms 916 KB
sample3.txt AC 25 ms 808 KB
subtask0_0.txt RE 490 ms 796 KB
subtask0_1.txt RE 290 ms 796 KB
subtask0_10.txt RE 291 ms 796 KB
subtask0_11.txt RE 291 ms 924 KB
subtask0_12.txt RE 294 ms 816 KB
subtask0_13.txt RE 292 ms 920 KB
subtask0_14.txt RE 301 ms 824 KB
subtask0_2.txt RE 293 ms 800 KB
subtask0_3.txt RE 295 ms 800 KB
subtask0_4.txt RE 290 ms 920 KB
subtask0_5.txt RE 292 ms 800 KB
subtask0_6.txt RE 295 ms 924 KB
subtask0_7.txt RE 292 ms 924 KB
subtask0_8.txt RE 291 ms 920 KB
subtask0_9.txt RE 295 ms 808 KB