Submission #61817477

Source Code Expand

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

using ll = long long;

#define rep(i, n) for(int i = 0; (i) < (int)(n); ++(i))
#define rep_r(i, n) for(int i = (int)(n) - 1; (i) >= 0; --(i))
#define all(x) begin(x), end(x)

int main() {
    // input
    int Q;
    cin >> Q;
    vector<int> q(Q), l(Q), k(Q);
    rep(i, Q) {
        cin >> q[i];
        if(q[i] == 1) cin >> l[i];
        if(q[i] == 3) cin >> k[i];
    }

    // calc and output
    deque<ll> snakes, sum_snakes(1);
    ll diff = 0;
    rep(i, Q) {
        if(q[i] == 1) {
            snakes.push_back(l[i]);

            if(i == 0)
                sum_snakes.push_back(l[i]);
            else
                sum_snakes.push_back(sum_snakes.back() + l[i]);
        } else if(q[i] == 2) {
            diff += snakes.front();
            snakes.pop_front();
            sum_snakes.pop_front();
        } else {
            ll result = sum_snakes[k[i] - 1] - diff;
            cout << result << endl;
        }
    }
}

Submission Info

Submission Time
Task C - Snake Queue
User Koreander
Language C++ 23 (gcc 12.2)
Score 300
Code Size 1032 Byte
Status AC
Exec Time 234 ms
Memory 11644 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 33
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 02_min_00.txt, 02_min_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3504 KiB
00_sample_01.txt AC 1 ms 3568 KiB
00_sample_02.txt AC 1 ms 3512 KiB
01_test_00.txt AC 1 ms 3508 KiB
01_test_01.txt AC 2 ms 3596 KiB
01_test_02.txt AC 4 ms 3704 KiB
01_test_03.txt AC 4 ms 3600 KiB
01_test_04.txt AC 1 ms 3484 KiB
01_test_05.txt AC 4 ms 3716 KiB
01_test_06.txt AC 224 ms 7868 KiB
01_test_07.txt AC 108 ms 5488 KiB
01_test_08.txt AC 223 ms 7932 KiB
01_test_09.txt AC 195 ms 7380 KiB
01_test_10.txt AC 224 ms 7924 KiB
01_test_11.txt AC 90 ms 5264 KiB
01_test_12.txt AC 223 ms 7916 KiB
01_test_13.txt AC 85 ms 5124 KiB
01_test_14.txt AC 222 ms 7924 KiB
01_test_15.txt AC 165 ms 8472 KiB
01_test_16.txt AC 161 ms 8392 KiB
01_test_17.txt AC 162 ms 8376 KiB
01_test_18.txt AC 138 ms 9244 KiB
01_test_19.txt AC 133 ms 9264 KiB
01_test_20.txt AC 134 ms 9204 KiB
01_test_21.txt AC 134 ms 9188 KiB
01_test_22.txt AC 231 ms 9176 KiB
01_test_23.txt AC 234 ms 9340 KiB
01_test_24.txt AC 108 ms 11644 KiB
01_test_25.txt AC 56 ms 11620 KiB
01_test_26.txt AC 106 ms 11560 KiB
01_test_27.txt AC 67 ms 6536 KiB
02_min_00.txt AC 1 ms 3496 KiB
02_min_01.txt AC 1 ms 3508 KiB