Submission #8319133


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); ++ i)
#define rrp(i,a,b) for (int i = (a); i >= (b); -- i)
#define gc() getchar()
#define fir first
#define sec second
typedef pair<int,int> pii;
typedef long double db;
typedef long long ll;
template <typename tp>
inline void read(tp& x) {
  x = 0; char tmp; bool key = 0;
  for (tmp = gc(); !isdigit(tmp); tmp = gc())
    key = (tmp == '-');
  for (; isdigit(tmp); tmp = gc())
    x = (x << 3) + (x << 1) + (tmp ^ '0');
  if (key) x = -x;
}
template <typename tp>
inline void ckmn(tp& x,tp y) {
  x = x < y ? x : y;
}
template <typename tp>
inline void ckmx(tp& x,tp y) {
  x = x < y ? y : x;
}

const int N = 100010;
struct edge {
  int la,b;
} con[N << 1];
int tot, fir[N];
void add(int from,int to) {
  con[++tot] = (edge) {fir[from], to};
  fir[from] = tot;
}
int n,deg[N],del[N],num,ans,val[N];
char col[N];
int dp[N];
void dfs(int pos,int fa) {
  dp[pos] = val[pos];
  for (int i = fir[pos]; i; i = con[i].la) {
    if (con[i].b == fa) continue;
    if (del[con[i].b]) continue;
    dfs(con[i].b, pos);
    ans = max(ans, dp[pos] + dp[con[i].b]);
    dp[pos] = max(dp[pos], dp[con[i].b] + val[pos]);
  }
}
void prework() {
  queue<int> q;
  rep (i, 1, n) if (col[i] == 'B' && deg[i] <= 1)
    q.push(i);
  for (int pos; !q.empty(); q.pop()) {
    pos = q.front();
    ++ num;
    del[pos] = 1;
    for (int i = fir[pos]; i; i = con[i].la) {
      if (--deg[con[i].b] <= 1 && !del[con[i].b]) {
	if (col[con[i].b] == 'B')
	  q.push(con[i].b);
      }
    }
  }
}
int main() {
  int x,y;
  read(n);
  rep (i, 1, n-1) {
    read(x), read(y);
    add(x, y);
    add(y, x);
    ++ deg[x], ++ deg[y];
  }
  scanf("%s", col+1);
  prework();
  if (num == n) return puts("0"), 0;
  if (num == n-1) return puts("1"), 0;
  int rt = 1;
  rep (i, 1, n) if (del[i] == 0) rt = i;
  rep (i, 1, n) if (del[i] == 0) {
    if (col[i] == 'W' && deg[i] % 2 == 0) val[i] = 1;
    else if (col[i] == 'B' && (deg[i]&1)) val[i] = 1;
    else val[i] = 0;
  }
  // - 2 * num1
  dfs(rt, 0);
  ans = 2 * (n - num - 1) - 2 * ans;
  rep (i, 1, n) ans += val[i];
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task F - Monochrome Cat
User cly_none
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2261 Byte
Status WA
Exec Time 21 ms
Memory 7936 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:76:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", col+1);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 4
AC × 97
WA × 21
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 WA 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 WA 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 WA 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 1 ms 256 KB
1_020.txt WA 1 ms 256 KB
1_021.txt AC 1 ms 256 KB
1_022.txt AC 1 ms 256 KB
1_023.txt WA 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 WA 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 WA 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 WA 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 8 ms 2304 KB
1_046.txt AC 9 ms 2816 KB
1_047.txt WA 17 ms 3072 KB
1_048.txt AC 13 ms 2432 KB
1_049.txt AC 14 ms 4608 KB
1_050.txt AC 13 ms 4352 KB
1_051.txt AC 11 ms 2688 KB
1_052.txt AC 4 ms 1024 KB
1_053.txt WA 13 ms 3072 KB
1_054.txt AC 5 ms 1408 KB
1_055.txt AC 11 ms 2688 KB
1_056.txt AC 7 ms 1792 KB
1_057.txt AC 1 ms 384 KB
1_058.txt AC 10 ms 2944 KB
1_059.txt WA 6 ms 1280 KB
1_060.txt AC 13 ms 2432 KB
1_061.txt AC 17 ms 4736 KB
1_062.txt AC 10 ms 2816 KB
1_063.txt AC 10 ms 2176 KB
1_064.txt AC 8 ms 1920 KB
1_065.txt WA 2 ms 384 KB
1_066.txt AC 13 ms 2816 KB
1_067.txt AC 4 ms 896 KB
1_068.txt AC 9 ms 2296 KB
1_069.txt AC 5 ms 1152 KB
1_070.txt AC 9 ms 2048 KB
1_071.txt WA 15 ms 2816 KB
1_072.txt AC 9 ms 1792 KB
1_073.txt AC 2 ms 512 KB
1_074.txt AC 2 ms 512 KB
1_075.txt AC 8 ms 1664 KB
1_076.txt AC 20 ms 3840 KB
1_077.txt WA 14 ms 2688 KB
1_078.txt AC 5 ms 1152 KB
1_079.txt AC 8 ms 1664 KB
1_080.txt AC 10 ms 2048 KB
1_081.txt AC 20 ms 6016 KB
1_082.txt AC 21 ms 6784 KB
1_083.txt WA 17 ms 3072 KB
1_084.txt AC 17 ms 3072 KB
1_085.txt AC 20 ms 6272 KB
1_086.txt AC 21 ms 7936 KB
1_087.txt AC 14 ms 3456 KB
1_088.txt AC 16 ms 4016 KB
1_089.txt WA 14 ms 3456 KB
1_090.txt AC 14 ms 3456 KB
1_091.txt AC 14 ms 3456 KB
1_092.txt WA 14 ms 3456 KB
1_093.txt AC 19 ms 4736 KB
1_094.txt AC 21 ms 5376 KB
1_095.txt WA 18 ms 3200 KB
1_096.txt AC 18 ms 3200 KB
1_097.txt AC 20 ms 4736 KB
1_098.txt AC 21 ms 6132 KB
1_099.txt AC 16 ms 3456 KB
1_100.txt AC 18 ms 3964 KB
1_101.txt WA 18 ms 3328 KB
1_102.txt AC 17 ms 3328 KB
1_103.txt AC 16 ms 3456 KB
1_104.txt AC 17 ms 3964 KB
1_105.txt AC 18 ms 3456 KB
1_106.txt AC 20 ms 3968 KB
1_107.txt WA 19 ms 3200 KB
1_108.txt AC 19 ms 3200 KB
1_109.txt AC 18 ms 3456 KB
1_110.txt AC 20 ms 4052 KB
1_111.txt AC 18 ms 3456 KB
1_112.txt AC 20 ms 3968 KB
1_113.txt WA 19 ms 3200 KB
1_114.txt AC 19 ms 3200 KB
1_115.txt AC 18 ms 3456 KB
1_116.txt AC 20 ms 4052 KB