# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
514812 | 79brue | 요리 강좌 (KOI17_cook) | C++14 | 831 ms | 123928 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;
typedef long long ll;
int n, m, s, e; ll t; /// m: 학원 수, n: 강좌 수
ll arr[3002][3002];
ll sum[3002][3002];
int prv[3002];
list<pair<int, ll> > lst[3002];
vector<pair<ll, int> > vec;
ll DP[3002][3002];
ll ans = LLONG_MAX;
int main(){
scanf("%d %d %d %d %lld", &m, &n, &s, &e, &t);
for(int i=1; i<=m; i++) for(int j=1; j<=n; j++) scanf("%lld", &arr[j][i]), sum[j][i] = sum[j-1][i] + arr[j][i];
for(int i=1; i<=m; i++) scanf("%d", &prv[i]);
for(int i=1; i<=m; i++) lst[i].push_back(make_pair(-1, 1e18));
for(int i=1; i<=n; i++){
/// DP 값을 덱에 반영한다.
if(i >= s){
vec.clear();
for(int j=1; j<=m; j++) vec.push_back(make_pair(DP[i-s][j], j));
sort(vec.begin(), vec.end());
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... |