Submission #615994
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <assert.h>
#include <sys/time.h>
#include <fstream>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define REP(i,n) FOR(i,0,n)
#define each(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define deb(x) cerr << #x << " = " << (x) << " , ";
#define debl cerr << " (L" << __LINE__ << ")"<< endl;
#define sz(s) (int)((s).size())
#define clr(a) memset((a),0,sizeof(a))
#define nclr(a) memset((a),-1,sizeof(a))
#define pb push_back
#define INRANGE(x,s,e) ((s)<=(x) && (x)<(e))
#define MP(x,y) make_pair((x),(y))
double pi=3.14159265358979323846;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
template<typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& z){
os << "[ ";
REP(i,z.size())os << z[i] << ", " ;
return ( os << "]" << endl);
}
template<typename T> std::ostream& operator<<(std::ostream& os, const set<T>& z){
os << "set( ";
EACH(p,z)os << (*p) << ", " ;
return ( os << ")" << endl);
}
template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const map<T,U>& z){
os << "{ ";
EACH(p,z)os << (p->first) << ": " << (p->second) << ", " ;
return ( os << "}" << endl);
}
template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const pair<T,U>& z){
return ( os << "(" << z.first << ", " << z.second << ",)" );
}
double get_time(){
struct timeval tv;
gettimeofday(&tv, NULL);
return tv.tv_sec + tv.tv_usec*1e-6;
}
typedef unsigned int uint32_t;
struct RND{
uint32_t x;
uint32_t y;
uint32_t z;
uint32_t w;
RND(){
x=123456789;
y=362436069;
z=521288629;
w=88675123;
}
void init(int seed){
x=123456789;
y=362436069;
z=521288629;
w=seed+100;
REP(i,10)get();
}
uint32_t get(){
uint32_t t;
t=x^(x<<11);
x=y;y=z;z=w;
w=(w^(w>>19))^(t^(t>>8));
return w;
}
};
RND rnd;
void _main(istream &inp){
ll N;
inp >> N;
vl x(N-1);
vl ret;
rep(i,N-1) inp >> x[i];
cout << x[0] << " ";
rep(i,N-2) cout << min(x[i], x[i+1]) << " ";
cout << x[N-2] << endl;
}
int main(){
if(0){
ifstream ifs("test.txt");
_main(ifs);
}
else{
_main(cin);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 積み鉛筆 |
User |
hirosegolf |
Language |
C++11 (GCC 4.9.2) |
Score |
80 |
Code Size |
3038 Byte |
Status |
AC |
Exec Time |
113 ms |
Memory |
1568 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 |
27 ms |
928 KB |
sample2.txt |
AC |
26 ms |
800 KB |
sample3.txt |
AC |
24 ms |
928 KB |
subtask0_0.txt |
AC |
107 ms |
1388 KB |
subtask0_1.txt |
AC |
93 ms |
1440 KB |
subtask0_10.txt |
AC |
86 ms |
1560 KB |
subtask0_11.txt |
AC |
94 ms |
1440 KB |
subtask0_12.txt |
AC |
103 ms |
1436 KB |
subtask0_13.txt |
AC |
88 ms |
1568 KB |
subtask0_14.txt |
AC |
98 ms |
1508 KB |
subtask0_2.txt |
AC |
86 ms |
1308 KB |
subtask0_3.txt |
AC |
102 ms |
1436 KB |
subtask0_4.txt |
AC |
94 ms |
1504 KB |
subtask0_5.txt |
AC |
87 ms |
1436 KB |
subtask0_6.txt |
AC |
100 ms |
1440 KB |
subtask0_7.txt |
AC |
84 ms |
1436 KB |
subtask0_8.txt |
AC |
93 ms |
1444 KB |
subtask0_9.txt |
AC |
113 ms |
1428 KB |