Submission #2403634
Source Code Expand
#include <iostream> #include <algorithm> #include <utility> using namespace std; int A[100002]; int main(){ int N; cin >> N; for(int i=0;i<N;++i){ cin >> A[i+1]; } int dist = 0; for(int i=0;i<N+1;++i){ dist += abs(A[i+1] - A[i]); } for(int i=1;i<N+1;++i){ if(( A[i-1] <= A[i] && A[i] <= A[i+1] )||( A[i-1] >= A[i] && A[i] >= A[i+1] )){ cout << dist << endl; }else{ cout << dist - min(abs(A[i+1]-A[i]),abs(A[i]-A[i-1]))*2 << endl; } } }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | terakun |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 513 Byte |
Status | AC |
Exec Time | 200 ms |
Memory | 1664 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 187 ms | 1664 KB |
02.txt | AC | 200 ms | 1664 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 191 ms | 1664 KB |
05.txt | AC | 189 ms | 1664 KB |
06.txt | AC | 193 ms | 1664 KB |
07.txt | AC | 193 ms | 1664 KB |
08.txt | AC | 190 ms | 1664 KB |
09.txt | AC | 181 ms | 1280 KB |
10.txt | AC | 180 ms | 1280 KB |
11.txt | AC | 180 ms | 1280 KB |
12.txt | AC | 180 ms | 1280 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |