Submission #203262

#	Time	Username	Problem	Language	Result	Execution time	Memory
203262		Rakhmand	Designated Cities (JOI19_designated_cities)	C++14	0 / 100	9 ms	5240 KiB

designated_cities

//
//  ROIGold.cpp
//  Main calisma
//
//  Created by Rakhman on 05/02/2019.
//  Copyright © 2019 Rakhman. All rights reserved.
//

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>

#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k)

const int MXN = 1e5 + 1;
const long long MNN = 1e6 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;

typedef long long llong;
typedef unsigned long long ullong;

using namespace std;

void istxt(bool yes){
    if(yes == 1){
        freopen("balancing.in", "r", stdin);
        //freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/e.txt", "w", stdout);
    }else{
        freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
    }
}

int n, q;
llong sum, ans, roads;
vector<pair<int, int> > g[MXN];

void dfs(int v, int p){
    for(int i = 0; i < g[v].size(); i++){
        int to = g[v][i].F, cost = g[v][i].S;
        if(to == p) {
            roads += cost;
            continue;
        }
        dfs(to, v);
    }
}

void dfs2(int v, int p){
    for(int i = 0; i < g[v].size(); i++){
        int to = g[v][i].F;
        if(to == p){
            roads -= g[v][i].S;
            continue;
        }
    }
    ans = max(ans, roads);
    for(int i = 0; i < g[v].size(); i++){
        int to = g[v][i].F;
        if(to == p){
            continue;
        }
        roads += g[v][i].S;
        dfs2(to, v);
        roads -= g[v][i].S;
    }
}

int main () {
    ios;
    //istxt(0);
    cin >> n;
    for(int i = 1; i < n; i++){
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        g[u].pb({v, a});
        g[v].pb({u, b});
        sum += a + b;
    }
    dfs(1, 0);
    ans = roads;
    dfs2(1, 0);
    cin >> q;
    while(q--){
        int x;
        cin >> x;
        //assert(x == 1);
        cout << sum - ans << nl;
    }
    return 0;
}

Compilation message (stderr)

designated_cities.cpp: In function 'void dfs(int, int)':
designated_cities.cpp:67:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < g[v].size(); i++){
                    ~~^~~~~~~~~~~~~
designated_cities.cpp: In function 'void dfs2(int, int)':
designated_cities.cpp:78:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < g[v].size(); i++){
                    ~~^~~~~~~~~~~~~
designated_cities.cpp:86:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < g[v].size(); i++){
                    ~~^~~~~~~~~~~~~
designated_cities.cpp: In function 'void istxt(bool)':
designated_cities.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("balancing.in", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44