Submission #3248108


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main()
{
  uint64_t N, K;
  cin >> N >> K;
  
  vector<int64_t> x(N);
  for (uint64_t n = 0; n < N; ++n) {
    cin >> x[n];
  }
  
  vector<int64_t> s(N - K + 1, 0);
  for (uint64_t i = 0; i <= N - K; ++i) {
    s[i] = (x[i + K - 1] - x[i]) + std::abs(x[i]);
  }
  
  int64_t min = INT64_MAX;
  for (uint64_t i = 0; i <= N - K; ++i) {
    min = std::min(s[i], min);
  }
  
  cout << min << endl;
  
  return 0;
}

Submission Info

Submission Time
Task C - Candles
User material
Language C++14 (GCC 5.4.1)
Score 0
Code Size 491 Byte
Status WA
Exec Time 42 ms
Memory 1408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 9
WA × 3
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 39 ms 1024 KB
1_01.txt AC 40 ms 1408 KB
1_02.txt WA 41 ms 1024 KB
1_03.txt WA 42 ms 1408 KB
1_04.txt AC 38 ms 1024 KB
1_05.txt AC 38 ms 1408 KB
1_06.txt AC 39 ms 1280 KB
1_07.txt WA 40 ms 1280 KB