Submission #241894

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
241894	2020-06-26 09:17:46	jjwdi0	요리 강좌 (KOI17_cook)	C++11	100 / 100	807 ms	66424 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>
using namespace std;
using pr = pair<int, int>;
int N, M, S, E, T, D[3005][3005];
int sum[3005][3005], imp[3005], mn[3005][3];
deque<pr> dq[3005];
priority_queue<pr, vector<pr>, greater<pr>> pq;
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> N >> M >> S >> E >> T;
  for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) {
    cin >> sum[i][j];
    sum[i][j] += sum[i][j-1];
  }
  for(int i=1; i<=N; i++) cin >> imp[i];
  for(int i=1; i<=N; i++) D[i][0] = -T;
  for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) D[i][j] = 1e9;
  for(int j=S; j<=M+S-1; j++) {
    while(!pq.empty()) pq.pop();
    for(int i=1; i<=N; i++) pq.push(pr(D[i][j-S], i));
    int x = pq.top().second; pq.pop();
    int y = pq.top().second; pq.pop();
    int z = pq.top().second; pq.pop();
    for(int i=1; i<=N; i++) {
      int cur = 0;
      if(x != imp[i] && x != i) cur = D[x][j-S];
      else if(y != imp[i] && y != i) cur = D[y][j-S];
      else cur = D[z][j-S];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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