Submission #922843
Source Code Expand
#include<iostream> #include<string.h> #include<string> #include<cstdio> #include<algorithm> #include<stack> #include<queue> #include<vector> #include<cmath> #include<utility> #include<set> #define ll long long int #define ld long double #define INF 1000000000 #define EPS 0.0000000001 #define rep(i,n) for(i=0;i<n;i++) using namespace std; typedef pair<int, int> P; int main() { int n; int i; int a[100005]; cin>>n; a[0]=INF; for(i=1;i<n;i++) cin>>a[i]; a[i]=INF; rep(i,n){ cout<<min(a[i],a[i+1]); if(i<n-1)cout<<" "; } cout<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | rika0384 |
Language | C++ (GCC 4.9.2) |
Score | 80 |
Code Size | 606 Byte |
Status | AC |
Exec Time | 73 ms |
Memory | 1192 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | ||||
Status |
|
|
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 | 20 ms | 924 KB |
sample2.txt | AC | 17 ms | 800 KB |
sample3.txt | AC | 17 ms | 924 KB |
subtask0_0.txt | AC | 67 ms | 1140 KB |
subtask0_1.txt | AC | 58 ms | 1184 KB |
subtask0_10.txt | AC | 54 ms | 1120 KB |
subtask0_11.txt | AC | 58 ms | 1140 KB |
subtask0_12.txt | AC | 68 ms | 1060 KB |
subtask0_13.txt | AC | 56 ms | 1048 KB |
subtask0_14.txt | AC | 61 ms | 1192 KB |
subtask0_2.txt | AC | 54 ms | 1052 KB |
subtask0_3.txt | AC | 64 ms | 1056 KB |
subtask0_4.txt | AC | 55 ms | 1188 KB |
subtask0_5.txt | AC | 54 ms | 1012 KB |
subtask0_6.txt | AC | 68 ms | 1052 KB |
subtask0_7.txt | AC | 51 ms | 1060 KB |
subtask0_8.txt | AC | 59 ms | 1056 KB |
subtask0_9.txt | AC | 73 ms | 1120 KB |