Submission #130119

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
130119	2019-07-14 04:01:14	aer0park	요리 강좌 (KOI17_cook)	C++14	0 / 100	3 ms	1272 KiB

cook

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
ll n,m,s,e,t,mnc[3005],anw=1e15;
ll dp[3005][3005];  // i번쨰 학원에서 j번 강좌까지를 끝마쳤을때 최소비용 즉 무조건 학원바꿈 
int ck[3005][3005],x[3005],c[3005][3005],pc[3005][3005]; // c:i번쨰 학원에서  j번강좌를 들을 경우 비용  pc:i번쨰 학원에서 j번강좌까지를 들을 경우 비용    
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin>>n>>m>>s>>e>>t;
  for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)
      cin>>c[i][j],pc[i][j]=pc[i][j-1]+c[i][j];
  for(int i=1;i<=n;i++)
    cin>>x[i];
  for(int i=0;i<=n;i++)
    for(int j=0;j<=m;j++)
      dp[i][j]=1e15; 
  for(int i=1;i<=n;i++)
    dp[i][0]=-t;
  for(int i=0;i<=m;i++)
  {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 13
• Subtask 2: 0 / 9
• Subtask 3: 0 / 11
• Subtask 4: 0 / 23
• Subtask 5: 0 / 44