Submission #18229866

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint1000000007;

int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<int> a_vec(N);
    for (int i = 0; i < N; ++i)
        cin >> a_vec.at(i);
    vector<mint> cost(N, 0);
    for (int i = 0; i < N - 1; ++i) 
        cost.at(i + 1) = mint(a_vec.at(i)).pow(a_vec.at(i + 1)) + cost.at(i);
    vector<int> c_vec(Q + 2, 0);
    for (int i = 1; i < Q + 1; ++i) {
        int c;
        cin >> c;
        --c;
        c_vec.at(i) = c;
    }
    mint sum(0);
    for (int i = 1; i < Q + 2; ++i) {
        int c1 = c_vec.at(i - 1);
        int c2 = c_vec.at(i);
        if (c2 > c1)
            sum += cost.at(c2) - cost.at(c1);
        else
            sum += cost.at(c1) - cost.at(c2);
    }
    cout << sum.val() << endl;
}

Submission Info

Submission Time
Task E - 散歩 (E869120 and Path Length)
User atug
Language C++ (GCC 9.2.1)
Score 100
Code Size 821 Byte
Status AC
Exec Time 85 ms
Memory 4540 KiB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 15 / 15 35 / 35 50 / 50
Status
AC × 2
AC × 6
AC × 10
AC × 14
Set Name Test Cases
Sample sample1.txt, sample2.txt
Subtask1 sample1.txt, sample2.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt
Subtask2 sample1.txt, sample2.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt
Subtask3 sample1.txt, sample2.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub3_1.txt, sub3_2.txt, sub3_3.txt, sub3_4.txt
Case Name Status Exec Time Memory
sample1.txt AC 10 ms 3420 KiB
sample2.txt AC 2 ms 3484 KiB
sub1_1.txt AC 2 ms 3484 KiB
sub1_2.txt AC 3 ms 3420 KiB
sub1_3.txt AC 2 ms 3568 KiB
sub1_4.txt AC 3 ms 3444 KiB
sub2_1.txt AC 2 ms 3440 KiB
sub2_2.txt AC 3 ms 3556 KiB
sub2_3.txt AC 4 ms 3504 KiB
sub2_4.txt AC 6 ms 3564 KiB
sub3_1.txt AC 19 ms 3732 KiB
sub3_2.txt AC 42 ms 3700 KiB
sub3_3.txt AC 85 ms 4540 KiB
sub3_4.txt AC 85 ms 4428 KiB