Submission #5033737
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int main(){ int N; cin >> N; int A[10000]; bool change[10000]; A[0] = 0, A[N + 1] = 0; for (int i = 1; i <= N; i++){ cin >> A[i]; change[i] = false; } int distance = 0; for (int i = 1; i <= N + 1; i++){ distance += abs(A[i] - A[i - 1]); } for (int i = 1; i <= N; i++){ if((A[i + 1] - A[i]) * (A[i] - A[i - 1]) < 0){ cout << distance - abs(A[i + 1] - A[i]) - abs(A[i] - A[i - 1]) + abs(A[i + 1] - A[i - 1]) << endl; change[i] = true; } else cout << distance << endl; } //cout << distance << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | HAL_Neuron |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 727 Byte |
Status | RE |
Exec Time | 98 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 96 ms | 256 KB |
02.txt | RE | 97 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | RE | 96 ms | 256 KB |
05.txt | RE | 96 ms | 256 KB |
06.txt | RE | 97 ms | 256 KB |
07.txt | RE | 96 ms | 256 KB |
08.txt | RE | 98 ms | 256 KB |
09.txt | RE | 96 ms | 256 KB |
10.txt | RE | 96 ms | 256 KB |
11.txt | RE | 96 ms | 256 KB |
12.txt | RE | 96 ms | 256 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 |