# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1031949 | gs25 | 요리 강좌 (KOI17_cook) | C++17 | 455 ms | 163124 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 all(v) (v).begin(), (v).end()
using namespace std;
const int MAXN = 3010;
typedef long long ll;
ll dp[MAXN][MAXN], dp1[MAXN][MAXN], dp2[MAXN][MAXN];
ll T;
ll psum[MAXN][MAXN];
int f[MAXN];
const ll inf = 1e18;
int main(void){
ios::sync_with_stdio(false); cin.tie(nullptr);
int n,m; cin >> n >> m;
int s,e; cin >> s >> e;
cin >> T;
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
int x; cin >> x; psum[i][j] = psum[i][j-1] + x;
}
}
for(int i=1; i<=n; i++) cin >> f[i];
for(int i=1; i<=n; i++) dp1[i][0] = -T;
deque<pair<ll,int>> dq[MAXN];
deque<pair<ll,int>> dq1[MAXN];
for(int i=1; i<=n; i++){
dq[i].push_back({-T,0});
if(s==1) dq1[i].push_back({-T,0});
# | 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... |