oj.uz

Submission #851757

# Submission time Handle Problem Language Result Execution time Memory
851757 2023-09-20T14:32:40 Z danikoynov Constellation 3 (JOI20_constellation3) C++14
35 / 100
 1500 ms 486752 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

struct poll
{
    ll x, y, c;
    bool operator < (const poll &p) const
    {
        if (y == p.y)
            return x < p.x;
        return y < p.y;
    }
};

const ll maxn = 2e5 + 10;

ll n, m, a[maxn], lc[maxn], rc[maxn];
poll s[maxn];
vector < ll > star[maxn];
vector < ll > dp[maxn];
void input()
{
    cin >> n;
    for (ll i = 1; i <= n; i ++)
        cin >> a[i];

    cin >> m;


    for (ll i = 1; i <= m; i ++)
    {
        cin >> s[i].x >> s[i].y >> s[i].c;
    }

    sort(s + 1, s + m + 1);

    for (ll i = 1; i <= m; i ++)
    {

        star[s[i].x].push_back(i);
    }
}

ll cartesian_tree()
{

    for (ll i = 1; i <= n; i ++)
    {
        lc[i] = rc[i] = -1;
    }

    stack < ll > st;
    for (ll i = 1; i <= n; i ++)
    {
        while(!st.empty() && a[st.top()] < a[i])
        {
            lc[i] = st.top();
            st.pop();
        }

        st.push(i);
    }

    while(!st.empty())
        st.pop();
    for (ll i = n; i > 0; i --)
    {
        while(!st.empty() && a[st.top()] <= a[i])
        {
            rc[i] = st.top();
            st.pop();
        }

        st.push(i);
    }

    ll root;
    while(!st.empty())
    {

        root = st.top();
        st.pop();
    }
    /**cout << "cartesian tree" << endl;
    cout << root << endl;
    for (ll i = 1; i <= n; i ++)
    {
        cout << lc[i] << " " << rc[i] << endl;
    }*/
    return root;
}

const ll inf = 1e18;

ll rev[maxn];
ll temp[maxn];
pair < vector < ll >, vector < ll > > combine(vector < ll > dp_lf, vector < ll > dp_rf,
        vector < ll > ls, vector < ll > rs, ll height)
{

    vector < ll > comb = ls;
    for (ll cur : rs)
        comb.push_back(cur);
    sort(comb.begin(), comb.end());

    ll lf_sz = ls.size(), rf_sz = rs.size();
    for (ll i = 0; i <= lf_sz + rf_sz; i ++)
    {
        if (i > 0)
            rev[comb[i - 1]] = i;
        temp[i] = inf;
    }


    for (ll i = 1; i <= lf_sz; i ++)
        for (ll j = 1; j <= rf_sz; j ++)
        {
            if (s[ls[i - 1]].y > height && s[rs[j - 1]].y > height)
                continue;
            ///cout << "combine " << i << " " << j << " " << s[ls[i - 1]].y << " " << s[rs[j - 1]].y << endl;
            ll idx = max(ls[i - 1], rs[j - 1]);
            temp[rev[idx]] = min(temp[rev[idx]], dp_lf[i] + dp_rf[j]);
        }

    for (ll i = 1; i <= lf_sz; i ++)
    {
        temp[rev[ls[i - 1]]] = min(temp[rev[ls[i - 1]]], dp_lf[i] + dp_rf[0]);
    }

    for (ll i = 1; i <= rf_sz; i ++)
    {
        temp[rev[rs[i - 1]]] = min(temp[rev[rs[i - 1]]], dp_rf[i] + dp_lf[0]);
    }

    temp[0] = min(temp[0], dp_lf[0] + dp_rf[0]);

    vector < ll > dp(comb.size() + 1);
    for (ll i = 0; i <= comb.size(); i ++)
    {
        dp[i] = temp[i];
    }

    vector < ll > new_dp, new_comb;
    ll und = dp[0];
    for (int i = 1; i <= comb.size(); i ++)
        if (s[comb[i - 1]].y <= height)
        und = min(und, dp[i]);

    new_dp.push_back(und);
    for (int i = 1; i <= comb.size(); i ++)
    {
        if (s[comb[i - 1]].y > height)
        {
            new_dp.push_back(dp[i]);
            new_comb.push_back(comb[i - 1]);
        }
    }


    return {new_dp, new_comb};


}
void divide(ll col)
{

    if (lc[col] != -1) divide(lc[col]);
    if (rc[col] != -1) divide(rc[col]);

    ll col_sz = star[col].size();
    dp[col].resize(col_sz + 1);
    ll sum = 0;
    for (ll i = 0; i < col_sz; i ++)
        sum += s[star[col][i]].c;

    dp[col][0] = sum;
    for (ll i = 1; i <= col_sz; i ++)
        dp[col][i] = sum - s[star[col][i - 1]].c;


    if (lc[col] != -1)
    {
        pair < vector < ll >, vector < ll > > cur =
            combine(dp[lc[col]], dp[col], star[lc[col]], star[col], a[col]);

        star[col] = cur.second;
        dp[col] = cur.first;
    }

    if (rc[col] != -1)
    {
        pair < vector < ll >, vector < ll > > cur =
            combine(dp[rc[col]], dp[col], star[rc[col]], star[col], a[col]);

        star[col] = cur.second;
        dp[col] = cur.first;
    }


    /**cout << "step "<< col << endl;
    for (ll cur : star[col])
        cout << cur << " ";
    cout << endl;
    for (ll cur : dp[col])
        cout << cur << " ";
    cout << endl;*/
}
void solve()
{
    input();
    ll root = cartesian_tree();

    divide(root);
    ll ans = inf;
    for (ll i = 0; i < dp[root].size(); i ++)
        ans = min(ans, dp[root][i]);
    cout << ans << endl;
}
int main()
{
    ///freopen("test.txt", "r", stdin);
    speed();
    solve();
    return 0;
}

/**
5
3 2 2 2 3
3
1 5 3
4 3 2
2 4 2

*/

Compilation message

constellation3.cpp: In function 'std::pair<std::vector<long long int>, std::vector<long long int> > combine(std::vector<long long int>, std::vector<long long int>, std::vector<long long int>, std::vector<long long int>, ll)':
constellation3.cpp:148:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |     for (ll i = 0; i <= comb.size(); i ++)
      |                    ~~^~~~~~~~~~~~~~
constellation3.cpp:155:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     for (int i = 1; i <= comb.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~
constellation3.cpp:160:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |     for (int i = 1; i <= comb.size(); i ++)
      |                     ~~^~~~~~~~~~~~~~
constellation3.cpp: In function 'void solve()':
constellation3.cpp:225:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  225 |     for (ll i = 0; i < dp[root].size(); i ++)
      |                    ~~^~~~~~~~~~~~~~~~~
constellation3.cpp: In function 'll cartesian_tree()':
constellation3.cpp:100:12: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
  100 |     return root;
      |            ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 3 ms 18780 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 3 ms 18776 KB Output is correct
6 Correct 4 ms 18960 KB Output is correct
7 Correct 3 ms 18780 KB Output is correct
8 Correct 4 ms 18780 KB Output is correct
9 Correct 4 ms 18780 KB Output is correct
10 Correct 4 ms 19292 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19032 KB Output is correct
13 Correct 4 ms 19032 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 3 ms 18776 KB Output is correct
18 Correct 4 ms 19036 KB Output is correct
19 Correct 3 ms 18780 KB Output is correct
20 Correct 4 ms 18780 KB Output is correct
21 Correct 4 ms 19288 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 3 ms 18780 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 3 ms 18776 KB Output is correct
6 Correct 4 ms 18960 KB Output is correct
7 Correct 3 ms 18780 KB Output is correct
8 Correct 4 ms 18780 KB Output is correct
9 Correct 4 ms 18780 KB Output is correct
10 Correct 4 ms 19292 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19032 KB Output is correct
13 Correct 4 ms 19032 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 3 ms 18776 KB Output is correct
18 Correct 4 ms 19036 KB Output is correct
19 Correct 3 ms 18780 KB Output is correct
20 Correct 4 ms 18780 KB Output is correct
21 Correct 4 ms 19288 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct
23 Correct 5 ms 19032 KB Output is correct
24 Correct 5 ms 19032 KB Output is correct
25 Correct 5 ms 19100 KB Output is correct
26 Correct 5 ms 18876 KB Output is correct
27 Correct 5 ms 19036 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 19032 KB Output is correct
30 Correct 5 ms 19036 KB Output is correct
31 Correct 5 ms 19036 KB Output is correct
32 Correct 30 ms 29036 KB Output is correct
33 Correct 27 ms 26716 KB Output is correct
34 Correct 23 ms 25168 KB Output is correct
35 Correct 23 ms 24412 KB Output is correct
36 Correct 26 ms 28764 KB Output is correct
37 Correct 29 ms 29044 KB Output is correct
38 Correct 5 ms 19552 KB Output is correct
39 Correct 6 ms 19292 KB Output is correct
40 Correct 33 ms 30812 KB Output is correct
41 Correct 6 ms 19292 KB Output is correct
42 Correct 6 ms 19172 KB Output is correct
43 Correct 35 ms 31572 KB Output is correct
44 Correct 6 ms 19292 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 3 ms 18780 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 3 ms 18776 KB Output is correct
6 Correct 4 ms 18960 KB Output is correct
7 Correct 3 ms 18780 KB Output is correct
8 Correct 4 ms 18780 KB Output is correct
9 Correct 4 ms 18780 KB Output is correct
10 Correct 4 ms 19292 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19032 KB Output is correct
13 Correct 4 ms 19032 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 3 ms 18776 KB Output is correct
18 Correct 4 ms 19036 KB Output is correct
19 Correct 3 ms 18780 KB Output is correct
20 Correct 4 ms 18780 KB Output is correct
21 Correct 4 ms 19288 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct
23 Correct 5 ms 19032 KB Output is correct
24 Correct 5 ms 19032 KB Output is correct
25 Correct 5 ms 19100 KB Output is correct
26 Correct 5 ms 18876 KB Output is correct
27 Correct 5 ms 19036 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 19032 KB Output is correct
30 Correct 5 ms 19036 KB Output is correct
31 Correct 5 ms 19036 KB Output is correct
32 Correct 30 ms 29036 KB Output is correct
33 Correct 27 ms 26716 KB Output is correct
34 Correct 23 ms 25168 KB Output is correct
35 Correct 23 ms 24412 KB Output is correct
36 Correct 26 ms 28764 KB Output is correct
37 Correct 29 ms 29044 KB Output is correct
38 Correct 5 ms 19552 KB Output is correct
39 Correct 6 ms 19292 KB Output is correct
40 Correct 33 ms 30812 KB Output is correct
41 Correct 6 ms 19292 KB Output is correct
42 Correct 6 ms 19172 KB Output is correct
43 Correct 35 ms 31572 KB Output is correct
44 Correct 6 ms 19292 KB Output is correct
45 Correct 237 ms 38576 KB Output is correct
46 Correct 265 ms 43652 KB Output is correct
47 Correct 232 ms 43884 KB Output is correct
48 Correct 240 ms 43672 KB Output is correct
49 Correct 225 ms 43600 KB Output is correct
50 Correct 229 ms 43400 KB Output is correct
51 Correct 245 ms 43652 KB Output is correct
52 Correct 239 ms 44112 KB Output is correct
53 Correct 230 ms 43796 KB Output is correct
54 Execution timed out 1580 ms 486752 KB Time limit exceeded
55 Halted 0 ms 0 KB -