oj.uz

Submission #700950

# Submission time Handle Problem Language Result Execution time Memory
700950 2023-02-19T13:13:13 Z Farbod Constellation 3 (JOI20_constellation3) C++17
35 / 100
 520 ms 524288 KB 
/*
*  In the name of God
*
*  Author: Farbod Doost
*  Last Modified: Sun, 19 Feb 2023 (16:42:59)
*
*/
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 5;
const long long inf = 1e18;

int pw[N];

int n, m, a[N], dp[N][20];
long long s[N], Ans = inf;
vector <pair <int, int>> adj[N];

vector <int> v;

int mx(int l, int r)
{
    if (a[dp[l][pw[r - l + 1]]] > a[dp[r - (1 << pw[r - l + 1]) + 1][pw[r - l + 1]]])
        return dp[l][pw[r - l + 1]];
    return dp[r - (1 << pw[r - l + 1]) + 1][pw[r - l + 1]];
}

int mn(int i, int x)
{
    int j = upper_bound(adj[i].begin(), adj[i].end(), make_pair(x + 1, 0)) - adj[i].begin();
    j--;

    if (j < 0)
        return 0;
    return adj[i][j].second;
}

void f(int l, int r, vector <long long> &ans)
{
    if (l > r) {
        for (int i = 0; i < (int)v.size(); i++)
            ans.push_back(0);
        v.pop_back();

        return;
    }
    if (l == r) {
        for (int i = 0; i < (int)v.size(); i++) 
            ans.push_back(s[l] - mn(l, v[i]));
        v.pop_back();

        return;
    }

    int mid = mx(l, r);

    vector <long long> ansL, ansR;
    v.push_back(a[mid]), f(l, mid - 1, ansL);
    v.push_back(a[mid]), f(mid + 1, r, ansR);

    for (int i = 0; i < (int)v.size(); i++) {
        Ans = inf;

        Ans = min(Ans, ansL[i] + ansR.back() + s[mid]),
        Ans = min(Ans, ansL.back() + ansR[i] + s[mid]),
        Ans = min(Ans, ansL.back() + ansR.back() + s[mid] - mn(mid, v[i]));

        ans.push_back(Ans);
    }

    //ansL.clear(), ansL.shrink_to_fit();
    //ansR.clear(), ansR.shrink_to_fit();

    v.pop_back();

    return;
}

signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    pw[1] = 0;
    for (int i = 2; i < N; i++)
        pw[i] = pw[i / 2] + 1;

    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i], dp[i][0] = i;

    for (int j = 1; j < 20; j++)
        for (int i = 0; i < n; i++) {
            if (a[dp[i][j - 1]] > a[dp[min(n - 1, i + (1 << (j - 1)))][j - 1]])
                dp[i][j] = dp[i][j - 1];
            else
                dp[i][j] = dp[min(n - 1, i + (1 << (j - 1)))][j - 1];
        }
                
    int x, y, c;
    cin >> m;
    for (int i = 0; i < m; i++) {
        cin >> x >> y >> c, x--;
        
        s[x] += c;
        adj[x].push_back({y, c});
    }

    for (int i = 0; i < n; i++) {
        sort(adj[i].begin(), adj[i].end());
        for (int j = 1; j < (int)adj[i].size(); j++)
            adj[i][j].second = max(adj[i][j].second, adj[i][j - 1].second);
    }

    vector <long long> ans;

    v.push_back(n), f(0, n - 1, ans);

    cout << ans.back();

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5844 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 3 ms 5844 KB Output is correct
5 Correct 3 ms 5844 KB Output is correct
6 Correct 3 ms 5844 KB Output is correct
7 Correct 3 ms 5844 KB Output is correct
8 Correct 3 ms 5844 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5972 KB Output is correct
11 Correct 3 ms 5844 KB Output is correct
12 Correct 4 ms 5844 KB Output is correct
13 Correct 4 ms 5844 KB Output is correct
14 Correct 3 ms 5844 KB Output is correct
15 Correct 3 ms 5844 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 4 ms 5844 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 5864 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 5 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5844 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 3 ms 5844 KB Output is correct
5 Correct 3 ms 5844 KB Output is correct
6 Correct 3 ms 5844 KB Output is correct
7 Correct 3 ms 5844 KB Output is correct
8 Correct 3 ms 5844 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5972 KB Output is correct
11 Correct 3 ms 5844 KB Output is correct
12 Correct 4 ms 5844 KB Output is correct
13 Correct 4 ms 5844 KB Output is correct
14 Correct 3 ms 5844 KB Output is correct
15 Correct 3 ms 5844 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 4 ms 5844 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 5864 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 5 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 4 ms 5972 KB Output is correct
24 Correct 7 ms 5972 KB Output is correct
25 Correct 5 ms 5972 KB Output is correct
26 Correct 5 ms 5972 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 5 ms 6008 KB Output is correct
29 Correct 6 ms 5972 KB Output is correct
30 Correct 6 ms 5972 KB Output is correct
31 Correct 5 ms 5972 KB Output is correct
32 Correct 19 ms 10836 KB Output is correct
33 Correct 18 ms 8660 KB Output is correct
34 Correct 12 ms 8020 KB Output is correct
35 Correct 11 ms 7252 KB Output is correct
36 Correct 18 ms 6260 KB Output is correct
37 Correct 17 ms 6228 KB Output is correct
38 Correct 33 ms 6356 KB Output is correct
39 Correct 5 ms 5972 KB Output is correct
40 Correct 21 ms 12236 KB Output is correct
41 Correct 5 ms 5972 KB Output is correct
42 Correct 5 ms 6048 KB Output is correct
43 Correct 22 ms 12372 KB Output is correct
44 Correct 5 ms 5972 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5844 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 4 ms 5844 KB Output is correct
4 Correct 3 ms 5844 KB Output is correct
5 Correct 3 ms 5844 KB Output is correct
6 Correct 3 ms 5844 KB Output is correct
7 Correct 3 ms 5844 KB Output is correct
8 Correct 3 ms 5844 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5972 KB Output is correct
11 Correct 3 ms 5844 KB Output is correct
12 Correct 4 ms 5844 KB Output is correct
13 Correct 4 ms 5844 KB Output is correct
14 Correct 3 ms 5844 KB Output is correct
15 Correct 3 ms 5844 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 4 ms 5844 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 5864 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 5 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 4 ms 5972 KB Output is correct
24 Correct 7 ms 5972 KB Output is correct
25 Correct 5 ms 5972 KB Output is correct
26 Correct 5 ms 5972 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 5 ms 6008 KB Output is correct
29 Correct 6 ms 5972 KB Output is correct
30 Correct 6 ms 5972 KB Output is correct
31 Correct 5 ms 5972 KB Output is correct
32 Correct 19 ms 10836 KB Output is correct
33 Correct 18 ms 8660 KB Output is correct
34 Correct 12 ms 8020 KB Output is correct
35 Correct 11 ms 7252 KB Output is correct
36 Correct 18 ms 6260 KB Output is correct
37 Correct 17 ms 6228 KB Output is correct
38 Correct 33 ms 6356 KB Output is correct
39 Correct 5 ms 5972 KB Output is correct
40 Correct 21 ms 12236 KB Output is correct
41 Correct 5 ms 5972 KB Output is correct
42 Correct 5 ms 6048 KB Output is correct
43 Correct 22 ms 12372 KB Output is correct
44 Correct 5 ms 5972 KB Output is correct
45 Correct 256 ms 27748 KB Output is correct
46 Correct 274 ms 27584 KB Output is correct
47 Correct 241 ms 27216 KB Output is correct
48 Correct 223 ms 27816 KB Output is correct
49 Correct 222 ms 27184 KB Output is correct
50 Correct 251 ms 27148 KB Output is correct
51 Correct 216 ms 27152 KB Output is correct
52 Correct 230 ms 27584 KB Output is correct
53 Correct 247 ms 27536 KB Output is correct
54 Runtime error 520 ms 524288 KB Execution killed with signal 9
55 Halted 0 ms 0 KB -