Submission #1366113
Source Code Expand
//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[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 Info
Submission Time | |
---|---|
Task | D - Shik and Game |
User | xuanquang1999 |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 1611 Byte |
Status | AC |
Exec Time | 42 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | 600 / 600 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
Subtask1 | 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_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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
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 | AC | 2 ms | 256 KB |
1_01.txt | AC | 2 ms | 256 KB |
1_02.txt | AC | 2 ms | 256 KB |
1_03.txt | AC | 2 ms | 256 KB |
1_04.txt | AC | 2 ms | 256 KB |
1_05.txt | AC | 2 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 2 ms | 256 KB |
1_08.txt | AC | 2 ms | 256 KB |
1_09.txt | AC | 2 ms | 256 KB |
1_10.txt | AC | 2 ms | 256 KB |
1_11.txt | AC | 2 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 2 ms | 256 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 2 ms | 256 KB |
1_17.txt | AC | 2 ms | 256 KB |
1_18.txt | AC | 1 ms | 256 KB |
1_19.txt | AC | 2 ms | 256 KB |
2_00.txt | AC | 34 ms | 2560 KB |
2_01.txt | AC | 35 ms | 2560 KB |
2_02.txt | AC | 36 ms | 2560 KB |
2_03.txt | AC | 34 ms | 2560 KB |
2_04.txt | AC | 34 ms | 2560 KB |
2_05.txt | AC | 34 ms | 2560 KB |
2_06.txt | AC | 34 ms | 2560 KB |
2_07.txt | AC | 34 ms | 2560 KB |
2_08.txt | AC | 34 ms | 2560 KB |
2_09.txt | AC | 34 ms | 2560 KB |
2_10.txt | AC | 41 ms | 2560 KB |
2_11.txt | AC | 41 ms | 2560 KB |
2_12.txt | AC | 41 ms | 2560 KB |
2_13.txt | AC | 41 ms | 2560 KB |
2_14.txt | AC | 41 ms | 2560 KB |
2_15.txt | AC | 41 ms | 2560 KB |
2_16.txt | AC | 41 ms | 2560 KB |
2_17.txt | AC | 41 ms | 2560 KB |
2_18.txt | AC | 41 ms | 2560 KB |
2_19.txt | AC | 41 ms | 2560 KB |
2_20.txt | AC | 41 ms | 2560 KB |
2_21.txt | AC | 41 ms | 2560 KB |
2_22.txt | AC | 42 ms | 2560 KB |
2_23.txt | AC | 42 ms | 2560 KB |
2_24.txt | AC | 42 ms | 2560 KB |
2_25.txt | AC | 42 ms | 2560 KB |
2_26.txt | AC | 42 ms | 2560 KB |
2_27.txt | AC | 42 ms | 2560 KB |
2_28.txt | AC | 42 ms | 2560 KB |
2_29.txt | AC | 42 ms | 2560 KB |
2_30.txt | AC | 42 ms | 2560 KB |
2_31.txt | AC | 42 ms | 2560 KB |
2_32.txt | AC | 42 ms | 2560 KB |
2_33.txt | AC | 42 ms | 2560 KB |
2_34.txt | AC | 41 ms | 2560 KB |
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 | 42 ms | 2560 KB |
2_39.txt | AC | 41 ms | 2560 KB |
2_40.txt | AC | 41 ms | 2560 KB |