AtCoder Beginner Contest 013

Submission #1679675

Source codeソースコード

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define vector_rsort(x) sort(all(x));reverse(all(x))
#define array_rsort(x,n) sort(x,x+n);reverse(x,x+n);
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define Yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define NO cout<<"NO"<<endl
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
/*---------------------------------------------------*/

ll a,b,c,d,e;
ll cost=0;

int dfs(int cost,int h,int day){
  if(day==0){
    //cout<<cost<<" "<<h<<endl;
    return cost;
  }else{
    if(0<=h-e)return dfs(cost,h-e,day-1);
    else return min(dfs(cost+a,h+b,day-1),dfs(cost+c,h+d,day-1));
  }
}

int main(){
  ll n,h;
  cin>>n>>h;
  cin>>a>>b>>c>>d>>e;
  cout<<dfs(0,h,n)<<endl;
  return 0;
}

Submission

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

Test case

Set

Set name Score得点 / Max score Cases
Subtask1 0 / 10 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 0 / 30 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 0 / 60 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 0 / 1 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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
02_011.txt TLE
02_020.txt AC 1 ms 256 KB
02_021.txt TLE
02_100.txt TLE
02_101.txt AC 2 ms 256 KB
02_110.txt WA
02_111.txt AC 400 ms 256 KB
02_200.txt TLE
02_201.txt AC 1 ms 256 KB
02_220.txt AC 1 ms 256 KB
02_221.txt AC 84 ms 384 KB
02_random01.txt AC 1 ms 256 KB
02_random02.txt AC 16 ms 256 KB
02_random03.txt AC 1 ms 256 KB
02_random04.txt WA
02_random05.txt TLE
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
03_011.txt TLE
03_012.txt TLE
03_020.txt TLE
03_021.txt TLE
03_022.txt TLE
03_100.txt TLE
03_101.txt TLE
03_102.txt TLE
03_110.txt TLE
03_111.txt TLE
03_112.txt TLE
03_200.txt TLE
03_201.txt TLE
03_202.txt TLE
03_220.txt TLE
03_221.txt TLE
03_222.txt TLE
03_random01.txt TLE
03_random02.txt AC 1 ms 256 KB
03_random03.txt TLE
03_random04.txt TLE
03_random05.txt AC 1 ms 256 KB
03_random06.txt TLE
03_random07.txt TLE
03_random08.txt TLE
03_random09.txt TLE
03_random10.txt AC 1 ms 256 KB
03_random11.txt TLE
03_random12.txt TLE
03_random13.txt TLE
03_random14.txt TLE
03_random15.txt AC 1 ms 256 KB
03_random16.txt TLE
03_random17.txt TLE
03_random18.txt TLE
03_random19.txt TLE
03_random20.txt AC 1 ms 256 KB
04_010.txt TLE
04_011.txt TLE
04_020.txt TLE
04_021.txt TLE
04_100.txt TLE
04_101.txt TLE
04_110.txt TLE
04_111.txt TLE
04_200.txt TLE
04_201.txt TLE
04_220.txt TLE
04_221.txt TLE
04_random01.txt TLE
04_random02.txt TLE
04_random03.txt TLE
04_random04.txt TLE
04_random05.txt TLE
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt WA
sample_4.txt TLE