Submission #3423409


Source Code Expand

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

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <db, db> pdd;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;

#define FOR(k,a,b) for(int k=(a); k<=(b); ++k)
#define IFOR(k,a,b) for(int k=(a); k>=(b); --k)
#define REP(k,a) for(int k=0; k<(a);++k)
#define IREP(k,a) for(int k=a-1; k>=(0);--k)
#define SZ(a) int((a).size())
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define x first
#define y second
#define INF 1000000001
#define INFLONG 1000000000000000000
#define MOD 1000000007
#define MAX 100
#define ITERS 100
#define MAXM 200000
#define MAXN 1000000
#define PI 3.1415926535897932384626
#define ERR -987654321
#define MEM(a,b) memset(a,b,sizeof(a));
#define read1(a) scanf("%d",&a)
#define read2(a,b) scanf("%d%d",&a,&b)
#define read3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define readl1(a) scanf("%lld",&a)
#define readl2(a,b) scanf("%lld%lld",&a,&b)
#define readl3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)

int deg[MAXN], color[MAXN], isValid[MAXN], visited[MAXN];
vi v[MAXN], g[MAXN];

int weight[MAXN], node, wt;

void dfs(int p, int len, int flag) {
    visited[p] = flag;
    if(len + weight[p] >= wt) {
        wt = len;
        node = p;
    }
    for(auto i: g[p]) {
        if(visited[i] == flag) continue;
        dfs(i, len+weight[p], flag);
    }
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    int rn = uniform_int_distribution<int>(0, MAXN)(rng);

    int n;
    char c;
    cin>>n;
    REP(i,n-1) {
        int x,y;
        cin>>x>>y;
        x--, y--;
        v[x].PB(y); v[y].PB(x);
        deg[x]++; deg[y]++;
    }
    int count = 0;
    REP(i,n) {
        cin>>c;
        if(c == 'W') color[i] = 0, count++;
        else color[i] = 1;
    }
    
    if(count == 0) {
        cout<<"0"; return 0;
    } else if(count == 1) {
        cout<<"1"; return 0;
    }

    queue<int> q;
    REP(i,n) if(deg[i] == 1 && color[i] == 1) q.push(i);
    MEM(isValid, 1);
    while(!q.empty()) {
        int p = q.front();
        isValid[p] = 0;
        q.pop();
        for(auto i: v[p]) {
            if(deg[i] <= 1 || !isValid[i]) continue;
            deg[i] -= 1;
            if(deg[i] == 1 && color[i] == 1) q.push(i);
        }
    }

    int edges = 0, bv = 0, st = -1;
    REP(i,n) {
        if(!isValid[i]) continue;
        st = i;
        for(auto j: v[i]) if(isValid[j]) g[i].PB(j);
        edges += g[i].size();
        if((color[i] == 1 && g[i].size()%2 == 1) || (color[i] == 0 && g[i].size()%2 == 0)) weight[i] = 2, bv += 1;
        else weight[i] = 0;
    }

    wt = -1;
    dfs(st,0,1);
    wt = -1, st = node;
    dfs(st,0,2);

    int res = edges + bv - wt;
    cout<<res;

    return 0;
}

Submission Info

Submission Time
Task F - Monochrome Cat
User alokpatra1998
Language C++14 (GCC 5.4.1)
Score 800
Code Size 3043 Byte
Status AC
Exec Time 78 ms
Memory 68992 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 19 ms 57600 KB
0_001.txt AC 19 ms 57600 KB
0_002.txt AC 17 ms 51456 KB
0_003.txt AC 18 ms 57600 KB
1_003.txt AC 16 ms 51456 KB
1_004.txt AC 16 ms 51456 KB
1_005.txt AC 17 ms 53504 KB
1_006.txt AC 17 ms 53504 KB
1_007.txt AC 17 ms 53504 KB
1_008.txt AC 18 ms 57600 KB
1_009.txt AC 18 ms 57600 KB
1_010.txt AC 18 ms 57600 KB
1_011.txt AC 17 ms 53504 KB
1_012.txt AC 17 ms 53504 KB
1_013.txt AC 18 ms 57600 KB
1_014.txt AC 18 ms 57600 KB
1_015.txt AC 18 ms 57600 KB
1_016.txt AC 18 ms 57600 KB
1_017.txt AC 17 ms 53504 KB
1_018.txt AC 17 ms 53504 KB
1_019.txt AC 18 ms 57600 KB
1_020.txt AC 17 ms 53504 KB
1_021.txt AC 19 ms 57600 KB
1_022.txt AC 18 ms 57600 KB
1_023.txt AC 17 ms 53504 KB
1_024.txt AC 17 ms 53504 KB
1_025.txt AC 18 ms 57600 KB
1_026.txt AC 18 ms 57600 KB
1_027.txt AC 19 ms 57600 KB
1_028.txt AC 18 ms 57600 KB
1_029.txt AC 17 ms 53504 KB
1_030.txt AC 17 ms 53504 KB
1_031.txt AC 18 ms 57600 KB
1_032.txt AC 18 ms 57600 KB
1_033.txt AC 18 ms 57600 KB
1_034.txt AC 18 ms 57600 KB
1_035.txt AC 17 ms 53504 KB
1_036.txt AC 17 ms 53504 KB
1_037.txt AC 18 ms 57600 KB
1_038.txt AC 18 ms 57600 KB
1_039.txt AC 18 ms 57600 KB
1_040.txt AC 18 ms 57600 KB
1_041.txt AC 17 ms 53504 KB
1_042.txt AC 17 ms 53504 KB
1_043.txt AC 18 ms 57600 KB
1_044.txt AC 18 ms 57600 KB
1_045.txt AC 38 ms 61696 KB
1_046.txt AC 43 ms 62464 KB
1_047.txt AC 51 ms 56576 KB
1_048.txt AC 42 ms 55808 KB
1_049.txt AC 58 ms 65664 KB
1_050.txt AC 54 ms 64768 KB
1_051.txt AC 49 ms 63224 KB
1_052.txt AC 25 ms 58624 KB
1_053.txt AC 41 ms 56568 KB
1_054.txt AC 27 ms 54780 KB
1_055.txt AC 46 ms 63096 KB
1_056.txt AC 30 ms 55164 KB
1_057.txt AC 19 ms 57728 KB
1_058.txt AC 42 ms 61440 KB
1_059.txt AC 29 ms 54656 KB
1_060.txt AC 42 ms 55808 KB
1_061.txt AC 65 ms 64896 KB
1_062.txt AC 42 ms 61184 KB
1_063.txt AC 46 ms 61824 KB
1_064.txt AC 38 ms 60032 KB
1_065.txt AC 18 ms 53760 KB
1_066.txt AC 42 ms 56188 KB
1_067.txt AC 27 ms 58880 KB
1_068.txt AC 39 ms 60160 KB
1_069.txt AC 32 ms 59392 KB
1_070.txt AC 42 ms 60416 KB
1_071.txt AC 45 ms 56192 KB
1_072.txt AC 34 ms 55168 KB
1_073.txt AC 23 ms 58240 KB
1_074.txt AC 21 ms 57856 KB
1_075.txt AC 42 ms 60544 KB
1_076.txt AC 70 ms 63360 KB
1_077.txt AC 45 ms 56064 KB
1_078.txt AC 27 ms 54400 KB
1_079.txt AC 41 ms 60416 KB
1_080.txt AC 41 ms 60160 KB
1_081.txt AC 76 ms 68992 KB
1_082.txt AC 78 ms 68992 KB
1_083.txt AC 52 ms 56704 KB
1_084.txt AC 51 ms 56704 KB
1_085.txt AC 76 ms 68992 KB
1_086.txt AC 76 ms 68992 KB
1_087.txt AC 57 ms 65016 KB
1_088.txt AC 55 ms 63224 KB
1_089.txt AC 45 ms 57080 KB
1_090.txt AC 45 ms 57080 KB
1_091.txt AC 57 ms 65016 KB
1_092.txt AC 46 ms 57080 KB
1_093.txt AC 76 ms 66688 KB
1_094.txt AC 74 ms 66048 KB
1_095.txt AC 51 ms 56704 KB
1_096.txt AC 51 ms 56704 KB
1_097.txt AC 76 ms 65664 KB
1_098.txt AC 71 ms 65536 KB
1_099.txt AC 66 ms 64636 KB
1_100.txt AC 64 ms 63356 KB
1_101.txt AC 49 ms 56828 KB
1_102.txt AC 49 ms 56828 KB
1_103.txt AC 67 ms 64636 KB
1_104.txt AC 60 ms 62460 KB
1_105.txt AC 75 ms 64384 KB
1_106.txt AC 71 ms 63488 KB
1_107.txt AC 51 ms 56704 KB
1_108.txt AC 51 ms 56704 KB
1_109.txt AC 74 ms 64384 KB
1_110.txt AC 68 ms 62976 KB
1_111.txt AC 74 ms 64384 KB
1_112.txt AC 72 ms 63488 KB
1_113.txt AC 52 ms 56704 KB
1_114.txt AC 51 ms 56704 KB
1_115.txt AC 74 ms 64384 KB
1_116.txt AC 68 ms 62976 KB