oj.uz

Submission #206072

# Submission time Handle Problem Language Result Execution time Memory
206072 2020-03-02T07:23:06 Z PeppaPig Designated Cities (JOI19_designated_cities) C++14
7 / 100
 372 ms 34680 KB 
#include <bits/stdc++.h>

#define long long long
#define pii pair<long, long>
#define x first
#define y second

using namespace std;

const int N = 2e5+5;

struct Edge {
    int v;
    long c, d;
    Edge(int v, long c, long d) : v(v), c(c), d(d) {}
};

int n, q, deg[N];
vector<Edge> g[N];

long dwn[N], ans[N];

void pre_process(int u, int p) {
    for(Edge v : g[u]) if(v.v != p) {
        pre_process(v.v, u);
        dwn[u] += v.c + dwn[v.v];
    }
}

void dfs(int u, int p, long sum) {
    ans[1] = min(ans[1], sum);
    for(Edge v : g[u]) if(v.v != p) {
        sum -= v.c, sum += v.d;
        dfs(v.v, u, sum);
        sum += v.c, sum -= v.d;
    }
}

int main() {
    ans[1] = 1e18;

    scanf("%d", &n);
    for(int i = 1, a, b, c, d; i < n; i++) {
        scanf("%d %d %d %d", &a, &b, &c, &d);
        g[a].emplace_back(b, c, d);
        g[b].emplace_back(a, d, c);
        ++deg[a], ++deg[b];
    }
    pre_process(1, 0), dfs(1, 0, dwn[1]);

    // priority_queue<pii, vector<pii>, greater<pii> > Q;
    // for(int i = 1; i <= n; i++) if(deg[i] == 1)
    //     Q.emplace(g[i][0].d, i);

    // while(Q.size() > 2) {
    //     pii now = Q.top(); Q.pop();
    //     int u = now.y; long dist = now.x;
    //     int nex = -1;
    //     for(Edge v : g[u]) if(deg[v.v] > 1) {
    //         --deg[v.v];
    //         if(deg[v.v] == 1) nex = v.v;
    //         else ans[Q.size()] = ans[Q.size() + 1] + dist;
    //     }
    //     if(nex != -1) for(Edge v : g[nex]) if(deg[v.v] > 1)
    //         Q.emplace(dist + v.d, nex);
    // }

    scanf("%d", &q);
    for(int i = 1, a; i <= q; i++) {
        scanf("%d", &a);
        printf("%lld\n", ans[a]);
    }

    return 0;
}

Compilation message

designated_cities.cpp: In function 'int main()':
designated_cities.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
designated_cities.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d", &a, &b, &c, &d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
     ~~~~~^~~~~~~~~~
designated_cities.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Incorrect 7 ms 4984 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 321 ms 21420 KB Output is correct
3 Correct 372 ms 34168 KB Output is correct
4 Correct 299 ms 21368 KB Output is correct
5 Correct 292 ms 21176 KB Output is correct
6 Correct 327 ms 23288 KB Output is correct
7 Correct 256 ms 20132 KB Output is correct
8 Correct 363 ms 34680 KB Output is correct
9 Correct 194 ms 17688 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Incorrect 321 ms 20608 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Incorrect 7 ms 4984 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 321 ms 21420 KB Output is correct
3 Correct 372 ms 34168 KB Output is correct
4 Correct 299 ms 21368 KB Output is correct
5 Correct 292 ms 21176 KB Output is correct
6 Correct 327 ms 23288 KB Output is correct
7 Correct 256 ms 20132 KB Output is correct
8 Correct 363 ms 34680 KB Output is correct
9 Correct 194 ms 17688 KB Output is correct
10 Correct 8 ms 5112 KB Output is correct
11 Incorrect 321 ms 20608 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Incorrect 7 ms 4984 KB Output isn't correct
3 Halted 0 ms 0 KB -