Submission #1679649
Source Code Expand
#include<iostream> #include<map> #include<set> #include<string> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<stack> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef int itn; const int inf = 99999999; const ll linf = 999999999999999999; const double pi = acos(-1); const int dx[4]={1,0,-1,0}; const int dy[4]={0,1,0,-1}; #define p_queue(i) priority_queue<i> #define rp_queue(i) priority_queue<i, vector<i>, greater<i>> #define P(p) cout<<(p)<<endl #define rep(i,m,n) for(int i = (m); i < (int)(n); i++) #define mod(i) ((i)%(ll)(1e9 + 7)) #define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5)))) #define rsort(a,b,c) sort(a, b, greater<c>()) #define vsort(v) sort(v.begin(), v.end()); #define rvsort(v) sort(v.end(), v.begin()); #define ft first #define sd second #define pb push_back #define it insert #define sz(x) ((int)(x).size()) #define lb(a,n,k) (lower_bound(a,a+n,k) - a) #define vlb(a,k) (lower_bound(a.begin(),a.end(),k) - a.begin()) #define YES cout<<"YES"<< endl #define NO cout<<"NO"<<endl #define Yes cout<<"Yes"<<endl #define No cout<<"No"<<endl #define yes cout<<"yes"<<endl #define no cout<<"no"<<endl #define ret return ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;} ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } //ll ncr[100][100]; //ll nCr(int n, int r){if(n==r) ret ncr[n][r] = 1; if(r==0) ret ncr[n][r] = 1; if(r==1) ret ncr[n][r] = n;if(ncr[n][r]) ret ncr[n][r]; ret ncr[n][r] = nCr(n-1,r) + nCr(n-1,r-1);} //ll npr[100][100]={}; //ll nPr(int n,int r){if(npr[n][r])ret npr[n][r];if(r==0)ret npr[n][r] = 1;if(r==1)ret npr[n][r] = n;ret npr[n][r] = n * nPr(n-1,r-1);} //ll nHr(int n,int r){ret nCr(n+r-1,r);} /////////////////////////////////////////////////////////////////////////// ll n,h,a,b,c,d,e; ll dfs(ll nn, ll hh){ ll ans = linf; if(nn >= n)ret 0; if(hh - e > 0){ ans = dfs(nn+1,hh - e); }else{ ans = min(dfs(nn+1,hh+b)+a,dfs(nn+1,hh+d)+c); } //P(ans); ret ans; } int main(){ cin >> n >> h >> a >> b >> c >> d >> e; P(dfs(0,h)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 節制 |
User | hirata0517masato |
Language | C++14 (GCC 5.4.1) |
Score | 10 |
Code Size | 2296 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 12160 KB |
Judge Result
Set Name | Subtask1 | Subtask2 | Subtask3 | Subtask4 | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 10 / 10 | 0 / 30 | 0 / 60 | 0 / 1 | ||||||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Subtask1 | sample_1.txt, sample_2.txt, sample_3.txt, 01_010.txt, 01_011.txt, 01_020.txt, 01_021.txt, 01_100.txt, 01_101.txt, 01_110.txt, 01_111.txt, 01_200.txt, 01_201.txt, 01_220.txt, 01_221.txt, 01_random01.txt, 01_random02.txt, 01_random03.txt, 01_random04.txt, 01_random05.txt, 01_random06.txt, 01_random07.txt, 01_random08.txt, 01_random09.txt, 01_random10.txt |
Subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, 02_010.txt, 02_011.txt, 02_020.txt, 02_021.txt, 02_100.txt, 02_101.txt, 02_110.txt, 02_111.txt, 02_200.txt, 02_201.txt, 02_220.txt, 02_221.txt, 02_random01.txt, 02_random02.txt, 02_random03.txt, 02_random04.txt, 02_random05.txt, 02_random06.txt, 02_random07.txt, 02_random08.txt, 02_random09.txt, 02_random10.txt |
Subtask3 | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, 01_010.txt, 01_011.txt, 01_020.txt, 01_021.txt, 01_100.txt, 01_101.txt, 01_110.txt, 01_111.txt, 01_200.txt, 01_201.txt, 01_220.txt, 01_221.txt, 01_random01.txt, 01_random02.txt, 01_random03.txt, 01_random04.txt, 01_random05.txt, 01_random06.txt, 01_random07.txt, 01_random08.txt, 01_random09.txt, 01_random10.txt, 02_010.txt, 02_011.txt, 02_020.txt, 02_021.txt, 02_100.txt, 02_101.txt, 02_110.txt, 02_111.txt, 02_200.txt, 02_201.txt, 02_220.txt, 02_221.txt, 02_random01.txt, 02_random02.txt, 02_random03.txt, 02_random04.txt, 02_random05.txt, 02_random06.txt, 02_random07.txt, 02_random08.txt, 02_random09.txt, 02_random10.txt, 03_010.txt, 03_011.txt, 03_012.txt, 03_020.txt, 03_021.txt, 03_022.txt, 03_100.txt, 03_101.txt, 03_102.txt, 03_110.txt, 03_111.txt, 03_112.txt, 03_200.txt, 03_201.txt, 03_202.txt, 03_220.txt, 03_221.txt, 03_222.txt, 03_random01.txt, 03_random02.txt, 03_random03.txt, 03_random04.txt, 03_random05.txt, 03_random06.txt, 03_random07.txt, 03_random08.txt, 03_random09.txt, 03_random10.txt, 03_random11.txt, 03_random12.txt, 03_random13.txt, 03_random14.txt, 03_random15.txt, 03_random16.txt, 03_random17.txt, 03_random18.txt, 03_random19.txt, 03_random20.txt |
Subtask4 | 01_010.txt, 01_011.txt, 01_020.txt, 01_021.txt, 01_100.txt, 01_101.txt, 01_110.txt, 01_111.txt, 01_200.txt, 01_201.txt, 01_220.txt, 01_221.txt, 01_random01.txt, 01_random02.txt, 01_random03.txt, 01_random04.txt, 01_random05.txt, 01_random06.txt, 01_random07.txt, 01_random08.txt, 01_random09.txt, 01_random10.txt, 02_010.txt, 02_011.txt, 02_020.txt, 02_021.txt, 02_100.txt, 02_101.txt, 02_110.txt, 02_111.txt, 02_200.txt, 02_201.txt, 02_220.txt, 02_221.txt, 02_random01.txt, 02_random02.txt, 02_random03.txt, 02_random04.txt, 02_random05.txt, 02_random06.txt, 02_random07.txt, 02_random08.txt, 02_random09.txt, 02_random10.txt, 03_010.txt, 03_011.txt, 03_012.txt, 03_020.txt, 03_021.txt, 03_022.txt, 03_100.txt, 03_101.txt, 03_102.txt, 03_110.txt, 03_111.txt, 03_112.txt, 03_200.txt, 03_201.txt, 03_202.txt, 03_220.txt, 03_221.txt, 03_222.txt, 03_random01.txt, 03_random02.txt, 03_random03.txt, 03_random04.txt, 03_random05.txt, 03_random06.txt, 03_random07.txt, 03_random08.txt, 03_random09.txt, 03_random10.txt, 03_random11.txt, 03_random12.txt, 03_random13.txt, 03_random14.txt, 03_random15.txt, 03_random16.txt, 03_random17.txt, 03_random18.txt, 03_random19.txt, 03_random20.txt, 04_010.txt, 04_011.txt, 04_020.txt, 04_021.txt, 04_100.txt, 04_101.txt, 04_110.txt, 04_111.txt, 04_200.txt, 04_201.txt, 04_220.txt, 04_221.txt, 04_random01.txt, 04_random02.txt, 04_random03.txt, 04_random04.txt, 04_random05.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01_010.txt | AC | 1 ms | 256 KB |
01_011.txt | AC | 1 ms | 256 KB |
01_020.txt | AC | 1 ms | 256 KB |
01_021.txt | AC | 1 ms | 256 KB |
01_100.txt | AC | 1 ms | 256 KB |
01_101.txt | AC | 1 ms | 256 KB |
01_110.txt | AC | 1 ms | 256 KB |
01_111.txt | AC | 1 ms | 256 KB |
01_200.txt | AC | 1 ms | 256 KB |
01_201.txt | AC | 1 ms | 256 KB |
01_220.txt | AC | 1 ms | 256 KB |
01_221.txt | AC | 1 ms | 256 KB |
01_random01.txt | AC | 1 ms | 256 KB |
01_random02.txt | AC | 1 ms | 256 KB |
01_random03.txt | AC | 1 ms | 256 KB |
01_random04.txt | AC | 1 ms | 256 KB |
01_random05.txt | AC | 1 ms | 256 KB |
01_random06.txt | AC | 1 ms | 256 KB |
01_random07.txt | AC | 1 ms | 256 KB |
01_random08.txt | AC | 1 ms | 256 KB |
01_random09.txt | AC | 1 ms | 256 KB |
01_random10.txt | AC | 1 ms | 256 KB |
02_010.txt | TLE | 2103 ms | 256 KB |
02_011.txt | TLE | 2103 ms | 256 KB |
02_020.txt | AC | 1 ms | 256 KB |
02_021.txt | TLE | 2103 ms | 256 KB |
02_100.txt | TLE | 2103 ms | 256 KB |
02_101.txt | AC | 2 ms | 256 KB |
02_110.txt | AC | 1 ms | 256 KB |
02_111.txt | AC | 407 ms | 256 KB |
02_200.txt | TLE | 2103 ms | 256 KB |
02_201.txt | AC | 1 ms | 256 KB |
02_220.txt | AC | 1 ms | 256 KB |
02_221.txt | AC | 86 ms | 256 KB |
02_random01.txt | AC | 1 ms | 256 KB |
02_random02.txt | AC | 18 ms | 256 KB |
02_random03.txt | AC | 1 ms | 256 KB |
02_random04.txt | AC | 259 ms | 256 KB |
02_random05.txt | TLE | 2103 ms | 256 KB |
02_random06.txt | AC | 1 ms | 256 KB |
02_random07.txt | AC | 2 ms | 256 KB |
02_random08.txt | AC | 1 ms | 256 KB |
02_random09.txt | AC | 2 ms | 256 KB |
02_random10.txt | AC | 2 ms | 256 KB |
03_010.txt | TLE | 2103 ms | 256 KB |
03_011.txt | TLE | 2103 ms | 256 KB |
03_012.txt | TLE | 2103 ms | 256 KB |
03_020.txt | TLE | 2103 ms | 256 KB |
03_021.txt | TLE | 2103 ms | 256 KB |
03_022.txt | TLE | 2103 ms | 256 KB |
03_100.txt | TLE | 2103 ms | 256 KB |
03_101.txt | TLE | 2103 ms | 256 KB |
03_102.txt | TLE | 2103 ms | 256 KB |
03_110.txt | TLE | 2103 ms | 256 KB |
03_111.txt | TLE | 2103 ms | 256 KB |
03_112.txt | TLE | 2103 ms | 256 KB |
03_200.txt | TLE | 2103 ms | 256 KB |
03_201.txt | TLE | 2103 ms | 256 KB |
03_202.txt | TLE | 2103 ms | 256 KB |
03_220.txt | TLE | 2103 ms | 256 KB |
03_221.txt | TLE | 2103 ms | 256 KB |
03_222.txt | TLE | 2103 ms | 256 KB |
03_random01.txt | TLE | 2103 ms | 256 KB |
03_random02.txt | AC | 1 ms | 256 KB |
03_random03.txt | TLE | 2103 ms | 256 KB |
03_random04.txt | TLE | 2103 ms | 256 KB |
03_random05.txt | AC | 1 ms | 256 KB |
03_random06.txt | TLE | 2103 ms | 256 KB |
03_random07.txt | TLE | 2103 ms | 256 KB |
03_random08.txt | TLE | 2103 ms | 256 KB |
03_random09.txt | TLE | 2103 ms | 256 KB |
03_random10.txt | AC | 1 ms | 256 KB |
03_random11.txt | TLE | 2103 ms | 256 KB |
03_random12.txt | TLE | 2103 ms | 256 KB |
03_random13.txt | TLE | 2103 ms | 256 KB |
03_random14.txt | TLE | 2103 ms | 256 KB |
03_random15.txt | AC | 1 ms | 256 KB |
03_random16.txt | TLE | 2103 ms | 256 KB |
03_random17.txt | TLE | 2103 ms | 256 KB |
03_random18.txt | TLE | 2103 ms | 256 KB |
03_random19.txt | TLE | 2103 ms | 256 KB |
03_random20.txt | AC | 1 ms | 256 KB |
04_010.txt | TLE | 2104 ms | 6016 KB |
04_011.txt | TLE | 2104 ms | 11776 KB |
04_020.txt | TLE | 2104 ms | 10112 KB |
04_021.txt | TLE | 2103 ms | 11520 KB |
04_100.txt | TLE | 2104 ms | 12160 KB |
04_101.txt | TLE | 2104 ms | 3456 KB |
04_110.txt | TLE | 2104 ms | 7424 KB |
04_111.txt | TLE | 2103 ms | 4992 KB |
04_200.txt | TLE | 2103 ms | 896 KB |
04_201.txt | TLE | 2103 ms | 256 KB |
04_220.txt | TLE | 2103 ms | 3584 KB |
04_221.txt | TLE | 2106 ms | 9472 KB |
04_random01.txt | TLE | 2103 ms | 640 KB |
04_random02.txt | TLE | 2103 ms | 2560 KB |
04_random03.txt | TLE | 2104 ms | 3968 KB |
04_random04.txt | TLE | 2104 ms | 3328 KB |
04_random05.txt | TLE | 2103 ms | 2304 KB |
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
sample_4.txt | TLE | 2103 ms | 256 KB |