# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124486 | DJ035 | 요리 강좌 (KOI17_cook) | C++14 | 577 ms | 78052 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>
#define OO 1987654321
using namespace std;
int N,M,S,E,T;
int A[3003][3003],B[3003];
int C[3003][3003],DP[3003][3003];
deque<pair<int,int> > dq[3003];
pair<int,int> mn[3003][3];
int get_min(int day, int academy){
if(mn[day][0].second != academy && mn[day][0].second != B[academy]){
return mn[day][0].first;
}
if(mn[day][1].second != academy && mn[day][1].second != B[academy]){
return mn[day][1].first;
}
return mn[day][2].first;
}
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]);
C[i][j] = C[i][j-1]+A[i][j];
}
}
for(int i = 1;i<=N;i++){
scanf("%d",&B[i]);
}
for(int i = 1;i<=M;i++){
for(int j = 1;j<=N;j++){
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... |