# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56223 | andy0220 | 요리 강좌 (KOI17_cook) | C++11 | 814 ms | 284592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int N, M, S, E, T;
int A[3001][3001], B[3001];
int D[3001][3001], C[3001][3001];
struct Z{
int v, t;
} mn[3001][3];
deque <Z> dq[3001];
int get_min(int day, int academy)
{
if (mn[day][0].t != academy && mn[day][0].t != B[academy]) return mn[day][0].v;
if (mn[day][1].t != academy && mn[day][1].t != B[academy]) return mn[day][1].v;
return mn[day][2].v;
}
int main()
{
scanf("%d%d%d%d%d", &N, &M, &S, &E, &T);
for (int i=1;i<=N;i++) for (int j=1;j<=M;j++) scanf("%d", A[i]+j);
for (int i=1;i<=N;i++) scanf("%d", B+i);
for (int i=1;i<=N;i++) for (int j=1;j<=M;j++) C[i][j] = C[i][j-1] + A[i][j];
for (int i=1;i<=M;i++){
for (int j=1;j<=N;j++){
if (i >= S){
int v = get_min(i-S, j) - C[j][i-S];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |