oj.uz

Submission #947523

# Submission time Handle Problem Language Result Execution time Memory
947523 2024-03-16T10:36:07 Z parlimoos Toll (APIO13_toll) C++14
56 / 100
 2500 ms 15352 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'

int n , m , k;
vector<arr(3)> mst , cnds , uss;
vector<int> a;
vector<arr(2)> adds;
ll dsu[100000][2] , mem[100000];
int dsuinx = -1;
multiset<int> ms;
vector<array<ll , 3>> bck;

void init(){
    for(int v = 0 ; v < n ; v++) dsu[v][0] = -1 , dsu[v][1] = a[v];
}
void svDsu(int v){
    bck.pb({v , dsu[v][0] , dsu[v][1]});
}
int findDsu(int v){
    if(dsu[v][0] == -1) return v;
    if(dsuinx != -1) svDsu(v);
    return (dsu[v][0] = findDsu(dsu[v][0]));
}
void uDsu(int a , int b){
    a = findDsu(a) , b = findDsu(b);
    if(a == b) return;
    if(dsuinx != -1) svDsu(a) , svDsu(b);
    dsu[a][1] += dsu[b][1] , dsu[b][0] = a;
}
void clDsu(){
    for(int i = (int)bck.size() - 1 ; i >= dsuinx ; i--) dsu[bck[i][0]][0] = bck[i][1] , dsu[bck[i][0]][1] = bck[i][2];
    bck.resize(dsuinx);
}
void getCnds(){
    for(auto e : adds) uDsu(e[0] , e[1]);
    for(auto e : mst){
        if(findDsu(e[1]) == findDsu(e[2])) cnds.pb(e);
        else uDsu(e[1] , e[2]);
    }
    init();
    for(auto e : mst){
        if(!(binary_search(cnds.bg() , cnds.end() , e))) uDsu(e[1] , e[2]);
    }
    dsuinx = 0;
}
bool jg(int e , int msk , int c){
    dsuinx = (int)bck.size();
    for(int i = 0 ; i < k ; i++){
        if(i == e or !((msk >> i) & 1)) continue;
        uDsu(adds[i][0] , adds[i][1]);
    }
    bool res = 1;
    for(auto ee : cnds){
        if(ee[0] >= c) break;
        uDsu(ee[1] , ee[2]);
    }
    if(findDsu(adds[e][0]) == findDsu(adds[e][1])) res = 0;
    clDsu() , dsuinx = 0;
    return res;
}
int bs(int e , int msk){
    int l = 0 , r = int(1e6) + 1;
    while(r - l - 1 > 1){
        int c = (r + l + 1) / 2;
        if(jg(e , msk , c)) l = c - 1;
        else r = c;
    }
    if(r - l - 1 == 1){
        if(jg(e , msk , l + 1)) return l + 1;
    }
    return l;
}
ll dfs1(int v , int msk){
    ll res = 0;
    mem[v] = dsu[v][1] , ms.insert(v);
    for(int e = k - 1 ; e >= 0 ; e--){
        if(!((msk >> e) & 1)) continue;
        if(findDsu(adds[e][0]) != v and findDsu(adds[e][1]) != v) continue;
        int u = findDsu(adds[e][0]) + findDsu(adds[e][1]) - v;
        if(ms.find(u) != ms.end()) continue;
        res += dfs1(u , msk) , mem[v] += mem[u];
        ll d = bs(e , msk);
        res += d * mem[u];
    }
    return res;
}
ll getCst(int msk){
    ll res;
    clDsu() , ms.cl() , uss.cl();
    for(int e = 0 ; e < k ; e++){
        if(!((msk >> e) & 1)) continue;
        uDsu(adds[e][0] , adds[e][1]);
    }
    for(auto e : cnds){
        if(findDsu(e[1]) == findDsu(e[2])) continue;
        uDsu(e[1] , e[2]) , uss.pb(e);
    }
    clDsu();
    for(auto e : uss) uDsu(e[1] , e[2]);
    ms.cl() , res = dfs1(findDsu(0) , msk) , uss.cl();
    dsuinx = 0 , clDsu();
    return res;
}
ll f(){
    ll res = 0;
    for(int msk = 1 ; msk < (1 << k) ; msk++){
        res = max(res , getCst(msk));
    }
    return res;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> k;
    vector<arr(3)> es;
    for(int i = 0 ; i < m ; i++){
        int v , u , c;
        cin >> v >> u >> c;
        v-- , u--;
        es.pb({c , v , u});
    }
    for(int i = 0 ; i < k ; i++){
        int v , u;
        cin >> v >> u;
        adds.pb({v - 1 , u - 1});
    }
    for(int i = 0 ; i < n ; i++){
        int d;
        cin >> d;
        a.pb(d);
    }
    init();
    sort(es.bg() , es.end());
    for(auto e : es){
        if(findDsu(e[1]) == findDsu(e[2])) continue;
        mst.pb(e) , uDsu(e[1] , e[2]);
    }
    init() , getCnds();
    cout << f();
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 32 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 32 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 45 ms 604 KB Output is correct
6 Correct 24 ms 736 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 32 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 45 ms 604 KB Output is correct
6 Correct 24 ms 736 KB Output is correct
7 Execution timed out 2535 ms 15352 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 32 ms 348 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 45 ms 604 KB Output is correct
6 Correct 24 ms 736 KB Output is correct
7 Execution timed out 2535 ms 15352 KB Time limit exceeded
8 Halted 0 ms 0 KB -