oj.uz

답안 #1083748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083748 2024-09-04T02:39:56 Z phong 별자리 3 (JOI20_constellation3) C++17
35 / 100
 1500 ms 98360 KB 
#include<bits/stdc++.h>

#define ll long long
#define int long long
const int nmax = 2e5 + 5, N = 1e5;
const ll oo = 1e18 + 1, base = 311;
const int lg = 20, M = 10;
const ll mod = 998244353, mod2 = 1e9 + 5277;
#define pii pair<int, int>
#define fi first
#define se second
#define endl "\n"
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' '; cout << "\n";
using namespace std;

int n, m;
int rmq[nmax][lg + 1], a[nmax];
map<int, int> dp[nmax], g[nmax];
ll f[nmax];

int calc(int u, int j){
//    if(f[u] < g[u][j]) cout << "?";
    dp[u][j] += f[u] - g[u][j];
    g[u][j] = f[u];
    return dp[u][j];
}
int get(int l, int r){
    int k = __lg(r - l + 1);
    int x = rmq[l][k], y = rmq[r - (1 << k) + 1][k];
    if(a[x] > a[y])return x;
    else return y;
}
int one[nmax];

int get(int u){
    return one[u] ? one[u] = get(one[u]) : u;
}
int lmao(int x, int y){
    ll res = 0;
    while(dp[x].size()){
        pii it = *dp[x].begin();
        if(it.fi <= y){
            res = max(res, calc(x, it.fi));
            dp[x].erase(dp[x].begin());
        }
        else break;
    }
    return res;
}
int solve(int l, int r){
    if(l == r) return l;
    int p = get(l, r);
    if(l < p && p < r){
        int x = get(solve(l, p - 1));
        int y = get(solve(p + 1, r));
        if(dp[x].size() > dp[y].size()) swap(x, y);
        one[x] = y;
        int t1 = lmao(x, a[p]);
        int t2 = lmao(y, a[p]);
        for(auto [id, w] : dp[y]) dp[y][id] += t1;
        vector<int> tmp;

        for(auto [id, w] : dp[x]){
            tmp.push_back(id);
        }
//        cout <<t1 << ' ' << t2 << endl;
        for(auto id : tmp){
                        dp[y][id] = max(calc(x, id) + t2, calc(y, id));
//            g[y][id] += t1;

        }
//        f[y] += t1;

        one[p] = y;
        for(auto [id, w] : dp[p]){
            dp[y][id] = max(calc(y, id), w + t1 + t2);
        }
        dp[y][a[p]] = t1 + t2;
//        g[y][a[p]] += t1;
//        for(auto [id, w] : dp[y]){
//            calc(y, id);
//        }
//        cout << p << "#\n";
//        for(auto [id, w] : dp[y]) cout << id << ' ' << w << endl;
//        exit(0);
    }
    else{
        int y;
        if(l < p)y = get(solve(l, p - 1));
        else y = get(solve(p + 1, r));
        int t1 = lmao(y, a[p]);
        one[p] = y;
        for(auto [id, w] : dp[p]){
            dp[y][id] = max(calc(y, id), w + t1);
        }
        dp[y][a[p]] = t1;
        for(auto [id, w] : dp[y]){
            calc(y, id);
        }

    }
    return p;
}
main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
//    freopen("code.inp", "r", stdin);
//    freopen("code.out", "w", stdout);
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i], rmq[i][0] = i;
    for(int j = 1; j <= lg; ++j){
        for(int i = 1; i + (1 << j) - 1 <= n; ++i){
            int x = rmq[i][j - 1], y = rmq[i + (1 << (j - 1))][j - 1];
            if(a[x] > a[y]) rmq[i][j] = x;
            else rmq[i][j] = y;
        }
    }
    cin >> m;
    ll sum = 0;
    for(int i = 1, u, v, w; i <= m; ++i){
        cin >> u >> v >> w;
        dp[u][v] = w;
        sum += w;
    }
    int p = get(solve(1, n));
    ll ans = 0;
    for(auto [id,w] : dp[p]) ans = max(ans, calc(p, id));
    cout << sum - ans;
}
/*
6#
1 30
2 30
3 30
4 30
5 30
6 37
7 30
8 39
4#
1 37
2 37
3 37
4 37
5 37
6 37
7 37
8 39
2#
1 52
2 52
3 52
4 52
5 52
6 52
7 52
8 52

*/

Compilation message

constellation3.cpp:104:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  104 | main(){
      | ^~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19288 KB Output is correct
2 Correct 9 ms 19288 KB Output is correct
3 Correct 9 ms 19292 KB Output is correct
4 Correct 9 ms 19288 KB Output is correct
5 Correct 8 ms 19288 KB Output is correct
6 Correct 9 ms 19288 KB Output is correct
7 Correct 10 ms 19288 KB Output is correct
8 Correct 9 ms 19364 KB Output is correct
9 Correct 9 ms 19292 KB Output is correct
10 Correct 10 ms 19292 KB Output is correct
11 Correct 8 ms 19288 KB Output is correct
12 Correct 10 ms 19292 KB Output is correct
13 Correct 8 ms 19308 KB Output is correct
14 Correct 9 ms 19296 KB Output is correct
15 Correct 10 ms 19288 KB Output is correct
16 Correct 9 ms 19292 KB Output is correct
17 Correct 9 ms 19292 KB Output is correct
18 Correct 9 ms 19400 KB Output is correct
19 Correct 8 ms 19292 KB Output is correct
20 Correct 10 ms 19292 KB Output is correct
21 Correct 12 ms 19288 KB Output is correct
22 Correct 9 ms 19292 KB Output is correct
23 Correct 10 ms 19804 KB Output is correct
24 Correct 10 ms 19848 KB Output is correct
25 Correct 12 ms 19804 KB Output is correct
26 Correct 11 ms 19804 KB Output is correct
27 Correct 12 ms 19804 KB Output is correct
28 Correct 11 ms 19804 KB Output is correct
29 Correct 10 ms 19992 KB Output is correct
30 Correct 9 ms 20064 KB Output is correct
31 Correct 9 ms 19804 KB Output is correct
32 Correct 29 ms 20096 KB Output is correct
33 Correct 27 ms 20056 KB Output is correct
34 Correct 23 ms 20056 KB Output is correct
35 Correct 19 ms 20056 KB Output is correct
36 Correct 33 ms 20056 KB Output is correct
37 Correct 32 ms 20060 KB Output is correct
38 Correct 11 ms 20060 KB Output is correct
39 Correct 11 ms 19800 KB Output is correct
40 Correct 32 ms 20060 KB Output is correct
41 Correct 11 ms 19804 KB Output is correct
42 Correct 11 ms 19800 KB Output is correct
43 Correct 32 ms 20060 KB Output is correct
44 Correct 9 ms 19804 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19288 KB Output is correct
2 Correct 9 ms 19288 KB Output is correct
3 Correct 9 ms 19292 KB Output is correct
4 Correct 9 ms 19288 KB Output is correct
5 Correct 8 ms 19288 KB Output is correct
6 Correct 9 ms 19288 KB Output is correct
7 Correct 10 ms 19288 KB Output is correct
8 Correct 9 ms 19364 KB Output is correct
9 Correct 9 ms 19292 KB Output is correct
10 Correct 10 ms 19292 KB Output is correct
11 Correct 8 ms 19288 KB Output is correct
12 Correct 10 ms 19292 KB Output is correct
13 Correct 8 ms 19308 KB Output is correct
14 Correct 9 ms 19296 KB Output is correct
15 Correct 10 ms 19288 KB Output is correct
16 Correct 9 ms 19292 KB Output is correct
17 Correct 9 ms 19292 KB Output is correct
18 Correct 9 ms 19400 KB Output is correct
19 Correct 8 ms 19292 KB Output is correct
20 Correct 10 ms 19292 KB Output is correct
21 Correct 12 ms 19288 KB Output is correct
22 Correct 9 ms 19292 KB Output is correct
23 Correct 10 ms 19804 KB Output is correct
24 Correct 10 ms 19848 KB Output is correct
25 Correct 12 ms 19804 KB Output is correct
26 Correct 11 ms 19804 KB Output is correct
27 Correct 12 ms 19804 KB Output is correct
28 Correct 11 ms 19804 KB Output is correct
29 Correct 10 ms 19992 KB Output is correct
30 Correct 9 ms 20064 KB Output is correct
31 Correct 9 ms 19804 KB Output is correct
32 Correct 29 ms 20096 KB Output is correct
33 Correct 27 ms 20056 KB Output is correct
34 Correct 23 ms 20056 KB Output is correct
35 Correct 19 ms 20056 KB Output is correct
36 Correct 33 ms 20056 KB Output is correct
37 Correct 32 ms 20060 KB Output is correct
38 Correct 11 ms 20060 KB Output is correct
39 Correct 11 ms 19800 KB Output is correct
40 Correct 32 ms 20060 KB Output is correct
41 Correct 11 ms 19804 KB Output is correct
42 Correct 11 ms 19800 KB Output is correct
43 Correct 32 ms 20060 KB Output is correct
44 Correct 9 ms 19804 KB Output is correct
45 Correct 271 ms 98360 KB Output is correct
46 Correct 259 ms 97192 KB Output is correct
47 Correct 268 ms 97872 KB Output is correct
48 Correct 270 ms 97620 KB Output is correct
49 Correct 273 ms 96512 KB Output is correct
50 Correct 272 ms 96084 KB Output is correct
51 Correct 281 ms 96848 KB Output is correct
52 Correct 273 ms 98300 KB Output is correct
53 Correct 274 ms 97212 KB Output is correct
54 Execution timed out 1548 ms 95316 KB Time limit exceeded
55 Halted 0 ms 0 KB -