#968675 (C++23) No.3113 How Many Liars Are There?

提出ソース

結果

問題	No.3113 How Many Liars Are There?
ユーザー	👑 amentorimaru
提出日時	2024-04-02 12:32:05
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,152 ms / 2,000 ms
コード長	5,024 bytes
コンパイル時間	5,194 ms
コンパイル使用メモリ	248,876 KB
実行使用メモリ	6,676 KB
最終ジャッジ日時	2024-04-02 12:32:43
合計ジャッジ時間	37,374 ms
ジャッジサーバーID （参考情報）	judge13 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 6,676 KB
testcase_01	AC	3 ms 6,676 KB
testcase_02	AC	10 ms 6,676 KB
testcase_03	AC	10 ms 6,676 KB
testcase_04	AC	1,136 ms 6,676 KB
testcase_05	AC	1,138 ms 6,676 KB
testcase_06	AC	1,140 ms 6,676 KB
testcase_07	AC	1,139 ms 6,676 KB
testcase_08	AC	1,123 ms 6,676 KB
testcase_09	AC	1,105 ms 6,676 KB
testcase_10	AC	1,135 ms 6,676 KB
testcase_11	AC	1,138 ms 6,676 KB
testcase_12	AC	1,132 ms 6,676 KB
testcase_13	AC	1,134 ms 6,676 KB
testcase_14	AC	1,014 ms 6,676 KB
testcase_15	AC	980 ms 6,676 KB
testcase_16	AC	1,152 ms 6,676 KB
testcase_17	AC	1,152 ms 6,676 KB
testcase_18	AC	1,106 ms 6,676 KB
testcase_19	AC	1,105 ms 6,676 KB
testcase_20	AC	377 ms 6,676 KB
testcase_21	AC	379 ms 6,676 KB
testcase_22	AC	379 ms 6,676 KB
testcase_23	AC	379 ms 6,676 KB
testcase_24	AC	224 ms 6,676 KB
testcase_25	AC	27 ms 6,676 KB
testcase_26	AC	77 ms 6,676 KB
testcase_27	AC	250 ms 6,676 KB
testcase_28	AC	467 ms 6,676 KB
testcase_29	AC	248 ms 6,676 KB
testcase_30	AC	1,008 ms 6,676 KB
testcase_31	AC	5 ms 6,676 KB
testcase_32	AC	794 ms 6,676 KB
testcase_33	AC	730 ms 6,676 KB
testcase_34	AC	378 ms 6,676 KB
testcase_35	AC	586 ms 6,676 KB
testcase_36	AC	1,100 ms 6,676 KB
testcase_37	AC	338 ms 6,676 KB
testcase_38	AC	841 ms 6,676 KB
testcase_39	AC	912 ms 6,676 KB
testcase_40	AC	110 ms 6,676 KB
testcase_41	AC	723 ms 6,676 KB
testcase_42	AC	632 ms 6,676 KB
testcase_43	AC	836 ms 6,676 KB
testcase_44	AC	3 ms 6,676 KB
testcase_45	AC	7 ms 6,676 KB
testcase_46	AC	7 ms 6,676 KB
testcase_47	AC	7 ms 6,676 KB
testcase_48	AC	6 ms 6,676 KB
testcase_49	AC	7 ms 6,676 KB
testcase_50	AC	7 ms 6,676 KB
testcase_51	AC	7 ms 6,676 KB
testcase_52	AC	6 ms 6,676 KB
testcase_53	AC	7 ms 6,676 KB
testcase_54	AC	7 ms 6,676 KB
testcase_55	AC	7 ms 6,676 KB
testcase_56	AC	7 ms 6,676 KB
testcase_57	AC	7 ms 6,676 KB
testcase_58	AC	7 ms 6,676 KB
testcase_59	AC	7 ms 6,676 KB
testcase_60	AC	3 ms 6,676 KB
testcase_61	AC	3 ms 6,676 KB
testcase_62	AC	4 ms 6,676 KB
testcase_63	AC	4 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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<bitset<2001>, bitset<2001>> dfs(ll now, ll c, ll root) {
  vis[now] = true;
  bitset<2001> res0, res1;
  res0.set(0);
  res1.set(1);
  bool loop = false;
  for (auto& [v, a] : g[now]) {    
    if (v == root) {
      loop = true;
      continue;
    }
    auto [r0, r1] = dfs(v, c, root);
    REP(i, 1000) {
      ll t = r0[i];
      r0[i] = r0[2000 - i];
      r0[2000 - i] = t;
      t = r1[i];
      r1[i] = r1[2000 - i];
      r1[2000 - i] = t;
    }
    bitset<2001> nres0, nres1;
    REP(i, 2001) {
      nres0[i] = (res0 & (r1 >> (2000 - i + 1 - a))).any() || (res0 & (r0 >> (2000 - i + a))).any();;
      nres1[i] = (res1 & (r0 >> (2000 - i + 1 - a))).any() || (res1 & (r1 >> (2000 - i + a))).any();
    }
    res0 = nres0;
    res1 = nres1;
  }
  if (loop) {
    if (c) {
      res0 = bitset<2001>();
    }
    else {
      res1 = bitset<2001>();
    }
  }
  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;
    s.insert(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]);
  bitset<2001> ans;
  ans.set(0);
  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);
    bitset<2001> res;
    if (a[v]) {
      res = r01;
      res |= r10;
      res |= r00 << 1;
      res |= r11 << 1;
    }
    else {
      res = r00;
      res |= r11;
      res |= r01 << 1;
      res |= r10 << 1;
    }
    bitset<2001> nans;

    REP(i, 1000) {
      ll t = res[i];
      res[i] = res[2000 - i];
      res[2000 - i] = t;
    }
    REP(i, 2001) {
      nans[i] = (ans & (res >> (2000 - i))).any();
    }
    ans = nans;
  }
  if (ans[k]) {
    cout << "Yes";
  }
  else {
    cout << "No";
  }
  return;
}

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

yukicoder

結果

テストケース

ソースコード