oj.uz

답안 #701062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701062 2023-02-19T22:57:27 Z Kahou 별자리 3 (JOI20_constellation3) C++14
100 / 100
 165 ms 24456 KB 
/* In the name of God, aka Allah */
// Believe me - Takeshi Abo
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
#define mk make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 2e5 + 50;
ll n, m, a[N], pr[N], dp[N][2], par[N], nxt[N], sm[N];
vector<pair<ll, pll>> vc;
ll adj[N][2];

int getnxt(int u, int y) {
        if (a[u] >= y) return u;
        ll v = getnxt(nxt[u], y);
        sm[u] = sm[u] + sm[nxt[u]] - dp[nxt[u]][nxt[u]<u]*(v != nxt[u]);
        nxt[u] = v;
        return v;
}

void solve() {
        cin >> n;
        for (int i = 1; i <= n; i++) {
                cin >> a[i];
        }
        cin >> m;
        ll sum = 0;
        for (int i = 1; i <= m; i++) {
                ll x, y, w;
                cin >> x >> y >> w;
                vc.push_back({y, {-w, x}});
                sum += w;
        }
        for (int i = 1; i <= n; i++) {
                vc.push_back({a[i], {0, i}});
        }
        sort(vc.begin(), vc.end());
        a[0] = a[n+1] = N;
        for (int i = 1; i <= n+1; i++) {
                pr[i] = i-1;
                while (pr[i] > 0 && a[pr[i]] <= a[i]) {
                        if (a[pr[pr[i]]] > a[i]) {
                                par[pr[i]] = i;
                                adj[i][0] = pr[i];
                        }
                        else {
                                par[pr[i]] = pr[pr[i]];
                                adj[pr[pr[i]]][1] = pr[i];
                        }
                        pr[i] = pr[pr[i]];
                }
        }
        for (int u = 1; u <= n; u++) {
                nxt[u] = par[u];
        }
        for (auto P: vc) {
                ll y = P.F;
                ll u = P.S.S;
                ll w = -P.S.F;
                if (!w) {
                        sm[u] = dp[u][0] + dp[u][1];
                        dp[par[u]][par[u]<u] = sm[u];
                        continue;
                }
                ll v = getnxt(u, y);
                dp[v][v<u] = max(dp[v][v<u], sm[u]+w);
        }
        cout << sum-dp[0][1] << endl;
}
int main() {
        ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        solve();
        return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 3 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 3 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 151 ms 23764 KB Output is correct
46 Correct 161 ms 23352 KB Output is correct
47 Correct 156 ms 23200 KB Output is correct
48 Correct 150 ms 23740 KB Output is correct
49 Correct 143 ms 23132 KB Output is correct
50 Correct 156 ms 22888 KB Output is correct
51 Correct 149 ms 23304 KB Output is correct
52 Correct 151 ms 23552 KB Output is correct
53 Correct 147 ms 23416 KB Output is correct
54 Correct 137 ms 23836 KB Output is correct
55 Correct 165 ms 23200 KB Output is correct
56 Correct 138 ms 23068 KB Output is correct
57 Correct 130 ms 22856 KB Output is correct
58 Correct 118 ms 23660 KB Output is correct
59 Correct 133 ms 23552 KB Output is correct
60 Correct 122 ms 24456 KB Output is correct
61 Correct 132 ms 24344 KB Output is correct
62 Correct 140 ms 23608 KB Output is correct
63 Correct 145 ms 24280 KB Output is correct
64 Correct 140 ms 23708 KB Output is correct
65 Correct 138 ms 23772 KB Output is correct
66 Correct 164 ms 23896 KB Output is correct