oj.uz

Submission #851754

# Submission time Handle Problem Language Result Execution time Memory
851754 2023-09-20T14:22:09 Z danikoynov Constellation 3 (JOI20_constellation3) C++14
35 / 100
 1500 ms 66640 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];
    }

    return {dp, 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 <= m; 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: 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 5 ms 18780 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 4 ms 18780 KB Output is correct
4 Correct 4 ms 19044 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19288 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 5 ms 19432 KB Output is correct
11 Correct 4 ms 19440 KB Output is correct
12 Correct 4 ms 19300 KB Output is correct
13 Correct 4 ms 19292 KB Output is correct
14 Correct 4 ms 19292 KB Output is correct
15 Correct 4 ms 19036 KB Output is correct
16 Correct 6 ms 20060 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19548 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19036 KB Output is correct
21 Correct 4 ms 19436 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 5 ms 18780 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 4 ms 18780 KB Output is correct
4 Correct 4 ms 19044 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19288 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 5 ms 19432 KB Output is correct
11 Correct 4 ms 19440 KB Output is correct
12 Correct 4 ms 19300 KB Output is correct
13 Correct 4 ms 19292 KB Output is correct
14 Correct 4 ms 19292 KB Output is correct
15 Correct 4 ms 19036 KB Output is correct
16 Correct 6 ms 20060 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19548 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19036 KB Output is correct
21 Correct 4 ms 19436 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct
23 Correct 10 ms 19548 KB Output is correct
24 Correct 10 ms 19548 KB Output is correct
25 Correct 10 ms 19388 KB Output is correct
26 Correct 10 ms 19548 KB Output is correct
27 Correct 11 ms 19548 KB Output is correct
28 Correct 10 ms 19548 KB Output is correct
29 Correct 11 ms 19548 KB Output is correct
30 Correct 10 ms 19548 KB Output is correct
31 Correct 10 ms 19548 KB Output is correct
32 Correct 45 ms 41516 KB Output is correct
33 Correct 45 ms 36948 KB Output is correct
34 Correct 36 ms 33108 KB Output is correct
35 Correct 36 ms 31824 KB Output is correct
36 Correct 34 ms 36044 KB Output is correct
37 Correct 34 ms 36172 KB Output is correct
38 Correct 72 ms 66640 KB Output is correct
39 Correct 11 ms 19800 KB Output is correct
40 Correct 48 ms 45084 KB Output is correct
41 Correct 11 ms 19852 KB Output is correct
42 Correct 10 ms 19804 KB Output is correct
43 Correct 49 ms 46012 KB Output is correct
44 Correct 10 ms 19784 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 18780 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 4 ms 18780 KB Output is correct
4 Correct 4 ms 19044 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19288 KB Output is correct
8 Correct 4 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 5 ms 19432 KB Output is correct
11 Correct 4 ms 19440 KB Output is correct
12 Correct 4 ms 19300 KB Output is correct
13 Correct 4 ms 19292 KB Output is correct
14 Correct 4 ms 19292 KB Output is correct
15 Correct 4 ms 19036 KB Output is correct
16 Correct 6 ms 20060 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19548 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19036 KB Output is correct
21 Correct 4 ms 19436 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct
23 Correct 10 ms 19548 KB Output is correct
24 Correct 10 ms 19548 KB Output is correct
25 Correct 10 ms 19388 KB Output is correct
26 Correct 10 ms 19548 KB Output is correct
27 Correct 11 ms 19548 KB Output is correct
28 Correct 10 ms 19548 KB Output is correct
29 Correct 11 ms 19548 KB Output is correct
30 Correct 10 ms 19548 KB Output is correct
31 Correct 10 ms 19548 KB Output is correct
32 Correct 45 ms 41516 KB Output is correct
33 Correct 45 ms 36948 KB Output is correct
34 Correct 36 ms 33108 KB Output is correct
35 Correct 36 ms 31824 KB Output is correct
36 Correct 34 ms 36044 KB Output is correct
37 Correct 34 ms 36172 KB Output is correct
38 Correct 72 ms 66640 KB Output is correct
39 Correct 11 ms 19800 KB Output is correct
40 Correct 48 ms 45084 KB Output is correct
41 Correct 11 ms 19852 KB Output is correct
42 Correct 10 ms 19804 KB Output is correct
43 Correct 49 ms 46012 KB Output is correct
44 Correct 10 ms 19784 KB Output is correct
45 Execution timed out 1594 ms 46968 KB Time limit exceeded
46 Halted 0 ms 0 KB -