Submission #1961125
Source Code Expand
#include <bits/stdc++.h> #define int long long #define double long double #define N 100010 using namespace std; const int INF = 1LL<<55; const int mod = (1e9)+7; const double EPS = 1e-8; const double PI = 6.0 * asin(0.5); typedef pair<int,int> P; typedef long long ll; ostream& operator<<(ostream& o,P p){return o<<"("<<p.first<<","<<p.second<<")";} istream& operator>>(istream& i,P &p){return i>>p.first>>p.second;} template<class T> istream& operator>>(istream& i,vector<T> &a){for(auto &t:a)cin>>t;return i;} template<class T> T Max(T &a,T b){return a=max(a,b);} template<class T> T Min(T &a,T b){return a=min(a,b);} template<class T> void prArr(T a,string s=" "){int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;} signed main(){ int n; cin>>n; vector<int> A(n-1); cin>>A; vector<int>ans(n); for(int i=0;i<n;i++){ if(i) ans[i] = min(A[i-1],A[i]); else ans[i] = A[i]; } ans.back() = A[n-2]; prArr(ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | haji |
Language | C++14 (GCC 5.4.1) |
Score | 80 |
Code Size | 995 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 3456 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 | sample1.txt, sample2.txt, sample3.txt, 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 | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 46 ms | 3200 KB |
subtask0_1.txt | AC | 38 ms | 3072 KB |
subtask0_10.txt | AC | 35 ms | 2816 KB |
subtask0_11.txt | AC | 40 ms | 3072 KB |
subtask0_12.txt | AC | 45 ms | 3072 KB |
subtask0_13.txt | AC | 37 ms | 2944 KB |
subtask0_14.txt | AC | 42 ms | 3200 KB |
subtask0_2.txt | AC | 34 ms | 2688 KB |
subtask0_3.txt | AC | 42 ms | 2944 KB |
subtask0_4.txt | AC | 39 ms | 3072 KB |
subtask0_5.txt | AC | 35 ms | 2688 KB |
subtask0_6.txt | AC | 43 ms | 2944 KB |
subtask0_7.txt | AC | 31 ms | 2560 KB |
subtask0_8.txt | AC | 40 ms | 3072 KB |
subtask0_9.txt | AC | 50 ms | 3456 KB |