Submission #2505443


Source Code Expand

#include <cstdio>
#include <queue>
#include <set>
#include <algorithm>

using namespace std;

int ans;
char c[100001];
int a[100000];
set <int> s[100000];

int dfs(int x, int y) {
    int p = 0, q = 0;
    set <int>::iterator it;
    
    for (it = s[x].begin(); it != s[x].end(); it++) {
        int nx = *it;
        
        if (nx != y) {
            int r = dfs(nx, x);
            
            if (r > p) {
                q = p;
                p = r;
            } else if (r > q) {
                q = r;
            }
        }
    }
    
    p += a[x];
    ans = max(ans, p + q);
    return p;
}

int main() {
    int n, num, i;
    queue <int> q;
    
    scanf("%d", &n);
    
    for (i = 0; i < n - 1; i++) {
        int x, y;
        
        scanf("%d %d", &x, &y);
        
        x--;
        y--;
        
        s[x].insert(y);
        s[y].insert(x);
    }
    
    scanf("%s", c);
    
    num = n;
    
    for (i = 0; i < n; i++) {
        if (c[i] == 'B' && s[i].size() <= 1) q.push(i);
    }
    
    while (!q.empty()) {
        int x = q.front(), y;
        
        q.pop();
        
        if (s[x].size() == 0) break;
        
        y = *s[x].begin();
        
        num--;
        s[x].erase(y);
        s[y].erase(x);
        
        if (c[y] == 'B' && s[y].size() <= 1) q.push(y);
    }
    
    if (num <= 1) {
        for (i = 0; i < n; i++) {
            if (c[i] == 'W') ans++;
        }
        
        printf("%d\n", ans);
    } else {
        int p = -1;
        
        num = (num - 1) * 2;
        
        for (i = 0; i < n; i++) {
            if (s[i].size() == 0) continue;
            if (p == -1) p = i;
            
            if (c[i] == 'W') a[i] = 1;
            a[i] += s[i].size();
            a[i] %= 2;
            
            num += a[i];
        }
        
        dfs(p, -1);
        
        printf("%d\n", num - ans * 2);
    }
    
    return 0;
}

Submission Info

Submission Time
Task F - Monochrome Cat
User kawatea
Language C++14 (GCC 5.4.1)
Score 800
Code Size 2030 Byte
Status AC
Exec Time 94 ms
Memory 21760 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:46:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &x, &y);
                               ^
./Main.cpp:55:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", c);
                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 4
AC × 118
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt, 1_043.txt, 1_044.txt, 1_045.txt, 1_046.txt, 1_047.txt, 1_048.txt, 1_049.txt, 1_050.txt, 1_051.txt, 1_052.txt, 1_053.txt, 1_054.txt, 1_055.txt, 1_056.txt, 1_057.txt, 1_058.txt, 1_059.txt, 1_060.txt, 1_061.txt, 1_062.txt, 1_063.txt, 1_064.txt, 1_065.txt, 1_066.txt, 1_067.txt, 1_068.txt, 1_069.txt, 1_070.txt, 1_071.txt, 1_072.txt, 1_073.txt, 1_074.txt, 1_075.txt, 1_076.txt, 1_077.txt, 1_078.txt, 1_079.txt, 1_080.txt, 1_081.txt, 1_082.txt, 1_083.txt, 1_084.txt, 1_085.txt, 1_086.txt, 1_087.txt, 1_088.txt, 1_089.txt, 1_090.txt, 1_091.txt, 1_092.txt, 1_093.txt, 1_094.txt, 1_095.txt, 1_096.txt, 1_097.txt, 1_098.txt, 1_099.txt, 1_100.txt, 1_101.txt, 1_102.txt, 1_103.txt, 1_104.txt, 1_105.txt, 1_106.txt, 1_107.txt, 1_108.txt, 1_109.txt, 1_110.txt, 1_111.txt, 1_112.txt, 1_113.txt, 1_114.txt, 1_115.txt, 1_116.txt
Case Name Status Exec Time Memory
0_000.txt AC 3 ms 4992 KB
0_001.txt AC 3 ms 4992 KB
0_002.txt AC 3 ms 4992 KB
0_003.txt AC 3 ms 4992 KB
1_003.txt AC 3 ms 4992 KB
1_004.txt AC 3 ms 4992 KB
1_005.txt AC 3 ms 4992 KB
1_006.txt AC 3 ms 4992 KB
1_007.txt AC 3 ms 4992 KB
1_008.txt AC 3 ms 4992 KB
1_009.txt AC 3 ms 4992 KB
1_010.txt AC 3 ms 4992 KB
1_011.txt AC 3 ms 4992 KB
1_012.txt AC 3 ms 4992 KB
1_013.txt AC 3 ms 4992 KB
1_014.txt AC 3 ms 4992 KB
1_015.txt AC 3 ms 4992 KB
1_016.txt AC 3 ms 4992 KB
1_017.txt AC 3 ms 4864 KB
1_018.txt AC 3 ms 4992 KB
1_019.txt AC 3 ms 4992 KB
1_020.txt AC 3 ms 4864 KB
1_021.txt AC 3 ms 4992 KB
1_022.txt AC 3 ms 4992 KB
1_023.txt AC 3 ms 4864 KB
1_024.txt AC 3 ms 4992 KB
1_025.txt AC 3 ms 4992 KB
1_026.txt AC 3 ms 4992 KB
1_027.txt AC 3 ms 4992 KB
1_028.txt AC 3 ms 4992 KB
1_029.txt AC 3 ms 4992 KB
1_030.txt AC 3 ms 4992 KB
1_031.txt AC 3 ms 4992 KB
1_032.txt AC 3 ms 4992 KB
1_033.txt AC 3 ms 4992 KB
1_034.txt AC 3 ms 4992 KB
1_035.txt AC 3 ms 4864 KB
1_036.txt AC 3 ms 4992 KB
1_037.txt AC 3 ms 4992 KB
1_038.txt AC 3 ms 4992 KB
1_039.txt AC 3 ms 4992 KB
1_040.txt AC 3 ms 4992 KB
1_041.txt AC 3 ms 4992 KB
1_042.txt AC 3 ms 4992 KB
1_043.txt AC 3 ms 4992 KB
1_044.txt AC 3 ms 4992 KB
1_045.txt AC 22 ms 10496 KB
1_046.txt AC 27 ms 12544 KB
1_047.txt AC 51 ms 14208 KB
1_048.txt AC 39 ms 12032 KB
1_049.txt AC 45 ms 15616 KB
1_050.txt AC 39 ms 14848 KB
1_051.txt AC 56 ms 12416 KB
1_052.txt AC 16 ms 6784 KB
1_053.txt AC 68 ms 13312 KB
1_054.txt AC 26 ms 8320 KB
1_055.txt AC 56 ms 12288 KB
1_056.txt AC 35 ms 9472 KB
1_057.txt AC 4 ms 5120 KB
1_058.txt AC 29 ms 10624 KB
1_059.txt AC 22 ms 8320 KB
1_060.txt AC 45 ms 12160 KB
1_061.txt AC 49 ms 15232 KB
1_062.txt AC 28 ms 10880 KB
1_063.txt AC 38 ms 10880 KB
1_064.txt AC 30 ms 9216 KB
1_065.txt AC 6 ms 5504 KB
1_066.txt AC 63 ms 12800 KB
1_067.txt AC 12 ms 6784 KB
1_068.txt AC 37 ms 10112 KB
1_069.txt AC 15 ms 7424 KB
1_070.txt AC 28 ms 9600 KB
1_071.txt AC 55 ms 12928 KB
1_072.txt AC 33 ms 9856 KB
1_073.txt AC 7 ms 5760 KB
1_074.txt AC 6 ms 5504 KB
1_075.txt AC 24 ms 9216 KB
1_076.txt AC 59 ms 14592 KB
1_077.txt AC 53 ms 12672 KB
1_078.txt AC 20 ms 7808 KB
1_079.txt AC 24 ms 9088 KB
1_080.txt AC 29 ms 9728 KB
1_081.txt AC 73 ms 19072 KB
1_082.txt AC 64 ms 19328 KB
1_083.txt AC 71 ms 14464 KB
1_084.txt AC 63 ms 14464 KB
1_085.txt AC 63 ms 21376 KB
1_086.txt AC 74 ms 21760 KB
1_087.txt AC 94 ms 14848 KB
1_088.txt AC 89 ms 14976 KB
1_089.txt AC 82 ms 14848 KB
1_090.txt AC 81 ms 14848 KB
1_091.txt AC 77 ms 14848 KB
1_092.txt AC 92 ms 14848 KB
1_093.txt AC 64 ms 17152 KB
1_094.txt AC 70 ms 18688 KB
1_095.txt AC 67 ms 14592 KB
1_096.txt AC 61 ms 14592 KB
1_097.txt AC 60 ms 17792 KB
1_098.txt AC 63 ms 18304 KB
1_099.txt AC 64 ms 14848 KB
1_100.txt AC 74 ms 14976 KB
1_101.txt AC 85 ms 14720 KB
1_102.txt AC 83 ms 14592 KB
1_103.txt AC 68 ms 14848 KB
1_104.txt AC 73 ms 15104 KB
1_105.txt AC 54 ms 14848 KB
1_106.txt AC 60 ms 14848 KB
1_107.txt AC 67 ms 14592 KB
1_108.txt AC 70 ms 14592 KB
1_109.txt AC 59 ms 14848 KB
1_110.txt AC 63 ms 14976 KB
1_111.txt AC 55 ms 14848 KB
1_112.txt AC 63 ms 14848 KB
1_113.txt AC 68 ms 14592 KB
1_114.txt AC 68 ms 14592 KB
1_115.txt AC 57 ms 14848 KB
1_116.txt AC 66 ms 14976 KB