oj.uz

답안 #547900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547900 2022-04-12T01:52:36 Z farhan132 스카이라인 (IZhO11_skyline) C++17
100 / 100
 198 ms 227268 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
const ll N = 305;

ll dp[N][N][N];
ll h[N];
ll n;

ll DP(ll x, ll y, ll z){
    if(x == n + 1){
        if(y == z && y == 0) return 0;
        return 1e18;
    }
    if(~dp[x][y][z]) return dp[x][y][z];
    ll &ret = dp[x][y][z];
    ret = 1e18;
    if(h[x] < y || y < z){
        return ret = 1e18;
    }
    ret = min(ret, DP(x, y+1,z+1));
    ret = min(ret, DP(x, y, z+1));
    ret = min(ret, z + DP(x + 1, h[x] - z, y - z));
    return ret;
}

void solve(){

   cin >> n;

   ll sum = 0;

   for(ll i = 1; i <= n; i++) cin >> h[i], sum += h[i];

   mem(dp, -1);

   cout << 2 * sum + DP(1, 0, 0) << '\n';

    
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre();
 
    ll T = 1, CT = 0; // cin >> T; 
 
    while(T--){
       //  cout << "Case #" << ++CT <<": " ;
        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

skyline.cpp: In function 'int main()':
skyline.cpp:119:15: warning: unused variable 'CT' [-Wunused-variable]
  119 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 222284 KB Output is correct
2 Correct 86 ms 222284 KB Output is correct
3 Correct 96 ms 222300 KB Output is correct
4 Correct 94 ms 222392 KB Output is correct
5 Correct 86 ms 222300 KB Output is correct
6 Correct 84 ms 222392 KB Output is correct
7 Correct 85 ms 222424 KB Output is correct
8 Correct 98 ms 222396 KB Output is correct
9 Correct 95 ms 222388 KB Output is correct
10 Correct 103 ms 222588 KB Output is correct
11 Correct 98 ms 223472 KB Output is correct
12 Correct 93 ms 222600 KB Output is correct
13 Correct 113 ms 223560 KB Output is correct
14 Correct 114 ms 224060 KB Output is correct
15 Correct 158 ms 226060 KB Output is correct
16 Correct 173 ms 225804 KB Output is correct
17 Correct 197 ms 227268 KB Output is correct
18 Correct 186 ms 226888 KB Output is correct
19 Correct 182 ms 226616 KB Output is correct
20 Correct 198 ms 227092 KB Output is correct