Submission #616209
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef pair<int,int> P; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; #define pb push_back #define mp make_pair #define eps 1e-9 #define INF 2000000000 #define sz(x) ((int)(x).size()) #define fi first #define sec second #define all(x) (x).begin(),(x).end() #define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++) #define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++) #define EQ(a,b) (abs((a)-(b))<eps) int N; int A[100100]; int B[100100]; int main(){ scanf("%d",&N); for(int i=0;i<N-1;i++)scanf("%d",&A[i]); B[0]=A[0]; for(int i=1;i<N;i++){ if(B[i-1]!=A[i-1])B[i]=A[i-1]; else if(A[i-1]<A[i])B[i]=A[i-1]; else B[i]=A[i]; } B[N-1]=A[N-2]; for(int i=0;i<N;i++)printf("%d%c",B[i],(i==N-1)?'\n':' '); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | okura |
Language | C++ (GCC 4.9.2) |
Score | 80 |
Code Size | 821 Byte |
Status | AC |
Exec Time | 66 ms |
Memory | 1576 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:22:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:23:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=0;i<N-1;i++)scanf("%d",&A[i]); ^
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 | 24 ms | 924 KB |
sample2.txt | AC | 26 ms | 928 KB |
sample3.txt | AC | 23 ms | 932 KB |
subtask0_0.txt | AC | 62 ms | 1444 KB |
subtask0_1.txt | AC | 60 ms | 1572 KB |
subtask0_10.txt | AC | 57 ms | 1452 KB |
subtask0_11.txt | AC | 60 ms | 1440 KB |
subtask0_12.txt | AC | 61 ms | 1448 KB |
subtask0_13.txt | AC | 57 ms | 1440 KB |
subtask0_14.txt | AC | 62 ms | 1576 KB |
subtask0_2.txt | AC | 55 ms | 1316 KB |
subtask0_3.txt | AC | 61 ms | 1448 KB |
subtask0_4.txt | AC | 61 ms | 1568 KB |
subtask0_5.txt | AC | 56 ms | 1444 KB |
subtask0_6.txt | AC | 61 ms | 1376 KB |
subtask0_7.txt | AC | 52 ms | 1320 KB |
subtask0_8.txt | AC | 61 ms | 1448 KB |
subtask0_9.txt | AC | 66 ms | 1440 KB |