Submission #7443466


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/

int N, A[20], B[20], C[20];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    rep(i, 0, N) cin >> A[i], A[i]--;
    rep(i, 0, N) cin >> B[i];
    rep(i, 0, N - 1) cin >> C[i];

    int ans = 0;
    int pre = -2;
    rep(i, 0, N) {
        int eat = A[i];
        ans += B[eat];
        if(pre + 1 == eat) ans += C[eat - 1];
        pre = eat;
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task B - Buffet
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1691 Byte
Status
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Score / Max Score Test Cases
All 200 / 200 sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10
Sample 0 / 0 sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 1 ms 256 KB
sample_02 1 ms 256 KB
sample_03 1 ms 256 KB
testcase_01 1 ms 256 KB
testcase_02 1 ms 256 KB
testcase_03 1 ms 256 KB
testcase_04 1 ms 256 KB
testcase_05 1 ms 256 KB
testcase_06 1 ms 256 KB
testcase_07 1 ms 256 KB
testcase_08 1 ms 256 KB
testcase_09 1 ms 256 KB
testcase_10 1 ms 256 KB