Submission #2503747


Source Code Expand

#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<int> > data;
int win, INF = -1e9;
vector<bool> used;
pair<int, int> dfs(int vertex, vector<bool> &v){
    used[vertex] = true;
    if (data[vertex].size() == 1){
        int cst = 1 + (!v[vertex]) - (v[vertex]);
        win = max(win, cst);
        return make_pair(cst, INF);
    }
    int maxl = INF, maxl2 = INF, maxr = INF, maxr2 = INF;
    int A = -1, B = -1;
    for (int i=0; i < data[vertex].size(); i++){
        int to = data[vertex][i];
        if (used[to]) continue;
        pair<int, int> p = dfs(to, v);
        int L = p.first, R = p.second;
        if (L > maxl){
            A = i;
            maxl2 = maxl;
            maxl = L;
        }
        else if (L > maxl2) maxl2 = L;
        if (R > maxr){
            B = i;
            maxr2 = maxr;
            maxr = R;
        }
        else if (R > maxr2) maxr2 = R;
    }
    int cst = 1 + (!v[vertex]) - (v[vertex]);
    win = max(win, cst);
    if (A != B) win = max(win, maxl + maxr + cst);
    else{
        win = max(win, maxl2 + maxr + cst);
        win = max(win, maxr2 + maxl + cst);
    }
    maxl += cst;
    maxr += cst;
    maxr = max(maxr, cst);
    return make_pair(maxl, maxr);

}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i=0; i < n; i++){
        vector<int> help;
        data.push_back(help);
    }
    for (int i=0; i < n-1; i++){
        int a, b;
        cin >> a >> b;
        data[a-1].push_back(b-1);
        data[b-1].push_back(a-1);
    }
    vector<bool> good;
    for (int i=0; i < n; i++){
        char ch;
        cin >> ch;
        if (ch == 'W') good.push_back(false);
        else good.push_back(true);
    }
    vector<int> f;
    for (int i=0; i < n; i++) f.push_back(data[i].size());
    vector<bool> rem(n);
    fill(rem.begin(), rem.end(), true);
    queue<int> q;
    for (int i=0; i < n; i++) if (f[i] <= 1 && good[i]) q.push(i);
    while (q.size()){
        int V = q.front();
        q.pop();
        rem[V] = false;
        for (int i=0; i < data[V].size(); i++){
            int to = data[V][i];
            f[to]--;
            if (f[to] == 1 && good[to]) q.push(to);
        }
    }
    map<int, int> num;
    int cur = 0;
    for (int i=0; i < n; i++){
        if (!rem[i]) continue;
        num[i] = cur;
        cur++;
    }
    vector<vector<int> > ndata;
    for (int i=0; i < n; i++){
        if (!rem[i]) continue;
        vector<int> ss;
        for (int j=0; j < data[i].size(); j++){
            int to = data[i][j];
            if (!rem[to]) continue;
            ss.push_back(num[to]);
        }
        ndata.push_back(ss);
    }
    data=ndata;
    vector<bool> ngood;
    for (int i=0; i < n; i++){
        if (!rem[i]) continue;
        ngood.push_back(good[i]);
    }
    good = ngood;
    if (data.size() == 0){
        cout << 0;
        return 0;
    }
    if (data.size() == 1){
        cout << 1;
        return 0;
    }
    if (data.size() == 2){
        cout << 2;
        return 0;
    }
    int ft = -1;
    for (int i=0; i < data.size(); i++) if (data[i].size() > 1) ft = i;
    for (int i=0; i < data.size(); i++) used.push_back(false);
    for (int i=0; i < data.size(); i++) if (data[i].size() % 2) good[i] = good[i] ^ 1;
    int pay = 2*data.size()-2;
    for (int i=0; i < data.size(); i++) if (!good[i]) pay++;
    win = 0;
    dfs(ft, good);
    cout << pay - win;
}

Submission Info

Submission Time
Task F - Monochrome Cat
User DmitryGrigorev
Language C++14 (GCC 5.4.1)
Score 800
Code Size 3597 Byte
Status AC
Exec Time 238 ms
Memory 29552 KB

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 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
0_003.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 1 ms 256 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 1 ms 256 KB
1_014.txt AC 1 ms 256 KB
1_015.txt AC 1 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt AC 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 1 ms 256 KB
1_020.txt AC 1 ms 256 KB
1_021.txt AC 1 ms 256 KB
1_022.txt AC 1 ms 256 KB
1_023.txt AC 1 ms 256 KB
1_024.txt AC 1 ms 256 KB
1_025.txt AC 1 ms 256 KB
1_026.txt AC 1 ms 256 KB
1_027.txt AC 1 ms 256 KB
1_028.txt AC 1 ms 256 KB
1_029.txt AC 1 ms 256 KB
1_030.txt AC 1 ms 256 KB
1_031.txt AC 1 ms 256 KB
1_032.txt AC 1 ms 256 KB
1_033.txt AC 1 ms 256 KB
1_034.txt AC 1 ms 256 KB
1_035.txt AC 1 ms 256 KB
1_036.txt AC 1 ms 256 KB
1_037.txt AC 1 ms 256 KB
1_038.txt AC 1 ms 256 KB
1_039.txt AC 1 ms 256 KB
1_040.txt AC 1 ms 256 KB
1_041.txt AC 1 ms 256 KB
1_042.txt AC 1 ms 256 KB
1_043.txt AC 1 ms 256 KB
1_044.txt AC 1 ms 256 KB
1_045.txt AC 55 ms 9332 KB
1_046.txt AC 72 ms 11252 KB
1_047.txt AC 48 ms 7408 KB
1_048.txt AC 36 ms 6000 KB
1_049.txt AC 157 ms 20976 KB
1_050.txt AC 117 ms 16372 KB
1_051.txt AC 110 ms 17904 KB
1_052.txt AC 12 ms 2936 KB
1_053.txt AC 33 ms 7280 KB
1_054.txt AC 13 ms 3316 KB
1_055.txt AC 109 ms 17648 KB
1_056.txt AC 17 ms 4084 KB
1_057.txt AC 3 ms 640 KB
1_058.txt AC 65 ms 10740 KB
1_059.txt AC 17 ms 3188 KB
1_060.txt AC 35 ms 6768 KB
1_061.txt AC 169 ms 20336 KB
1_062.txt AC 52 ms 8820 KB
1_063.txt AC 103 ms 12020 KB
1_064.txt AC 44 ms 6644 KB
1_065.txt AC 3 ms 704 KB
1_066.txt AC 34 ms 7280 KB
1_067.txt AC 22 ms 4088 KB
1_068.txt AC 36 ms 6260 KB
1_069.txt AC 37 ms 5112 KB
1_070.txt AC 63 ms 8308 KB
1_071.txt AC 44 ms 7024 KB
1_072.txt AC 24 ms 4340 KB
1_073.txt AC 12 ms 2172 KB
1_074.txt AC 5 ms 1088 KB
1_075.txt AC 70 ms 8692 KB
1_076.txt AC 157 ms 17776 KB
1_077.txt AC 39 ms 7664 KB
1_078.txt AC 14 ms 2552 KB
1_079.txt AC 67 ms 8564 KB
1_080.txt AC 52 ms 6772 KB
1_081.txt AC 238 ms 24560 KB
1_082.txt AC 222 ms 26608 KB
1_083.txt AC 55 ms 7536 KB
1_084.txt AC 48 ms 8048 KB
1_085.txt AC 227 ms 25840 KB
1_086.txt AC 230 ms 29552 KB
1_087.txt AC 145 ms 20464 KB
1_088.txt AC 93 ms 14192 KB
1_089.txt AC 40 ms 8688 KB
1_090.txt AC 38 ms 8304 KB
1_091.txt AC 164 ms 20848 KB
1_092.txt AC 39 ms 8304 KB
1_093.txt AC 217 ms 24432 KB
1_094.txt AC 173 ms 22896 KB
1_095.txt AC 48 ms 8048 KB
1_096.txt AC 46 ms 8304 KB
1_097.txt AC 217 ms 22896 KB
1_098.txt AC 146 ms 19696 KB
1_099.txt AC 184 ms 19824 KB
1_100.txt AC 126 ms 14960 KB
1_101.txt AC 43 ms 8432 KB
1_102.txt AC 47 ms 8048 KB
1_103.txt AC 186 ms 19696 KB
1_104.txt AC 82 ms 12016 KB
1_105.txt AC 200 ms 19440 KB
1_106.txt AC 167 ms 18416 KB
1_107.txt AC 51 ms 8048 KB
1_108.txt AC 47 ms 8560 KB
1_109.txt AC 207 ms 19312 KB
1_110.txt AC 128 ms 14064 KB
1_111.txt AC 218 ms 19696 KB
1_112.txt AC 161 ms 17648 KB
1_113.txt AC 48 ms 8432 KB
1_114.txt AC 51 ms 8048 KB
1_115.txt AC 214 ms 19568 KB
1_116.txt AC 130 ms 13808 KB