oj.uz

Submission #867349

# Submission time Handle Problem Language Result Execution time Memory
867349 2023-10-28T08:54:17 Z efedmrlr Group Photo (JOI21_ho_t3) C++17
64 / 100
 5000 ms 99200 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
#pragma GCC optimize("O1,O2,O3")
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<int> h, dp;
vector<vector<int> > cost;

struct SegTree {
    vector<int> data;
    int sz;
    SegTree(int sz) {
        this->sz = sz;
        data.assign(4*(sz + 1), 0);
    }
    inline void update(int tl, int tr, int v ,int ind ,int val)  {
        if(tl == tr) {
            data[v] += val;
            return;
        }
        int tm  = (tl + tr) >> 1;
        if(ind <= tm) {
            update(tl, tm, v*2, ind, val);
        }
        else {
            update(tm+1, tr ,v*2+1, ind, val);
        }
        data[v] = data[v*2] + data[v*2+1];
    }
    inline void update(int ind ,int val) {
        update(0, sz, 1, ind ,val);
    }
    inline int query(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) {
            return data[v];
        }
        if(tl > r || tr < l) {
            return 0;
        }
        int tm = (tl + tr) >> 1;
        return query(tl, tm, v*2, l, r) + query(tm+1, tr, v*2+1, l, r);
    }
    inline int query(int l, int r) {
        return query(0, sz, 1, l, r);
    }
    inline int order(int x) {
        return query(0, x);
    }
    inline void insert(int x) {
        if(query(x,x)) return;
        update(x, 1);
    }
    inline void erase(int x) {
        if(query(x,x) == 0) return;
        update(x, -1);
    }
 
};


inline void calc_cost(int x) {
    vector<int> nwh;
    vector<array<int,2> > ord;
    for(int i = 1; i<=n; i++) {
        if(h[i] < x) continue;
        nwh.pb(h[i]);
        ord.pb({h[i] , (int)nwh.size() - 1});
    }
    SegTree st(nwh.size()), st2(nwh.size());
    for(int i = 0; i<nwh.size(); i++) {
        st.insert(i);
    }
    sort(ord.begin(), ord.end());    

    int cst = 0;
    for(int i = 0; i<ord.size(); i++) {
        int deg = st2.query(ord[i][1] + 1, nwh.size());
        st2.insert(ord[i][1]);

        cst += st.order(ord[i][1]) - 1 + (i) - (deg * 2);
        st.erase(ord[i][1]);
        cost[x][ord[i][0]] = cst;
    }   
    
}

inline void solve() {
    cin >> n;
    h.resize(n+1);
    dp.assign(n+1, INF);
    for(int i = 1; i<=n; i++) {
        cin>>h[i];
    }
    cost.assign(n+1, vector<int>(n+1,0));

    for(int i = 1; i<=n; i++) {
    
        calc_cost(i);
    }
    dp[0] = 0;
    for(int i = 1 ;i<=n; i++) {

        for(int j = 0; j<i; j++) {
            dp[i] = min(dp[i] , dp[j] + cost[j+1][i]);
        }
    }

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

}   
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void calc_cost(int)':
Main.cpp:94:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for(int i = 0; i<nwh.size(); i++) {
      |                    ~^~~~~~~~~~~
Main.cpp:100:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for(int i = 0; i<ord.size(); i++) {
      |                    ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 7 ms 604 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 6 ms 600 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 6 ms 632 KB Output is correct
28 Correct 6 ms 604 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 7 ms 604 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 7 ms 604 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 6 ms 600 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 6 ms 632 KB Output is correct
28 Correct 6 ms 604 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 7 ms 604 KB Output is correct
31 Correct 170 ms 3020 KB Output is correct
32 Correct 158 ms 3152 KB Output is correct
33 Correct 158 ms 3024 KB Output is correct
34 Correct 157 ms 2908 KB Output is correct
35 Correct 177 ms 3024 KB Output is correct
36 Correct 159 ms 3040 KB Output is correct
37 Correct 158 ms 3024 KB Output is correct
38 Correct 158 ms 2904 KB Output is correct
39 Correct 160 ms 3028 KB Output is correct
40 Correct 155 ms 3024 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 7 ms 604 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 6 ms 604 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 6 ms 600 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 6 ms 632 KB Output is correct
28 Correct 6 ms 604 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 7 ms 604 KB Output is correct
31 Correct 170 ms 3020 KB Output is correct
32 Correct 158 ms 3152 KB Output is correct
33 Correct 158 ms 3024 KB Output is correct
34 Correct 157 ms 2908 KB Output is correct
35 Correct 177 ms 3024 KB Output is correct
36 Correct 159 ms 3040 KB Output is correct
37 Correct 158 ms 3024 KB Output is correct
38 Correct 158 ms 2904 KB Output is correct
39 Correct 160 ms 3028 KB Output is correct
40 Correct 155 ms 3024 KB Output is correct
41 Execution timed out 5042 ms 99200 KB Time limit exceeded
42 Halted 0 ms 0 KB -