# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101232 | knon0501 | 요리 강좌 (KOI17_cook) | C++14 | 674 ms | 77632 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;
#define f first
#define s second
int n,m;
int s,e,t;
pair<int,int> dm[3005][3];
int d[3005][3005];
deque<pair<int,int>> deq[3005];
int ss[3005][3005];
int b[3005];
int a[3005][3005];
int main(){
int i,j;
scanf("%d %d %d %d %d",&n,&m,&s,&e,&t);
for(i=1 ; i<=n ; i++)for(j=1 ; j<=m ; j++)scanf("%d",&a[i][j]);
for(i=1 ; i<=n ; i++)scanf("%d",&b[i]);
for(i=1 ; i<=n ; i++)for(j=1 ; j<=m ; j++)ss[i][j]=ss[i][j-1]+a[i][j];
for(i=1 ; i<=n ; i++)deq[i].push_front(make_pair(-t,0));
for(i=1 ; i<=m ; i++)for(j=0 ; j<3 ; j++)dm[i][j].f=2e9;
for(i=s ;i<=m ; i++){
for(j=1 ; j<=n ; j++){
while(deq[j].front().s<i-e){
deq[j].pop_front();
}
/// if(deq[j].empty())printf("!!!!!!!");
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... |