Submission #30543033

Source Code Expand

// Subtask1: O(MQ)

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)

int N, M;
int A[5005];
int main() {
    cin >> N >> M;
    assert(M <= 5000);
    rep(i, M) cin >> A[i];
    int Q;
    cin >> Q;
    assert(Q <= 5000);
    while (Q--) {
        int S, T;
        cin >> S >> T;
        ll ans = 0;
        rep(i, M - 1) {
            int p = A[i], q = A[i + 1];
            if (p > q) swap(p, q);
            ans += min(abs(A[i + 1] - A[i]), abs(S - p) + 1 + abs(q - T));
        }
        cout << ans << endl;
    }
}

Submission Info

Submission Time
Task F - ワープ
User define
Language C++ (GCC 9.2.1)
Score 20
Code Size 615 Byte
Status RE
Exec Time 121 ms
Memory 3548 KiB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3 Subtask4 Subtask5 Subtask6
Score / Max Score 0 / 0 20 / 20 0 / 50 0 / 100 0 / 280 0 / 300 0 / 50
Status
AC × 3
AC × 7
RE × 7
RE × 14
RE × 21
AC × 7
RE × 7
AC × 10
RE × 35
Set Name Test Cases
Sample example_1.txt, example_2.txt, example_3.txt
Subtask1 sub1_0.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt
Subtask2 sub2_0.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt
Subtask3 sub2_0.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub3_0.txt, sub3_1.txt, sub3_2.txt, sub3_3.txt, sub3_4.txt, sub3_5.txt, sub3_6.txt
Subtask4 sub2_0.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub3_0.txt, sub3_1.txt, sub3_2.txt, sub3_3.txt, sub3_4.txt, sub3_5.txt, sub3_6.txt, sub4_0.txt, sub4_1.txt, sub4_2.txt, sub4_3.txt, sub4_4.txt, sub4_5.txt, sub4_6.txt
Subtask5 sub1_0.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub5_0.txt, sub5_1.txt, sub5_2.txt, sub5_3.txt, sub5_4.txt, sub5_5.txt, sub5_6.txt
Subtask6 example_1.txt, example_2.txt, example_3.txt, sub1_0.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub2_0.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub3_0.txt, sub3_1.txt, sub3_2.txt, sub3_3.txt, sub3_4.txt, sub3_5.txt, sub3_6.txt, sub4_0.txt, sub4_1.txt, sub4_2.txt, sub4_3.txt, sub4_4.txt, sub4_5.txt, sub4_6.txt, sub5_0.txt, sub5_1.txt, sub5_2.txt, sub5_3.txt, sub5_4.txt, sub5_5.txt, sub5_6.txt, sub6_0.txt, sub6_1.txt, sub6_2.txt, sub6_3.txt, sub6_4.txt, sub6_5.txt, sub6_6.txt
Case Name Status Exec Time Memory
example_1.txt AC 7 ms 3492 KiB
example_2.txt AC 2 ms 3356 KiB
example_3.txt AC 3 ms 3448 KiB
sub1_0.txt AC 114 ms 3372 KiB
sub1_1.txt AC 118 ms 3356 KiB
sub1_2.txt AC 114 ms 3464 KiB
sub1_3.txt AC 121 ms 3416 KiB
sub1_4.txt AC 113 ms 3548 KiB
sub1_5.txt AC 113 ms 3500 KiB
sub1_6.txt AC 115 ms 3396 KiB
sub2_0.txt RE 103 ms 3292 KiB
sub2_1.txt RE 102 ms 3412 KiB
sub2_2.txt RE 104 ms 3312 KiB
sub2_3.txt RE 104 ms 3384 KiB
sub2_4.txt RE 103 ms 3292 KiB
sub2_5.txt RE 104 ms 3292 KiB
sub2_6.txt RE 105 ms 3416 KiB
sub3_0.txt RE 104 ms 3436 KiB
sub3_1.txt RE 105 ms 3280 KiB
sub3_2.txt RE 103 ms 3428 KiB
sub3_3.txt RE 102 ms 3380 KiB
sub3_4.txt RE 103 ms 3272 KiB
sub3_5.txt RE 104 ms 3384 KiB
sub3_6.txt RE 102 ms 3280 KiB
sub4_0.txt RE 102 ms 3428 KiB
sub4_1.txt RE 100 ms 3432 KiB
sub4_2.txt RE 102 ms 3284 KiB
sub4_3.txt RE 103 ms 3296 KiB
sub4_4.txt RE 103 ms 3272 KiB
sub4_5.txt RE 103 ms 3432 KiB
sub4_6.txt RE 102 ms 3380 KiB
sub5_0.txt RE 106 ms 3368 KiB
sub5_1.txt RE 100 ms 3316 KiB
sub5_2.txt RE 102 ms 3380 KiB
sub5_3.txt RE 102 ms 3380 KiB
sub5_4.txt RE 102 ms 3368 KiB
sub5_5.txt RE 100 ms 3372 KiB
sub5_6.txt RE 101 ms 3272 KiB
sub6_0.txt RE 102 ms 3412 KiB
sub6_1.txt RE 101 ms 3292 KiB
sub6_2.txt RE 98 ms 3264 KiB
sub6_3.txt RE 104 ms 3292 KiB
sub6_4.txt RE 102 ms 3300 KiB
sub6_5.txt RE 102 ms 3412 KiB
sub6_6.txt RE 107 ms 3296 KiB