結果

問題 No.3113 How Many Liars Are There?
ユーザー 👑 amentorimaruamentorimaru
提出日時 2024-04-01 23:36:56
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,923 bytes
コンパイル時間 5,465 ms
コンパイル使用メモリ 245,976 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-30 22:51:04
合計ジャッジ時間 6,818 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

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

ソースコード

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 };



void solve() {
  ll n, k;
  cin >> n >> k;
  VL p = read(n);
  VL a = read(n);
  DEC(p);
  
  ll low = 0, high = n;
  unordered_set<ll> noRev;
  bool allOne = true;
  bool allZero = true;
  bool noConflict = true;
  REP(i, n)
    noRev.insert(i);
  // Aが全員正直
  {
    dsu d(n * 2);
    vector<bool> use(n * 2);
    REP(i, n) {
      if (a[i]) {
        d.merge(i, p[i] + n);
        d.merge(i + n, p[i]);
      }
      else {
        d.merge(i, p[i]);
        d.merge(i + n, p[i] + n);
      }
      noRev.erase(p[i]);
    }
    VVL c(n * 2);
    REP(i, n) {
      allOne &= a[i] == 1;
      allZero &= a[i] == 0;
    }
    REP(i, n * 2) {
      c[d.leader(i)].push_back(i);
    }
    REP(i, n * 2) {
      if (c[i].empty())
        continue;
      if (use[i])
        continue;
      REP(j, c[i].size()) {
        use[c[i][j] % n] = use[c[i][j] % n + n] = true;
      }
      if (d.same(i%n, i%n + n)) {
        ll mn = 1e18;
        noConflict = false;
        ll now = i;
        REP(j, c[i].size()) {
          dsu dd(n * 2);
          REP(ii, c[i].size()) {
            ll v = c[i][ii];
            if (v >= n)continue;
            if (a[c[i][ii]] ^ (c[i][ii] == c[i][j])){
              dd.merge(v, p[v] + n);
              dd.merge(v + n, p[v]);
            }
            else {
              dd.merge(v, p[v]);
              dd.merge(v + n, p[v] + n);
            }
          }
          if (dd.same(i % n, i % n + n))
            continue;
          ll sum = 0;
          REP(ii, c[i].size()) {
            sum += dd.same(i, c[i][ii]) && c[i][ii] >= n;
          }
          CHMIN(mn, min(sum, ll(c[i].size()) / 2 - sum));
        }
        low += mn + 1;
      }
      else {
        ll tmp = 0;
        REP(j, c[i].size()) {
          tmp += c[i][j] >= n;
        }
        low += min(tmp, ll(c[i].size()) - tmp);
      }
    }
  }

  // Aが全員嘘吐き  
  {
    dsu d(n * 2);
    vector<bool> use(n * 2);
    REP(i, n) {
      if (a[i]) {
        d.merge(i, p[i]);
        d.merge(i + n, p[i] + n);
      }
      else {
        d.merge(i, p[i] + n);
        d.merge(i + n, p[i]);
      }
      noRev.erase(p[i]);
    }
    VVL c(n * 2);
    REP(i, n * 2) {
      c[d.leader(i)].push_back(i);
    }
    REP(i, n * 2) {
      if (c[i].empty())
        continue;
      if (use[i])
        continue;
      REP(j, c[i].size()) {
        use[c[i][j] % n] = use[c[i][j] % n + n] = true;
      }
      if (d.same(i%n, i%n + n)) {
        ll mx = 0;
        noConflict = false;
        ll now = i;
        REP(j, c[i].size()) {
          dsu dd(n * 2);
          REP(ii, c[i].size()) {
            ll v = c[i][ii];
            if (v >= n)continue;
            if (a[c[i][ii]] ^ (c[i][ii] == c[i][j])) {
              dd.merge(v, p[v]);
              dd.merge(v + n, p[v] + n);
            }
            else {
              dd.merge(v, p[v] + n);
              dd.merge(v + n, p[v]);              
            }
          }
          if (dd.same(i % n, i % n + n))
            continue;
          ll sum = 0;
          REP(ii, c[i].size()) {
            sum += dd.same(i, c[i][ii]) && c[i][ii] >= n;            
          }
          CHMAX(mx, max(sum, ll(c[i].size()) / 2 - sum));
        }
        high += mx - 1;
      }
      else {
        ll tmp = 0;
        REP(j, c[i].size()) {
          tmp += c[i][j] >= n;
        }
        high += max(tmp, ll(c[i].size()) - tmp);
      }
    }
  }

  if (k<low || k>high) {
    cout << "No";
    return;
  }
  else if (allZero && noConflict && low == k - 1) {
    cout << "No";
    return;
  }
  else if (allZero && noConflict && noRev.empty() && low == k - 2) {
    cout << "No";
  }
  else if (allOne && noConflict && high == k + 1) {
    cout << "No";
    return;
  }
  else if (allOne && noConflict && noRev.empty() && high == k + 2) {
    cout << "No";
  }
  else {    
    cout << "Yes";
  }
  return;
}

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