Submission #3246910


Source Code Expand

#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<long long> x(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i];

    }
    if (n == 1) {
        cout << abs(x[0]) << endl;
        return 0;
    }
    long long minx = 10000000000;

    for (int left = 0; left + k - 1 < n; left++) {
        int right = left + k - 1;
        long long cost = 0;
        if (x[left] >= 0) {
            cost = x[right];
        }
        else if (x[right] >= 0) {
            cost = x[right] - x[left] + min(x[right], -x[left]);
        }
        else {
            cost = -x[left];
        }
        minx = min(minx, cost);
    }
    cout << minx << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Candles
User peradfn1126
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1179 Byte
Status AC
Exec Time 41 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 12
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 39 ms 1024 KB
1_02.txt AC 41 ms 1024 KB
1_03.txt AC 41 ms 1024 KB
1_04.txt AC 38 ms 1024 KB
1_05.txt AC 37 ms 1024 KB
1_06.txt AC 38 ms 1024 KB
1_07.txt AC 40 ms 1024 KB