oj.uz

답안 #121641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121641 2019-06-26T21:34:24 Z duality Designated Cities (JOI19_designated_cities) C++11
23 / 100
 2000 ms 34180 KB 
#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

struct edge { int v,c,d; };
vector<edge> adjList[200000];
LLI ans[200001];
int parent[200000],pw[200000],disc[200000],fin[200000],inv[200000],num = 0;
LLI pp[200000];
int done[200000];
LLI sum2 = 0;
int doDFS(int u,int p,LLI d) {
    int i;
    parent[u] = p,pp[u] = d,disc[u] = num++,inv[num-1] = u;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i].v;
        if (v != p) pw[v] = adjList[u][i].c,doDFS(v,u,d+adjList[u][i].c),sum2 += adjList[u][i].d;
    }
    fin[u] = num;
    return 0;
}
LLI tree[1 << 19],lazy[1 << 19];
int pos[1 << 19];
int prop(int s,int e,int i) {
    tree[i] += lazy[i];
    if (s != e) lazy[2*i+1] += lazy[i],lazy[2*i+2] += lazy[i];
    lazy[i] = 0;
    return 0;
}
LLI build(int s,int e,int i) {
    if (s == e) {
        tree[i] = pp[inv[s]],lazy[i] = 0,pos[i] = s;
        return tree[i];
    }

    int mid = (s+e) / 2;
    tree[i] = max(build(s,mid,2*i+1),build(mid+1,e,2*i+2)),lazy[i] = 0;
    if (tree[2*i+1] > tree[2*i+2]) pos[i] = pos[2*i+1];
    else pos[i] = pos[2*i+2];
    return tree[i];
}
LLI update(int s,int e,int as,int ae,int i,LLI num) {
    prop(s,e,i);
    if ((s > ae) || (e < as)) return tree[i];
    else if ((s >= as) && (e <= ae)) {
        lazy[i] += num;
        prop(s,e,i);
        return tree[i];
    }

    int mid = (s+e) / 2;
    tree[i] = max(update(s,mid,as,ae,2*i+1,num),update(mid+1,e,as,ae,2*i+2,num));
    if (tree[2*i+1] > tree[2*i+2]) pos[i] = pos[2*i+1];
    else pos[i] = pos[2*i+2];
    return tree[i];
}
LLI ss[200000];
int doDFS2(int u,int p) {
    int i;
    ss[u] = 0;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i].v;
        if (v != p) {
            doDFS2(v,u);
            ss[u] += ss[v]+adjList[u][i].d;
        }
    }
    return 0;
}
int doDFS3(int u,int p,LLI d) {
    int i;
    ss[u] += d;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i].v;
        if (v != p) doDFS3(v,u,ss[u]-ss[v]-adjList[u][i].d+adjList[u][i].c);
    }
    return 0;
}
int main() {
    int i;
    int N,Q;
    int A,B,C,D;
    LLI sum = 0;
    scanf("%d",&N);
    for (i = 0; i < N-1; i++) {
        scanf("%d %d %d %d",&A,&B,&C,&D);
        A--,B--;
        adjList[A].pb((edge){B,C,D});
        adjList[B].pb((edge){A,D,C});
        sum += C+D;
    }
/*
    int mi = -1;
    doDFS2(0,-1);
    doDFS3(0,-1,0);
    for (i = 0; i < N; i++) {
        if ((adjList[i].size() == 1) && ((mi == -1) || (ss[i] > ss[mi]))) mi = i;
        ans[1] = max(ans[1],ss[i]);
    }
    cout<<mi<<endl;
*/
    int j,k;
    int mii = -1;
    for (i = 0; i < N; i++) {
        sum2 = 0,num = 0;
        doDFS(i,-1,0);
        ans[1] = max(ans[1],sum2);
        fill(done,done+N,0);
        build(0,N-1,0);
        for (j = 2; j <= 2; j++) {
            prop(0,N-1,0);
            int mi = inv[pos[0]];
            sum2 += tree[0];
            if ((j == 2) && (sum2 > ans[j])) mii = i;
            ans[j] = max(ans[j],sum2);
            while (!done[mi] && (mi != i)) {
                update(0,N-1,disc[mi],fin[mi]-1,0,-pw[mi]);
                done[mi] = 1,mi = parent[mi];
            }
        }
    }
    for (i = mii; i <= mii; i++) {
        sum2 = 0,num = 0;
        doDFS(i,-1,0);
        ans[1] = max(ans[1],sum2);
        fill(done,done+N,0);
        build(0,N-1,0);
        for (j = 2; j <= N; j++) {
            prop(0,N-1,0);
            int mi = inv[pos[0]];
            sum2 += tree[0];
            ans[j] = max(ans[j],sum2);
            while (!done[mi] && (mi != i)) {
                update(0,N-1,disc[mi],fin[mi]-1,0,-pw[mi]);
                done[mi] = 1,mi = parent[mi];
            }
        }
    }

    int E;
    scanf("%d",&Q);
    for (i = 0; i < Q; i++) {
        scanf("%d",&E);
        printf("%lld\n",sum-ans[E]);
    }

    return 0;
}

Compilation message

designated_cities.cpp: In function 'int doDFS(int, int, LLI)':
designated_cities.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
designated_cities.cpp: In function 'int doDFS2(int, int)':
designated_cities.cpp:114:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
designated_cities.cpp: In function 'int doDFS3(int, int, LLI)':
designated_cities.cpp:126:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
designated_cities.cpp: In function 'int main()':
designated_cities.cpp:155:11: warning: unused variable 'k' [-Wunused-variable]
     int j,k;
           ^
designated_cities.cpp:137:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
designated_cities.cpp:139: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:194:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&Q);
     ~~~~~^~~~~~~~~
designated_cities.cpp:196:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&E);
         ~~~~~^~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 5 ms 5120 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5092 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Execution timed out 2024 ms 34140 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Execution timed out 2049 ms 34180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 5 ms 5120 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5092 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 219 ms 5496 KB Output is correct
14 Correct 863 ms 5628 KB Output is correct
15 Correct 185 ms 5376 KB Output is correct
16 Correct 225 ms 5408 KB Output is correct
17 Correct 188 ms 5496 KB Output is correct
18 Correct 202 ms 5376 KB Output is correct
19 Correct 193 ms 5396 KB Output is correct
20 Correct 187 ms 5496 KB Output is correct
21 Correct 322 ms 5496 KB Output is correct
22 Correct 221 ms 5572 KB Output is correct
23 Correct 181 ms 5492 KB Output is correct
24 Correct 150 ms 5376 KB Output is correct
25 Correct 958 ms 5520 KB Output is correct
26 Correct 142 ms 5496 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Execution timed out 2024 ms 34140 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 5 ms 5120 KB Output is correct
4 Correct 6 ms 5120 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 5 ms 5120 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 6 ms 5092 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 5 ms 5120 KB Output is correct
13 Execution timed out 2024 ms 34140 KB Time limit exceeded
14 Halted 0 ms 0 KB -