Submission #365004

#	Time	Username	Problem	Language	Result	Execution time	Memory
365004		ACmachine	Toll (APIO13_toll)	C++17	16 / 100	5 ms	364 KiB

toll

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

 
struct dsu{
    vector<int> e;
    dsu(){};
    dsu(int n){
        e.resize(n, -1);
    }
    int find(int x){ return (e[x] < 0 ? x : e[x] = find(e[x])); }
    int size(int x){ return -e[find(x)]; }
    int sameSet(int a, int b){ return find(a) == find(b); }
    bool join(int a, int b){
        a = find(a); b = find(b);
        if(a == b) return false;
        if(e[a] > e[b]) swap(a, b);
        e[a] += e[b]; e[b] = a;
        return true;
    }
};

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m, k;
    cin >> n >> m >> k;
    vector<array<int, 3>> edges(m);
    REP(i, m){
        cin >> edges[i][1] >> edges[i][2] >> edges[i][0];
        edges[i][1]--; edges[i][2]--;
    }
    vector<array<int, 2>> new_edges(k);
    REP(i, k){
        cin >> new_edges[i][0] >> new_edges[i][1];
        new_edges[i][0]--; new_edges[i][1]--;
    }
    sort(all(edges));
    vll P(n);
    cin >> P;
    auto get_cost = [&](vector<array<int, 2>> nw_edges){
        ll res = 0;
        dsu d(n); 
        vector<vector<array<int, 3>>> g(n);
        auto add_edge = [&](int u, int v, int cost, int special){
            g[u].pb({v, cost, special});
            g[v].pb({u, cost, special});
        };
        REP(i, edges.size()){
            if(d.sameSet(edges[i][1], edges[i][2])) continue;
            array<int, 2> cmp = {d.find(edges[i][1]), d.find(edges[i][2])};
            if(cmp[0] > cmp[1]) swap(cmp[0], cmp[1]);
            array<int, 2> nx;
            REP(j, nw_edges.size()){
                nx = {d.find(nw_edges[j][0]), d.find(nw_edges[j][1])};
                if(nx[0] > nx[1]) swap(nx[0], nx[1]);
                if(nx[0] == nx[1]) continue;
                if(nx == cmp){
                    d.join(nx[0], nx[1]);
                    add_edge(nw_edges[j][0], nw_edges[j][1], edges[i][0], 1);
                    break; 
                }
            }
            if(d.sameSet(edges[i][1], edges[i][2])) continue;
            d.join(edges[i][1], edges[i][2]);
            add_edge(edges[i][1], edges[i][2], edges[i][0], 0);
        }
        function<ll(int, int)> dfs = [&](int v, int p){
            ll sz = 0; 
            for(auto x : g[v]){
                if(x[0] == p) continue;
                ll re = dfs(x[0], v);
                sz += re;
                if(x[2] == 1){
                    res += x[1] * re;
                }
            }
            return (sz + P[v]);
        };
        dfs(0, -1);
        return res;
    };
    ll ans = 0;
    vector<array<int, 2>> nw;
    REP(i, (1 << k)){
        nw.clear();
        REP(j, k){
            if(i & (1 << j)){
                nw.pb(new_edges[j]);
            }
        }
        ans = max(ans, get_cost(nw));
    }
    cout << ans << "\n";
    return 0;
}

Compilation message (stderr)

toll.cpp: In lambda function:
toll.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
toll.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
toll.cpp:129:9: note: in expansion of macro 'REP'
  129 |         REP(i, edges.size()){
      |         ^~~
toll.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
toll.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
toll.cpp:134:13: note: in expansion of macro 'REP'
  134 |             REP(j, nw_edges.size()){
      |             ^~~

• Subtask 1: 16 / 16
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 22
• Subtask 5: 0 / 22