Submission #102247

# Submission time Handle Problem Language Result Execution time Memory
102247 2019-03-23T21:01:26 Z Benq Designated Cities (JOI19_designated_cities) C++14
0 / 100
581 ms 78564 KB
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

vector<array<int,3>> adj[MX];
int N,Q;
ll tot, ans1[MX], ans[MX];

template<int SZ> struct CentroidDecomp {
    bool done[SZ];
    int sub[SZ], par[SZ];
    vi dist[SZ];

    void dfs (int no) {
        sub[no] = 1;
        trav(i,adj[no]) if (!done[i[0]] && i[0] != par[no]) {
            par[i[0]] = no;
            dfs(i[0]);
            sub[no] += sub[i[0]];
        }
    }

    int getCentroid(int x) {
        par[x] = 0; dfs(x);
        int sz = sub[x];
        while (1) {
            pi mx = {0,0};
            trav(i,adj[x]) if (!done[i[0]] && i[0] != par[x]) ckmax(mx,{sub[i[0]],i[0]});
            if (mx.f*2 > sz) x = mx.s;
            else return x;
        }
    }

    void comb(vi& a, vi& b) {
        if (sz(a) < sz(b)) swap(a,b);
        if (a.back() > b.back()) swap(a.back(),b.back());
        a.insert(a.end(),all(b)); b.clear();
    }
    void genDist(int par, int no, int d) {
        dist[no] = {0};
        trav(i,adj[no]) if (!done[i[0]] && i[0] != par) {
            genDist(no,i[0],i[1]);
            comb(dist[no],dist[i[0]]);
        }
        dist[no].back() += d;
    }

    void init(int x) { // call init(1) to start
        x = getCentroid(x); done[x] = 1;
        vi posi; dist[x] = {0}; posi.pb(0);
        
        pi bes = {0,-1};
        trav(i,adj[x]) if (!done[i[0]]) {
            genDist(x,i[0],i[1]);
            // ps("HUH",i[0],dist[i[0]]);
            int t = dist[i[0]].back();
            if (t > bes.f) swap(bes.f,t);
            if (t > bes.s) swap(bes.s,t);
            posi.insert(posi.end(),all(dist[i[0]]));
        }
        
        if (sz(posi) <= 1) return;
        ll ans2 = bes.f+bes.s;
        posi.erase(find(all(posi),bes.f));
        posi.erase(find(all(posi),bes.s));
        sort(all(posi)); reverse(all(posi));
        F0R(i,sz(posi)+1) {
            ckmax(ans[i+2],ans1[x]+ans2);
            if (i == sz(posi)) break;
            ans2 += posi[i];
        }
        trav(i,adj[x]) if (!done[i[0]]) init(i[0]);
    }
};

CentroidDecomp<MX> C;

void dfs1(int a, int b) {
    trav(t,adj[a]) if (t[0] != b) {
        ans1[1] += t[2];
        dfs1(t[0],a);
    }
}

void dfs2(int a, int b) {
    trav(t,adj[a]) if (t[0] != b) {
        ans1[t[0]] = ans1[a]+t[1]-t[2];
        dfs2(t[0],a);
    }
    
}

void init() {
    setIO(); re(N);
    F0R(i,N-1) {
        int A,B,C,D; re(A,B,C,D);
        tot += C+D;
        adj[A].pb({B,C,D}), adj[B].pb({A,D,C});
    }
    dfs1(1,0); dfs2(1,0);
    FOR(i,1,N+1) {
        // ps(i,ans1[i]);
        ckmax(ans[1],ans1[i]);
    }
}

int main() {
    init();
    C.init(1);
    int Q; re(Q); 
    F0R(i,Q) {
        int e; re(e);
        ps(tot-ans[e]);
    }
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

designated_cities.cpp: In function 'void io::setIn(std::__cxx11::string)':
designated_cities.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp: In function 'void io::setOut(std::__cxx11::string)':
designated_cities.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 12 ms 9728 KB Output is correct
2 Incorrect 10 ms 9728 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 11 ms 9832 KB Output is correct
2 Runtime error 581 ms 78564 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 11 ms 9792 KB Output is correct
2 Runtime error 426 ms 74640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 12 ms 9728 KB Output is correct
2 Incorrect 10 ms 9728 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 11 ms 9832 KB Output is correct
2 Runtime error 581 ms 78564 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 12 ms 9728 KB Output is correct
2 Incorrect 10 ms 9728 KB Output isn't correct
3 Halted 0 ms 0 KB -