oj.uz

답안 #949757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949757 2024-03-19T15:56:52 Z steveonalex Discharging (NOI20_discharging) C++14
72 / 100
 1000 ms 22728 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e6 + 69;
const ll INF = 1e18 + 69;
int n;
ll a[N];
ll dp[N];

namespace Sub2{
    void solve(){
        reverse(a + 1, a + n + 1);
        memset(dp, 63, sizeof dp);
        dp[0] = 0;
        for(int i = 1; i<=n; ++i){
            ll ma = 0;
            for(int j = i; j>=1; --j){
                maximize(ma, a[j]);
                minimize(dp[i], dp[j-1] + 1LL * ma * i);
            }
        }

        cout << dp[n] << "\n";
        exit(0);
    }
}
namespace Sub4{
    bool check(){
        for(int i = 1; i<n; ++i) if (a[i] < a[i+1]) return false;
        return true;
    }

    void solve(){
        cout << a[1] * n << "\n";
        exit(0);
    }
}

namespace Sub3{
    bool check(){
        for(int i = 1; i<n; ++i) if (a[i] > a[i+1]) return false;
        return true;
    }

    struct CHT{
        #define Line pair<ll, ll>

        vector<Line> a;
        vector<double> bubble;

        CHT(){
        }

        double get_intersection(Line a, Line b){
            return (double) (b.second - a.second) / (a.first - b.first);
        }

        void add(Line f){
            if (a.size() && a.back().first == f.first) return;
            if (a.empty()) {a.push_back(f); return;}
            while(bubble.size()){
                double x = bubble.back(), y = get_intersection(a.back(), f);
                if (x >= y){
                    a.pop_back(); bubble.pop_back();
                }
                else break;
            }
            bubble.push_back(get_intersection(a.back(), f));
            a.push_back(f);
        }

        ll get(ll x){
            int idx = lower_bound(ALL(bubble), x) - bubble.begin();
            return a[idx].first * x + a[idx].second;
        }
    };

    void solve(){
        reverse(a + 1, a + n + 1);
        CHT hull_min;
        memset(dp, 63, sizeof dp);
        dp[0] = 0;
        for(int i = 1; i<=n; ++i){
            hull_min.add(make_pair(a[i], dp[i-1]));
            dp[i] = hull_min.get(i);
        }

        cout << dp[n] << "\n";

        exit(0);
    }
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;
    for(int i= 1; i<=n; ++i) cin >> a[i];

    if (Sub4::check()) Sub4::solve();
    if (Sub3::check()) Sub3::solve();
    Sub2::solve();

    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8656 KB Output is correct
14 Correct 5 ms 8796 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8948 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8672 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 2 ms 8804 KB Output is correct
12 Correct 3 ms 8792 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 3 ms 8796 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8948 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8672 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 2 ms 8792 KB Output is correct
11 Correct 2 ms 8804 KB Output is correct
12 Correct 3 ms 8792 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 3 ms 8796 KB Output is correct
16 Correct 79 ms 19988 KB Output is correct
17 Correct 75 ms 21840 KB Output is correct
18 Correct 70 ms 20328 KB Output is correct
19 Correct 73 ms 21844 KB Output is correct
20 Correct 73 ms 21588 KB Output is correct
21 Correct 73 ms 21880 KB Output is correct
22 Correct 71 ms 21332 KB Output is correct
23 Correct 78 ms 22472 KB Output is correct
24 Correct 74 ms 21840 KB Output is correct
25 Correct 77 ms 22376 KB Output is correct
26 Correct 80 ms 22728 KB Output is correct
27 Correct 68 ms 21060 KB Output is correct
28 Correct 75 ms 21840 KB Output is correct
29 Correct 79 ms 21956 KB Output is correct
30 Correct 81 ms 22464 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 17420 KB Output is correct
2 Correct 81 ms 17280 KB Output is correct
3 Correct 123 ms 17396 KB Output is correct
4 Correct 95 ms 17340 KB Output is correct
5 Correct 87 ms 17264 KB Output is correct
6 Correct 82 ms 17408 KB Output is correct
7 Correct 84 ms 17492 KB Output is correct
8 Correct 86 ms 17304 KB Output is correct
9 Correct 81 ms 17320 KB Output is correct
10 Correct 83 ms 17236 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8656 KB Output is correct
14 Correct 5 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 3 ms 8796 KB Output is correct
18 Correct 2 ms 8948 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Correct 2 ms 8672 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 3 ms 8796 KB Output is correct
24 Correct 2 ms 8792 KB Output is correct
25 Correct 2 ms 8804 KB Output is correct
26 Correct 3 ms 8792 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 2 ms 8796 KB Output is correct
29 Correct 3 ms 8796 KB Output is correct
30 Correct 3 ms 8792 KB Output is correct
31 Correct 3 ms 8796 KB Output is correct
32 Correct 4 ms 8796 KB Output is correct
33 Correct 3 ms 8796 KB Output is correct
34 Correct 3 ms 8792 KB Output is correct
35 Correct 4 ms 8796 KB Output is correct
36 Correct 3 ms 8796 KB Output is correct
37 Correct 3 ms 8796 KB Output is correct
38 Correct 3 ms 8796 KB Output is correct
39 Correct 3 ms 8796 KB Output is correct
40 Correct 4 ms 8860 KB Output is correct
41 Correct 3 ms 8796 KB Output is correct
42 Correct 3 ms 8664 KB Output is correct
43 Correct 2 ms 8796 KB Output is correct
44 Correct 4 ms 8796 KB Output is correct
45 Correct 3 ms 8796 KB Output is correct
46 Correct 3 ms 8660 KB Output is correct
47 Correct 3 ms 8796 KB Output is correct
48 Correct 3 ms 8796 KB Output is correct
49 Correct 3 ms 8796 KB Output is correct
50 Correct 4 ms 8796 KB Output is correct

Subtask #6
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8656 KB Output is correct
14 Correct 5 ms 8796 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 3 ms 8796 KB Output is correct
18 Correct 2 ms 8948 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Correct 2 ms 8672 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 3 ms 8796 KB Output is correct
24 Correct 2 ms 8792 KB Output is correct
25 Correct 2 ms 8804 KB Output is correct
26 Correct 3 ms 8792 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 2 ms 8796 KB Output is correct
29 Correct 3 ms 8796 KB Output is correct
30 Correct 79 ms 19988 KB Output is correct
31 Correct 75 ms 21840 KB Output is correct
32 Correct 70 ms 20328 KB Output is correct
33 Correct 73 ms 21844 KB Output is correct
34 Correct 73 ms 21588 KB Output is correct
35 Correct 73 ms 21880 KB Output is correct
36 Correct 71 ms 21332 KB Output is correct
37 Correct 78 ms 22472 KB Output is correct
38 Correct 74 ms 21840 KB Output is correct
39 Correct 77 ms 22376 KB Output is correct
40 Correct 80 ms 22728 KB Output is correct
41 Correct 68 ms 21060 KB Output is correct
42 Correct 75 ms 21840 KB Output is correct
43 Correct 79 ms 21956 KB Output is correct
44 Correct 81 ms 22464 KB Output is correct
45 Correct 89 ms 17420 KB Output is correct
46 Correct 81 ms 17280 KB Output is correct
47 Correct 123 ms 17396 KB Output is correct
48 Correct 95 ms 17340 KB Output is correct
49 Correct 87 ms 17264 KB Output is correct
50 Correct 82 ms 17408 KB Output is correct
51 Correct 84 ms 17492 KB Output is correct
52 Correct 86 ms 17304 KB Output is correct
53 Correct 81 ms 17320 KB Output is correct
54 Correct 83 ms 17236 KB Output is correct
55 Correct 3 ms 8792 KB Output is correct
56 Correct 3 ms 8796 KB Output is correct
57 Correct 4 ms 8796 KB Output is correct
58 Correct 3 ms 8796 KB Output is correct
59 Correct 3 ms 8792 KB Output is correct
60 Correct 4 ms 8796 KB Output is correct
61 Correct 3 ms 8796 KB Output is correct
62 Correct 3 ms 8796 KB Output is correct
63 Correct 3 ms 8796 KB Output is correct
64 Correct 3 ms 8796 KB Output is correct
65 Correct 4 ms 8860 KB Output is correct
66 Correct 3 ms 8796 KB Output is correct
67 Correct 3 ms 8664 KB Output is correct
68 Correct 2 ms 8796 KB Output is correct
69 Correct 4 ms 8796 KB Output is correct
70 Correct 3 ms 8796 KB Output is correct
71 Correct 3 ms 8660 KB Output is correct
72 Correct 3 ms 8796 KB Output is correct
73 Correct 3 ms 8796 KB Output is correct
74 Correct 3 ms 8796 KB Output is correct
75 Correct 4 ms 8796 KB Output is correct
76 Execution timed out 1052 ms 22100 KB Time limit exceeded
77 Halted 0 ms 0 KB -