Submission #2870265


Source Code Expand

#include <algorithm>
#include <cassert>
// #include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
// #include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

/*
unsigned seed1 = std::chrono::system_clock::now().time_since_epoch().count();
mt19937 g1.seed(seed1);
*/
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<pii, pii> ppiipii;
typedef pair<int, ppiipii> pippiipii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> ppiii;
typedef pair<int, ppiii> pippiii;
typedef pair<int, ll> pill;
typedef pair<int, double> pid;
typedef pair<string, string> pss;
// note to self, the below two triggers someone
typedef pair<ll, ll> pll;
typedef pair<ll, int> plli;
typedef long double ld;

int l[100005];

int main() {
  int n;
  scanf("%d", &n);
  for(int i = 1; i <= n; i++) {
    scanf("%d", &l[i]);
  }
  int total = 0;
  for(int i = 1; i <= n+1; i++) {
    total += abs(l[i] - l[i-1]);
  }
  for(int i = 1; i <= n; i++) {
    int skip = abs(l[i+1] - l[i-1]) - abs(l[i+1] - l[i]) - abs(l[i] - l[i-1]);
    printf("%d\n", total + skip);
  }
}

Submission Info

Submission Time
Task C - Traveling Plan
User xiaowuc1
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1360 Byte
Status AC
Exec Time 20 ms
Memory 1664 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
./Main.cpp:49:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &l[i]);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 15
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 19 ms 1664 KB
02.txt AC 20 ms 1664 KB
03.txt AC 1 ms 256 KB
04.txt AC 19 ms 1664 KB
05.txt AC 20 ms 1664 KB
06.txt AC 19 ms 1664 KB
07.txt AC 20 ms 1664 KB
08.txt AC 19 ms 1664 KB
09.txt AC 18 ms 1280 KB
10.txt AC 18 ms 1280 KB
11.txt AC 18 ms 1280 KB
12.txt AC 18 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