| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 338127 | beksultan04 | Skyline (IZhO11_skyline) | C++14 | 222 ms | 193900 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 int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+11,INF=1e9+7;
int q[N],n,dp[304][201][201],vis[305][201][201];
int rec(int j,int x,int y){
    if (j > n)ret 0;
    if (vis[j][x][y])ret dp[j][x][y];
    vis[j][x][y]=1;
    if (x == 0){
        dp[j][x][y] = rec(j+1,y,q[j+2]);
    }
    else {
        dp[j][x][y] = rec(j,x-1,y)+3;
        if (y > 0){
            dp[j][x][y] = min(dp[j][x][y],rec(j,x-1,y-1)+5);
        }
        if (x <= y && x <= q[j+2]){
            dp[j][x][y] = min(dp[j][x][y],rec(j+1,y-x,q[j+2]-x)+7*x);
        }
    }
    ret dp[j][x][y];
}
main(){
    int i,j;
    scan1(n)
    for (i=1;i<=n;++i)
        scan1(q[i])
    cout <<rec(1,q[1],q[2]);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
