# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156047 | puppies_and_rainbows | 도장 모으기 (JOI14_stamps) | C++14 | 175 ms | 71268 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 int long long
using namespace std;
int n, t, dp[3005][3005];
int u[3005], v[3005], d[3005], e[3005];
signed main()
{
cin>>n>>t;
for(int i=0; i<=n; i++)
{
dp[0][i]=100000000000000;
}
dp[0][1]=0;
for(int i=1; i<=n; i++)
{
cin>>u[i]>>v[i]>>d[i]>>e[i];
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(j==1)
{
dp[i][j]=dp[i-1][j]+u[i]+v[i];
}
else
{
dp[i][j]=dp[i-1][j]+min(u[i]+v[i], d[i]+e[i]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |