oj.uz

답안 #700953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
700953 2023-02-19T13:22:31 Z Farbod 별자리 3 (JOI20_constellation3) C++17
35 / 100
 641 ms 524288 KB 
/*
*  In the name of God
*
*  Author: Farbod Doost
*  Last Modified: Sun, 19 Feb 2023 (16:52:11)
*
*/
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O1")

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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5844 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 3 ms 5844 KB Output is correct
4 Correct 4 ms 5760 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 5 ms 5844 KB Output is correct
12 Correct 4 ms 5844 KB Output is correct
13 Correct 3 ms 5844 KB Output is correct
14 Correct 4 ms 5844 KB Output is correct
15 Correct 4 ms 5780 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 3 ms 5844 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 5844 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 3 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5844 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 3 ms 5844 KB Output is correct
4 Correct 4 ms 5760 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 5 ms 5844 KB Output is correct
12 Correct 4 ms 5844 KB Output is correct
13 Correct 3 ms 5844 KB Output is correct
14 Correct 4 ms 5844 KB Output is correct
15 Correct 4 ms 5780 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 3 ms 5844 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 5844 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 3 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 6 ms 6044 KB Output is correct
24 Correct 6 ms 5932 KB Output is correct
25 Correct 6 ms 5972 KB Output is correct
26 Correct 4 ms 5972 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 5 ms 5972 KB Output is correct
29 Correct 5 ms 5972 KB Output is correct
30 Correct 5 ms 5972 KB Output is correct
31 Correct 5 ms 5972 KB Output is correct
32 Correct 21 ms 10884 KB Output is correct
33 Correct 19 ms 8648 KB Output is correct
34 Correct 13 ms 8020 KB Output is correct
35 Correct 12 ms 7312 KB Output is correct
36 Correct 20 ms 6268 KB Output is correct
37 Correct 22 ms 6324 KB Output is correct
38 Correct 33 ms 6376 KB Output is correct
39 Correct 6 ms 5972 KB Output is correct
40 Correct 26 ms 12252 KB Output is correct
41 Correct 5 ms 5972 KB Output is correct
42 Correct 5 ms 5972 KB Output is correct
43 Correct 26 ms 12372 KB Output is correct
44 Correct 5 ms 5972 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5844 KB Output is correct
2 Correct 3 ms 5844 KB Output is correct
3 Correct 3 ms 5844 KB Output is correct
4 Correct 4 ms 5760 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 5 ms 5844 KB Output is correct
12 Correct 4 ms 5844 KB Output is correct
13 Correct 3 ms 5844 KB Output is correct
14 Correct 4 ms 5844 KB Output is correct
15 Correct 4 ms 5780 KB Output is correct
16 Correct 4 ms 5844 KB Output is correct
17 Correct 3 ms 5844 KB Output is correct
18 Correct 4 ms 5972 KB Output is correct
19 Correct 3 ms 5844 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 3 ms 5972 KB Output is correct
22 Correct 3 ms 5844 KB Output is correct
23 Correct 6 ms 6044 KB Output is correct
24 Correct 6 ms 5932 KB Output is correct
25 Correct 6 ms 5972 KB Output is correct
26 Correct 4 ms 5972 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 5 ms 5972 KB Output is correct
29 Correct 5 ms 5972 KB Output is correct
30 Correct 5 ms 5972 KB Output is correct
31 Correct 5 ms 5972 KB Output is correct
32 Correct 21 ms 10884 KB Output is correct
33 Correct 19 ms 8648 KB Output is correct
34 Correct 13 ms 8020 KB Output is correct
35 Correct 12 ms 7312 KB Output is correct
36 Correct 20 ms 6268 KB Output is correct
37 Correct 22 ms 6324 KB Output is correct
38 Correct 33 ms 6376 KB Output is correct
39 Correct 6 ms 5972 KB Output is correct
40 Correct 26 ms 12252 KB Output is correct
41 Correct 5 ms 5972 KB Output is correct
42 Correct 5 ms 5972 KB Output is correct
43 Correct 26 ms 12372 KB Output is correct
44 Correct 5 ms 5972 KB Output is correct
45 Correct 247 ms 27856 KB Output is correct
46 Correct 249 ms 27580 KB Output is correct
47 Correct 246 ms 27220 KB Output is correct
48 Correct 253 ms 27876 KB Output is correct
49 Correct 232 ms 27140 KB Output is correct
50 Correct 235 ms 27104 KB Output is correct
51 Correct 238 ms 27248 KB Output is correct
52 Correct 258 ms 27672 KB Output is correct
53 Correct 260 ms 27628 KB Output is correct
54 Runtime error 641 ms 524288 KB Execution killed with signal 9
55 Halted 0 ms 0 KB -