AtCoder Grand Contest 007

Submission #1366107

Source codeソースコード

//84104971101048411497 - Can you guess what does this mean?
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef complex<double> point;
#define mapii map<int, int>
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); ++i)
#define forit(it, var) for(__typeof(var.begin()) it = var.begin(); it != var.end(); it++)
#define forrit(rit, var) for(__typeof(var.rbegin()) rit = var.rbegin(); rit != var.rend(); rit++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define maxN 100005
#define oo 2000000007
#define sz(a) (int)a.size()

const double PI = acos(-1.0);

double fRand(double fMin, double fMax)
{
    double f = (double)rand() / RAND_MAX;
    return fMin + f * (fMax - fMin);
}

template <class T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}

template <class T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}

int n;
ll E, T, dp[maxN], minF[maxN], x[maxN];

int main () {
    cin >> n >> E >> T;
    fto(i, 1, n) cin >> x[i];
    x[n+1] = E;

    dp[0] = x[1];
    int j = 1;
    fto(i, 1, n) {
        while (2*(x[i]-x[j]) >= T) ++j;
        dp[i] = dp[j-1] + x[i+1] + x[i] - 2*x[j] + T;
        if (j > 1) dp[i] = min(dp[i], minF[j-1] + x[i+1] + 2*x[i]);
        minF[i] = min(minF[i-1], dp[i-1]-3*x[i]);
    }

    printf("%lld", dp[n]);

    return 0;
}

Submission

Task問題 D - Shik and Game
User nameユーザ名 xuanquang1999
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 1620 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt
Subtask1 0 / 600 0_00.txt,0_01.txt,0_02.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,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt
All 0 / 600 0_00.txt,0_01.txt,0_02.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,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt,2_00.txt,2_01.txt,2_02.txt,2_03.txt,2_04.txt,2_05.txt,2_06.txt,2_07.txt,2_08.txt,2_09.txt,2_10.txt,2_11.txt,2_12.txt,2_13.txt,2_14.txt,2_15.txt,2_16.txt,2_17.txt,2_18.txt,2_19.txt,2_20.txt,2_21.txt,2_22.txt,2_23.txt,2_24.txt,2_25.txt,2_26.txt,2_27.txt,2_28.txt,2_29.txt,2_30.txt,2_31.txt,2_32.txt,2_33.txt,2_34.txt,2_35.txt,2_36.txt,2_37.txt,2_38.txt,2_39.txt,2_40.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt WA
1_01.txt WA
1_02.txt WA
1_03.txt WA
1_04.txt WA
1_05.txt WA
1_06.txt WA
1_07.txt WA
1_08.txt WA
1_09.txt WA
1_10.txt WA
1_11.txt WA
1_12.txt WA
1_13.txt WA
1_14.txt WA
1_15.txt AC 1 ms 256 KB
1_16.txt WA
1_17.txt WA
1_18.txt AC 1 ms 256 KB
1_19.txt AC 2 ms 256 KB
2_00.txt AC 34 ms 2688 KB
2_01.txt AC 34 ms 2560 KB
2_02.txt WA
2_03.txt WA
2_04.txt WA
2_05.txt WA
2_06.txt WA
2_07.txt WA
2_08.txt WA
2_09.txt WA
2_10.txt WA
2_11.txt WA
2_12.txt WA
2_13.txt WA
2_14.txt WA
2_15.txt WA
2_16.txt WA
2_17.txt WA
2_18.txt WA
2_19.txt WA
2_20.txt WA
2_21.txt WA
2_22.txt WA
2_23.txt WA
2_24.txt WA
2_25.txt WA
2_26.txt WA
2_27.txt WA
2_28.txt WA
2_29.txt WA
2_30.txt WA
2_31.txt AC 42 ms 2560 KB
2_32.txt AC 41 ms 2560 KB
2_33.txt AC 42 ms 2560 KB
2_34.txt WA
2_35.txt AC 42 ms 2560 KB
2_36.txt AC 42 ms 2560 KB
2_37.txt AC 41 ms 2560 KB
2_38.txt AC 43 ms 2560 KB
2_39.txt AC 41 ms 2560 KB
2_40.txt AC 42 ms 2560 KB