結果

問題 No.8113 How Many Liars Are There?
コンテスト
ユーザー amentorimaru
提出日時 2024-04-02 01:57:55
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 5,277 bytes
コンパイル時間 5,071 ms
コンパイル使用メモリ 255,512 KB
実行使用メモリ 13,640 KB
最終ジャッジ日時 2024-09-30 23:01:28
合計ジャッジ時間 8,707 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other TLE * 1 -- * 59
権限があれば一括ダウンロードができます

ソースコード

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;

pair<vector<mint2>, vector<mint2>> dfs(ll now, ll c, ll root) {
  vis[now] = true;
  vector<mint2> res0 = { 1 };
  vector<mint2> res1 = { 0,1 };
  vector<mint2> up = { 0,1 };
  bool loop = false;
  for (auto& [v, a] : g[now]) {
    if (v == root) {
      loop = true;
      continue;
    }
    auto [r0, r1] = dfs(v, c, root);
    ll siz = max(res0.size(), res1.size()) + max(r0.size(), r1.size());
    auto f00 = convolution(res0, r0);
    auto f01 = convolution(res0, r1);
    auto f10 = convolution(res1, r0);    
    auto f11 = convolution(res1, r1);
    res0.assign(max(f00.size() + a, f01.size() + 1 - a), 0);
    res1.assign(max(f10.size() + 1 - a, f11.size() + a), 0);
    REP(i, res0.size()) {
      if (i < f00.size() && f00[i] != 0)
        res0[i + a] = 1;
      if (i < f01.size() && f01[i] != 0)
        res0[i + 1 - a] = 1;
    }
    REP(i, res1.size()) {
      if (i < f11.size() && f11[i] != 0)
        res1[i + a] = 1;
      if (i < f10.size() && f10[i] != 0)
        res1[i + 1 - a] = 1;
    }
  }
  if (loop) {
    if (c) {
      res0 = { 0 };
    }
    else {
      res1 = { 0 };
    }
  }
  return make_pair(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<mint2> ans = { 1 };
  REP(i, n) {
    if (vis[i])continue;
    ll v = getroot(p, i);
    auto [r00, r01] = dfs(v, 0, v);
    auto [r10, r11] = dfs(v, 1, v);
    ll siz = max({ r00.size() + a[v],r01.size() + 1 - a[v], r10.size() + 1 - a[v], r11.size() + a[v] });
    vector<mint2> res(siz);
    REP(i, siz) {
      if (i < r00.size() && r00[i] != 0)
        res[i + a[v]] = 1;
      if (i < r01.size() && r01[i] != 0)
        res[i + 1 - a[v]] = 1;
      if (i < r11.size() && r11[i] != 0)
        res[i + a[v]] = 1;
      if (i < r10.size() && r10[i] != 0)
        res[i + 1 - a[v]] = 1;
    }
    ans = convolution(ans, res);
  }
  if (ans[k] != 0) {
    cout << "Yes";
  }
  else {
    cout << "No";
  }
  return;
}

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