oj.uz

Submission #16208

# Submission time Handle Problem Language Result Execution time Memory
16208 2015-08-17T13:50:25 Z makesource Beads and wires (APIO14_beads) C++
28 / 100
 1000 ms 12416 KB 
//
//  main.cpp
//  apioC
//
//  Created by 방성원 on 2015. 8. 16..
//  Copyright (c) 2015년 makesource. All rights reserved.
//
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <memory.h>
#define max(a,b) ((a)>(b)?(a):(b))
#define __ 200020
using namespace std;

vector<int> g[__], length[__];
int red[__], blue[__], vis[__], second[__], pos[__];
int n, ans;

void dfs(int node,int parent,int len) {
    vis[node] = 1;
    for (int i=0;i<g[node].size();i++) {
        if (vis[g[node][i]]) continue;
        dfs(g[node][i],node,length[node][i]);
    }
    
    for (int i=0;i<g[node].size();i++) {
        if(g[node][i] == parent) continue;
        red[node] += max(red[g[node][i]],blue[g[node][i]]);
    }
    for (int i=0;i<g[node].size();i++) {
        if(g[node][i] == parent) continue;
        
        int value=max(red[g[node][i]],blue[g[node][i]]);

        if (blue[node] < red[node]-value+red[g[node][i]]+len+length[node][i]) {
            second[node] = max(second[node],blue[node]);
            blue[node] = red[node]-value+red[g[node][i]]+len+length[node][i];
            pos[node] = i;
        } else {
            second[node] = max(second[node],red[node]-value+red[g[node][i]]+len+length[node][i]);
        }
    }
}
/*
void changeRoot(int node,int parent) {
    int rr = red[node];
    int bb = blue[node];
    vis[node] = 1;
    
    red[node] = 0; blue[node] = 0;
    for (int i=0;i<g[node].size();i++) {
        red[node] += max(red[g[node][i]],blue[g[node][i]]);
    }
    for (int i=0;i<g[node].size();i++) {
        int value=max(red[g[node][i]],blue[g[node][i]]);
        blue[node] = max(blue[node],red[node]-value+red[g[node][i]]+length[node][i]);
    }
    int nowRed = red[node];
    int nowBlue = blue[node];
    ans = max(ans,nowRed);
    
    for (int i=0;i<g[node].size();i++) {
        if (vis[g[node][i]]) continue;
        red[node] = nowRed; blue[node] = nowBlue;
        
        red[node] -= max(red[g[node][i]],blue[g[node][i]]);
        if(pos[node] != i) {
            blue[node] -= max(red[g[node][i]],blue[g[node][i]]);
        } else {
            blue[node] = second[node];
            blue[node] -= max(red[g[node][i]],blue[g[node][i]]);
        }
        blue[node] += length[node][i];
        changeRoot(g[node][i],node);
    }
    
    red[node] = rr;
    blue[node] = bb;
    
   
}*/

int main() {
    scanf("%d",&n);
    for(int i=1;i<n;i++) {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        g[a].push_back(b); length[a].push_back(c);
        g[b].push_back(a); length[b].push_back(c);
    }
    for(int i=1;i<=n;i++) {
        dfs(i,-1,0);
        ans = max(ans,red[i]);
        memset(red,0,sizeof red);
        memset(blue,0,sizeof blue);
        memset(vis,0,sizeof vis);
    }
    //changeRoot(1,-1);
    printf("%d",ans);
    return 0;
}

Compilation message

beads.cpp: In function 'void dfs(int, int, int)':
beads.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<g[node].size();i++) {
                  ~^~~~~~~~~~~~~~~
beads.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<g[node].size();i++) {
                  ~^~~~~~~~~~~~~~~
beads.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<g[node].size();i++) {
                  ~^~~~~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
beads.cpp:88:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&a,&b,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 14 ms 12032 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 13 ms 12032 KB Output is correct
7 Correct 12 ms 12032 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 13 ms 12032 KB Output is correct
10 Correct 14 ms 12032 KB Output is correct
11 Correct 13 ms 12032 KB Output is correct
12 Correct 13 ms 12032 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 14 ms 12032 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 13 ms 12032 KB Output is correct
7 Correct 12 ms 12032 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 13 ms 12032 KB Output is correct
10 Correct 14 ms 12032 KB Output is correct
11 Correct 13 ms 12032 KB Output is correct
12 Correct 13 ms 12032 KB Output is correct
13 Correct 23 ms 12032 KB Output is correct
14 Correct 23 ms 12004 KB Output is correct
15 Correct 23 ms 12032 KB Output is correct
16 Correct 35 ms 12144 KB Output is correct
17 Correct 35 ms 12032 KB Output is correct
18 Correct 36 ms 12140 KB Output is correct
19 Correct 36 ms 12032 KB Output is correct
20 Correct 36 ms 12032 KB Output is correct
21 Correct 35 ms 12032 KB Output is correct
22 Correct 35 ms 12200 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 14 ms 12032 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 13 ms 12032 KB Output is correct
7 Correct 12 ms 12032 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 13 ms 12032 KB Output is correct
10 Correct 14 ms 12032 KB Output is correct
11 Correct 13 ms 12032 KB Output is correct
12 Correct 13 ms 12032 KB Output is correct
13 Correct 23 ms 12032 KB Output is correct
14 Correct 23 ms 12004 KB Output is correct
15 Correct 23 ms 12032 KB Output is correct
16 Correct 35 ms 12144 KB Output is correct
17 Correct 35 ms 12032 KB Output is correct
18 Correct 36 ms 12140 KB Output is correct
19 Correct 36 ms 12032 KB Output is correct
20 Correct 36 ms 12032 KB Output is correct
21 Correct 35 ms 12032 KB Output is correct
22 Correct 35 ms 12200 KB Output is correct
23 Execution timed out 1071 ms 12416 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 14 ms 12032 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 13 ms 12032 KB Output is correct
7 Correct 12 ms 12032 KB Output is correct
8 Correct 16 ms 12032 KB Output is correct
9 Correct 13 ms 12032 KB Output is correct
10 Correct 14 ms 12032 KB Output is correct
11 Correct 13 ms 12032 KB Output is correct
12 Correct 13 ms 12032 KB Output is correct
13 Correct 23 ms 12032 KB Output is correct
14 Correct 23 ms 12004 KB Output is correct
15 Correct 23 ms 12032 KB Output is correct
16 Correct 35 ms 12144 KB Output is correct
17 Correct 35 ms 12032 KB Output is correct
18 Correct 36 ms 12140 KB Output is correct
19 Correct 36 ms 12032 KB Output is correct
20 Correct 36 ms 12032 KB Output is correct
21 Correct 35 ms 12032 KB Output is correct
22 Correct 35 ms 12200 KB Output is correct
23 Execution timed out 1071 ms 12416 KB Time limit exceeded
24 Halted 0 ms 0 KB -