結果

問題 No.3113 How Many Liars Are There?
ユーザー 👑 amentorimaruamentorimaru
提出日時 2024-04-02 01:13:29
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 5,754 bytes
コンパイル時間 4,627 ms
コンパイル使用メモリ 251,548 KB
実行使用メモリ 13,632 KB
最終ジャッジ日時 2024-09-30 22:59:36
合計ジャッジ時間 8,207 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
13,632 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 TLE -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
testcase_52 -- -
testcase_53 -- -
testcase_54 -- -
testcase_55 -- -
testcase_56 -- -
testcase_57 -- -
testcase_58 -- -
testcase_59 -- -
testcase_60 -- -
testcase_61 -- -
testcase_62 -- -
testcase_63 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define ATCODER
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>
#include <chrono>
#include <type_traits>
using namespace std;

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

//template<claLR T> using pq = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define CHMAX(n,v) n=n<v?v:n
#define CHMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) x1*y2-x2*y1
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}

template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}

using val = ll;
using func = ll;

val op(val a, val b) {
  return max(a, b);
}
val e() { return -1e18; }

//val mp(func f, val a) {
//  return MP(a.first + f, a.second);
//}
//func comp(func f, func g) {
//  return f + g;
//}
//func id() { return 0; }

ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
ll si[4] = { 0,3,3,0 };
ll sj[4] = { 0,0,3,3 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };

vector<VP> g;
ll n, k;
vector<bool> vis;

tuple<ll, vector<bool>, vector<bool>> dfs(ll now, ll c, ll root) {
  ll child = 1;
  vis[now] = true;
  vector<bool> res0 = { true,false };
  vector<bool> res1 = { false,true };
  bool loop = false;
  for (auto& [v, a] : g[now]) {    
    if (v == root) {
      loop = true;
      continue;
    }
    auto [ch, r0, r1] = dfs(v, c, root);
    child += ch;
    ll siz = max(res0.size(), res1.size()) + max(r0.size(), r1.size());
    vector<bool> nres0(siz);
    vector<bool> nres1(siz);
    REP(i, res0.size()) {
      REP(j, r0.size()) {
        nres0[i + j + a] = nres0[i + j + a] || (res0[i] && r0[j]);
      }
    }
    REP(i, res0.size()) {
      REP(j, r1.size()) {
        nres0[i + j + 1 - a] = nres0[i + j + 1 - a] || (res0[i] && r1[j]);
      }
    }
    REP(i, res1.size()) {
      REP(j, r0.size()) {
        nres1[i + j + 1 - a] = nres1[i + j + 1 - a] || (res1[i] && r0[j]);
      }
    }
    REP(i, res1.size()) {
      REP(j, r1.size()) {
        nres1[i + j + a] = nres1[i + j + a] || (res1[i] && r1[j]);
      }
    }
    res0 = nres0;
    res1 = nres1;
  }
  if (loop) {
    if (c) {
      REP(i, res0.size()) {
        res0[i] = false;
      }
    }
    else {
      REP(i, res1.size()) {
        res1[i] = false;
      }
    }
  }
  return make_tuple(child, res0, res1);
}

ll getroot(VL& p, ll v) {
  unordered_set<ll> s;
  s.insert(v);
  while (1) {
    v = p[v];
    if (s.find(v) != s.end())
      return v;
  }
  return -1;
}

void solve() {
  cin >> n >> k;
  VL p = read(n);
  VL a = read(n);
  vis.resize(n);
  g.resize(n);
  DEC(p);
  REP(i, n)
    g[p[i]].emplace_back(i, a[i]);
  vector<bool> ans = { true };
  REP(i, n) {
    if (vis[i])continue;
    ll v = getroot(p, i);
    auto [cc0, r00, r01] = dfs(v, 0, v);
    auto [cc1, r10, r11] = dfs(v, 1, v);
    vector<bool> res;
    if (a[v]) {
      res = r01;
      res.push_back(false);
      REP(i, r10.size()) {
        res[i] = r10[i] || res[i];
      }
      REP(i, r00.size()) {
        res[i + 1] = r00[i] || res[i + 1];
      }
      REP(i, r11.size()) {
        res[i + 1] = r11[i] || res[i + 1];
      }
    }
    else {
      res = r00;
      res.push_back(false);
      REP(i, r11.size()) {
        res[i] = r11[i] || res[i];
      }
      REP(i, r01.size()) {
        res[i + 1] = r01[i] || res[i + 1];
      }
      REP(i, r10.size()) {
        res[i + 1] = r10[i] || res[i + 1];
      }
    }
    vector<bool> nans(ans.size() + res.size() - 1);
    REP(i, ans.size()) {
      REP(j, res.size()) {
        nans[i + j] = nans[i + j] || (ans[i] && res[j]);
      }
    }
    ans = nans;
  }
  if (ans[k]) {
    cout << "Yes";
  }
  else {
    cout << "No";
  }
  return;
}

int main() {
  ll t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
0