# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79997 | leejseo | 요리 강좌 (KOI17_cook) | C++11 | 4 ms | 2396 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;
const int INF = 1e9;
int N, M, S, E, T, M_;
int C[3001][6001], F[3001];
int D[3001][6001];
int A[3001][6001];
int B[3001][6001];
typedef pair<int, int> pii;
deque<pii> que[3001];
void readint(int &number){
bool negative = false;
register int c;
number = 0;
c = getchar();
for (;(c>47 && c<58);c=getchar()) number = number *10 + c - 48;
if (negative) number *= -1;
}
void init(){
readint(N); readint(M); readint(S); readint(E); readint(T);
M = M_+S-1;
for (int i=1; i<=N; i++)
for (int j=1; j<=M_; j++) readint(C[i][j]);
# | 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... |