Submission #1306560
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,int> plli; typedef pair<int,pii> pipii; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<vi> vvi; typedef vector<vvi> vvvi; typedef vector<pii> vpii; #define rep(i,n) for (int i=0;i<(n);i++) #define rep2(i,a,b) for (int i=(a);i<(b);i++) #define rrep(i,n) for (int i=(n);i>=0;i--) #define rrep2(i,a,b) for (int i=(a);i>b;i--) #define pb push_back #define fi first #define se second #define all(a) (a).begin(),(a).end() const ll mod = 1e9 + 7; const ll INF = 1<<30; const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, 1, 0, -1}; const double pi = 3.141592653589793; ll n,e,t; ll x[2005]; ll dp[2005][2005]; int main(){ cin.tie(0); ios::sync_with_stdio(false); cin >> n >> e >> t; if (n>2000) return 0; rep(i,n) cin >> x[i+1]; rep(i,n+2)rep(j,n+2) dp[i][j]=1e15; dp[0][0]=0; rep(i,n+1){ ll nx=x[i+1]-x[i]; rep(j,i+1){ dp[i+1][j]=min(dp[i+1][j],dp[i][j]+nx); if (i==j) continue; if (2*(x[i]-x[j+1])>=t){ dp[i][i]=min(dp[i][i],dp[i][j]+2*(x[i]-x[j+1])); } else{ dp[i][i]=min(dp[i][i],dp[i][j]+t); } /* if (2*(x[i+1]-x[j])>=t){ dp[i+1][j]=min(dp[i+1][j],dp[i+1][j-1]+x[i+1]-x[j]); } else{ dp[i+1][j]=min(dp[i+1][j],dp[i+1][j-1]+t-(x[i+1]-x[j])); } */ /* if (2*(x[i]-x[j])>=t) { dp[i+1][j]=min(dp[i+1][j],dp[i][j-1]+nx+2*(x[i]-x[j])); } else { dp[i+1][j]=min(dp[i+1][j],dp[i][j-1]+nx+t); } */ } } //rep(i,n+1)rep(j,n+1) cout << dp[i][j] << endl; //cout << dp[2][2] << endl; cout << dp[n][n]+e-x[n] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Shik and Game |
User | roto_37 |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 2071 Byte |
Status | WA |
Exec Time | 15 ms |
Memory | 31360 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | 0 / 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 | 14 ms | 28928 KB |
1_01.txt | AC | 11 ms | 24832 KB |
1_02.txt | AC | 11 ms | 24832 KB |
1_03.txt | AC | 14 ms | 28928 KB |
1_04.txt | AC | 8 ms | 18304 KB |
1_05.txt | AC | 10 ms | 22656 KB |
1_06.txt | AC | 9 ms | 20480 KB |
1_07.txt | AC | 10 ms | 22784 KB |
1_08.txt | AC | 11 ms | 24832 KB |
1_09.txt | AC | 9 ms | 20608 KB |
1_10.txt | AC | 15 ms | 30976 KB |
1_11.txt | AC | 9 ms | 20480 KB |
1_12.txt | AC | 8 ms | 18304 KB |
1_13.txt | AC | 15 ms | 31360 KB |
1_14.txt | AC | 8 ms | 18304 KB |
1_15.txt | AC | 8 ms | 18304 KB |
1_16.txt | AC | 8 ms | 20480 KB |
1_17.txt | AC | 11 ms | 24832 KB |
1_18.txt | AC | 7 ms | 16256 KB |
1_19.txt | AC | 12 ms | 24832 KB |
2_00.txt | WA | 1 ms | 256 KB |
2_01.txt | WA | 1 ms | 256 KB |
2_02.txt | WA | 1 ms | 256 KB |
2_03.txt | WA | 1 ms | 256 KB |
2_04.txt | WA | 1 ms | 256 KB |
2_05.txt | WA | 1 ms | 256 KB |
2_06.txt | WA | 1 ms | 256 KB |
2_07.txt | WA | 1 ms | 256 KB |
2_08.txt | WA | 1 ms | 256 KB |
2_09.txt | WA | 1 ms | 256 KB |
2_10.txt | WA | 1 ms | 256 KB |
2_11.txt | WA | 1 ms | 256 KB |
2_12.txt | WA | 1 ms | 256 KB |
2_13.txt | WA | 1 ms | 256 KB |
2_14.txt | WA | 1 ms | 256 KB |
2_15.txt | WA | 1 ms | 256 KB |
2_16.txt | WA | 1 ms | 256 KB |
2_17.txt | WA | 1 ms | 256 KB |
2_18.txt | WA | 1 ms | 256 KB |
2_19.txt | WA | 1 ms | 256 KB |
2_20.txt | WA | 1 ms | 256 KB |
2_21.txt | WA | 1 ms | 256 KB |
2_22.txt | WA | 1 ms | 256 KB |
2_23.txt | WA | 1 ms | 256 KB |
2_24.txt | WA | 1 ms | 256 KB |
2_25.txt | WA | 1 ms | 256 KB |
2_26.txt | WA | 1 ms | 256 KB |
2_27.txt | WA | 1 ms | 256 KB |
2_28.txt | WA | 1 ms | 256 KB |
2_29.txt | WA | 1 ms | 256 KB |
2_30.txt | WA | 1 ms | 256 KB |
2_31.txt | WA | 1 ms | 256 KB |
2_32.txt | WA | 1 ms | 256 KB |
2_33.txt | WA | 1 ms | 256 KB |
2_34.txt | WA | 1 ms | 256 KB |
2_35.txt | WA | 1 ms | 256 KB |
2_36.txt | WA | 1 ms | 256 KB |
2_37.txt | WA | 1 ms | 256 KB |
2_38.txt | WA | 1 ms | 256 KB |
2_39.txt | WA | 1 ms | 256 KB |
2_40.txt | WA | 1 ms | 256 KB |