Problem:
D: Two Colors Sort
問題
umg 君は散歩中に
1,2, ... ,N
を並び変えてできる長さ
N
の数列
P_1, P_2, ..., P_N
を見つけました。
umg 君は不思議な力を使うことで、同じ色に塗られた異なる数を二つ選んで場所を交換することができます。
umg 君は、数列に含まれる数のうち
R
個を赤に、残りの
N-R
個を青に塗ることで数列を昇順に並び替えられるようにしたいと考えました。
umg 君が目標を達成できるかどうか判定してください。
ただし、数字はとても重いので不思議な力を使わずに動かすことはできません。また、umg 君は天才なので不思議な力を任意の回数使うことができます。
入力形式
N
R
P_1
P_2
...
P_N
制約
1 \leq N \leq 3 \times 10^5
1 \leq R \leq N
1\leq P_i \leq N
P_i \neq P_j
(
1 \leq i < j \leq N
)
入力は全て整数である。
出力形式
umg 君が目的を達成できるなら
Yes
、そうでなければ
No
を一行に出力せよ。
入力例 1
3 2
1 3 2
出力例 1
Yes
1
を青に、
2,3
を赤に塗ることで目標が達成できます。
入力例 2
5 2
1 2 3 4 5
出力例 2
Yes
初めから昇順に並んでいます。
入力例 3
10 7
3 4 8 5 7 6 2 10 1 9
出力例 3
No

Submitted solutions:

code_snippet: #include <bits/stdc++.h>
using namespace std;
using ll =long long;
using vll=vector<ll>;
using vvll=vector<vll>;
#define rep(i,n) for(ll i=0;i<n;i++)

int main() {
    ll N,R;
    cin>>N>>R;
    vll P(N);
    rep(i,N){
        cin>>P[i];
        P[i]--;
    }
    vll V;
    vector<bool> seen(N,0);
    ll c=0;
    rep(i,N){
        if(seen[i])continue;
        if(P[i]==i){
            c++;
            continue;
            
        }
        ll x=P[i],cnt=1;
        while(x!=i){
            seen[x]=1;
            x=P[x];
            cnt++;
        }
        V.push_back(cnt);
    }
    bitset<300001> S;
    S[0]=1;
    ll VN=V.size();
    rep(i,VN)S=S|S<<V[i];
    for(ll i=max(0ll,R-c);i<=R;i++)if(S[i]==1){
        cout<<"Yes"<<endl;
        return 0;
    }
    cout<<"No"<<endl;
}
accuracy: 1
time_ms: 1470
memory_kb: 7512
final_rank: 17

code_snippet: #include<bits/stdc++.h>
using namespace std;

const int INF = 1e9;
int main(){
	int N, R; cin >> N >> R;
	vector<int> P(N);
	for(int i = 0; i < N; i++){
			cin >> P[i];
			P[i]--;
	}

	
	vector<int> no(N, -1);
	int col = 0;

	auto dfs = [&](auto self, int u) -> int {
		if(no[u] !=	-1) return no[u];
		return no[u] = self(self, P[u]);
	};

	for(int i = 0; i < N; i++){
		if(no[i] == -1){
			no[i] = col;
			no[P[i]] = dfs(dfs, P[i]);
			if(no[i] != no[P[i]]) no[i] = no[P[i]];
			else col++;
		}
		//cerr << no[i] << " ";
	}
	for(int i = 0; i < N; i++){
		//cerr << no[i] << " ";		
	}
	//cerr << endl;

	vector<int> cnt(N + 1, 0);

	vector<int> tmp(N);
	for(int i = 0; i < N; i++){
		tmp[no[i]]++;		
	}
	for(int i = 0; i < N; i++){
		cnt[tmp[i]]++;
	}

	//int M = 0;
	for(int i = 1; i < N + 1; i++){
		//cerr << cnt[i] << endl;		
		//if(cnt[i] > 0) M++;
	}

	vector<int> dp(N + 1, INF);
	dp[0] = 0;
	
	for(int i = 1; i < N + 1; i++){
		if(cnt[i] == 0) continue;
		for(int j = 0; j < N + 1; j++){
			if(dp[j] < INF && j + i <= N && dp[j] < cnt[i]){
					dp[j + i] = min(dp[j + i], dp[j] + 1);	
			}
		}
		for(int j = 0; j < N + 1; j++){
			if(dp[j] < INF) dp[j] = 0; // satisfiable
		}
	}

	if(dp[R] < INF) cout << "Yes" << endl;
	else cout << "No" << endl;
}
accuracy: 1
time_ms: 430
memory_kb: 21116
final_rank: 9

code_snippet: #include<bits/stdc++.h>

using namespace std;

const int N = 1.5e5+10;

bool calc(int n,int r,vector<int> sizes){
  bitset<N> dp;
  dp[0] = 1;
  for(auto i:sizes){
    dp = dp | (dp << i);
  }
  for(auto i:{r,n-r}){
    if(i >= N)continue;
    if(dp[i])return true;
  }
  return false;
}


bool func(){
  int n;
  int r;
  cin >> n >> r;

  vector<int> as(n);

  for(auto &i:as){
    cin >> i;
    --i;
  }

  vector<bool> used(n,false);
  vector<int> sizes;
  for(int i=0;i<n;++i){
    if(used[i])continue;
    int cnt = 0;
    int p = i;
    while(not used[p]){
      ++cnt;
      used[p] = true;
      p = as[p];
    }
    sizes.push_back(cnt);
  }

  return calc(n,r,sizes);
}

int main(){
  cout << (func() ? "Yes" : "No") << endl;
}
accuracy: 1
time_ms: 1270
memory_kb: 6748
final_rank: 15

code_snippet: #include<bits/stdc++.h>

using namespace std;

const int N = 1.5e5+10;

bool calc(int n,int r,vector<int> sizes){
  int x = sqrt(sizes.size()) + 1;
  auto f = [&](vector<int> as){
    bitset<N> dp;
    dp[0] = 1;
    for(auto i:as){
      bitset<N> dp2 = dp | (dp << i);
      swap(dp,dp2);
    }
    vector<int> res;
    for(int i=1;i<N;++i){
      if(dp[i])res.push_back(i);
    }
    return res;
  };
  vector<int> line;
  for(int i=0;i<(int)sizes.size();i += x){
    int j = min<int>(sizes.size(), i+x);
    vector<int> use(sizes.begin()+i, sizes.begin()+j);
    for(auto k:f(use)){
      line.push_back(k);
    }
  }
  bitset<N> dp;
  dp[0] = 1;
  for(auto i:line){
    bitset<N> dp2 = dp | (dp << i);
    swap(dp,dp2);
  }
  for(auto i:{r,n-r}){
    if(i >= N)continue;
    if(dp[i])return true;
  }
  return false;
}


bool func(){
  int n;
  int r;
  cin >> n >> r;

  vector<int> as(n);

  for(auto &i:as){
    cin >> i;
    --i;
  }

  vector<bool> used(n,false);
  vector<int> sizes;
  for(int i=0;i<n;++i){
    if(used[i])continue;
    int cnt = 0;
    int p = i;
    while(not used[p]){
      ++cnt;
      used[p] = true;
      p = as[p];
    }
    sizes.push_back(cnt);
  }

  return calc(n,r,sizes);
}

int main(){
  cout << (func() ? "Yes" : "No") << endl;
}
accuracy: 0.3157894736842105
time_ms: 90
memory_kb: 4040
final_rank: 20

code_snippet: #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=9167167167167167167;
const int INF=10000000;

#define rep(i,a) for (int i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

namespace po167{
struct UFtree
{
	int _n;
	std::vector<int> wei;
	std::vector<int> q;
	int component;
	UFtree(int n):_n(n),wei(n),component(n),par(n){
		for(int i=0;i<n;i++){
			wei[i]=1,par[i]=i;
		}
	}
	void intialize(){
		for(auto x:q){
			wei[root(x)]=1;
			par[x]=x;
		}
		component=(int)par.size();
		q={};
	}
	//根っこを返す
	int root(int a){
		assert(0<=a&&a<_n);
		if(a==par[a]) return a;
		return par[a]=root(par[a]);
	}
	//trueなら1,falseなら0
	int same(int a,int b){
		assert(0<=a&&a<_n);
		assert(0<=b&&b<_n);
		if(root(a)==root(b)) return 1;
		else return 0;
	}
	//a,bが違う根っこの元なら結合する,結合したらtrueを返す
	bool unite(int a,int b){
		a=root(a),b=root(b);
		if(a==b) return false;
		if(wei[a]<wei[b]) std::swap(a,b);
		par[b]=a;
		q.push_back(b);
		wei[a]+=wei[b];
		component--;
		return true;
	}
	private:
	std::vector<int> par;
};
}
using po167::UFtree;


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,R;
	cin>>N>>R;
	UFtree T(N);
	rep(i,N){
		int a;
		cin>>a;
		T.unite(i,a-1);
	}
	vector<int> p(N+1);
	rep(i,N) if(T.root(i)==i) p[T.wei[i]]++;
	vector<bool> dp(N+1),tmp(N+1);
	dp[0]=1;
	rep(i,N+1){
		if(p[i]==0) continue;
		vector<int> q(i);
		for(int j=0;j<=N;j++){
			if(tmp[j]) dp[j]=1;
			if(q[j%i]) tmp[j]=1;
			if(dp[j]) q[j%i]++;
			if(j>=i*p[i]){
				if(dp[j-i*p[i]]) q[j%i]--;
			}
		}
	}
	yneos(tmp[R]||dp[R]);
}
accuracy: 1
time_ms: 850
memory_kb: 8584
final_rank: 10

code_snippet: #include <bits/stdc++.h>

namespace std {

template<class Fun>
class y_combinator_result {
	Fun fun_;
public:
	template<class T>
	explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

	template<class ...Args>
	decltype(auto) operator()(Args &&...args) {
		return fun_(std::ref(*this), std::forward<Args>(args)...);
	}
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
	return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

} // namespace std

int main() {
	using namespace std;
	ios_base::sync_with_stdio(false), cin.tie(nullptr);

	int N, R; cin >> N >> R;
	vector<int> par(N, -1);
	auto get_par = y_combinator([&](auto self, int i) -> int {
		return par[i] < 0 ? i : (par[i] = self(par[i]));
	});
	auto merge = [&](int a, int b) -> void {
		a = get_par(a);
		b = get_par(b);
		if (a == b) return;
		if (-par[a] < -par[b]) swap(a, b);
		par[a] += par[b];
		par[b] = a;
	};
	for (int i = 0; i < N; i++) {
		int p; cin >> p; p--;
		merge(i, p);
	}

	R = min(R, N-R);
	const int B = 150010;
	assert(R < B);
	bitset<B> poss; poss[0] = true;
	vector<int> sz_freq(R+1);
	for (int i = 0; i < N; i++) {
		if (par[i] < 0) {
			int sz = -par[i];
			if (sz > N-R) { // faster, maybe
				cout << "No" << '\n';
				exit(0);
			}
			if (sz <= R) {
				sz_freq[sz]++;
			}
		}
	}
	for (int s = 1; s <= R; s++) {
		int f = sz_freq[s];
		for (int k = 1; k <= f; k *= 2) {
			poss |= poss << (k * s);
		}
	}
	cout << (poss[R] ? "Yes" : "No") << '\n';

	return 0;
}
accuracy: 1
time_ms: 20
memory_kb: 5124
final_rank: 1

code_snippet: #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }


struct union_find{
  public:
    union_find(int size): _n(size), root(size, -1) {}

    int find(int x){
        if (root[x] < 0) return x;
        root[x] = find(root[x]);
        return root[x];
    }
    bool same(int x, int y){
        return find(x) == find(y);
    }
    bool merge(int x, int y){
        x = find(x); y = find(y);
        if (x == y) return false;
        if (-root[x] < -root[y]) swap(x, y);
        root[x] += root[y];
        root[y] = x;
        return true;
    }
    int size(int x){
        return -root[x];
    }
  private:
    int _n;
    vector<int> root;
};


int main() {
    int n, r; cin >> n >> r;
    chmin(r, n-r);
    vector<int> p(n);
    for(int i=0; i<n; ++i) {
        cin >> p[i];
        p[i]--;
    }

    map<int, int> mp;
    union_find uf(n);
    for(int i=0; i<n; ++i) uf.merge(i, p[i]);
    for(int i=0; i<n; ++i) {
        if (i == uf.find(i)) {
            mp[uf.size(i)]++;
        }
    }

    vector<int> dp(r+1, 0);
    for(auto wm: mp) {
        for(int a=0; a<wm.first; ++a) {
            deque<int> qv, qi;
            for(int i=0; wm.first*i+a<=r; ++i) {
                int val = dp[wm.first * i + a] - i * wm.first;
                while(!qv.empty() && qv.back() <= val) {
                    qv.pop_front();
                    qi.pop_front();
                } 
                qv.push_back(val);
                qi.push_back(i);
                dp[wm.first*i+a] = qv.front() + i * wm.first;
                if (!qi.empty() && qi.front() <= i - wm.second) {
                    qi.pop_front();
                    qv.pop_front();
                }
            }
        }
    }
    cout << (dp[r] == r ? "Yes" : "No") << endl;
}
accuracy: 1
time_ms: 550
memory_kb: 7128
final_rank: 7

code_snippet: // #undef _GLIBCXX_DEBUG
// #define NDEBUG
#include <bits/extc++.h>

int main() {
  using namespace std;

  int n, m;
  cin >> n >> m;
  vector<int> p(n);
  for (auto &&x : p) {
    cin >> x;
    --x;
  }

  vector<int> c, used(n);
  int ones = 0;
  for (auto x : p) {
    if (used[x]) {
      continue;
    }
    c.emplace_back(0);
    for (auto y = x;;) {
      used[y] = 1;
      y = p[y];
      c.back()++;
      if (y == x) break;
    }
    if (c.back() == 1) {
      c.pop_back();
      ones++;
    }
  }

  bitset<300001> dp;
  dp.set(0);
  for (auto &&x : c) {
    dp |= dp << x;
  }
  for (auto x = m; x >= m - ones; --x) {
    if (dp[x]) {
      cout << "Yes\n";
      return 0;
    }
  }
  cout << "No"
       << "\n";
}
accuracy: 1
time_ms: 1110
memory_kb: 6488
final_rank: 12

code_snippet: #line 2 "/home/yuruhiya/programming/library/template/template.cpp"
#include <bits/stdc++.h>
#line 4 "/home/yuruhiya/programming/library/template/constants.cpp"
#include <string_view>
#line 7 "/home/yuruhiya/programming/library/template/constants.cpp"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define unless(c) if (!(c))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)

using namespace std;
using ll = long long;
using LD = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<LD>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<ll, ll>;
using VPL = vector<PLL>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000000;
constexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;
constexpr long double PI = 3.14159265358979323846, EPS = 1e-12;
namespace CharacterClass {
	constexpr string_view
	    digit = "0123456789",
	    xdigit = "0123456789ABCDEFabcdef", lower = "abcdefghijklmnopqrstuvwxyz",
	    upper = "ABCDEFGHIJKLMNOPQRSTUVWXYZ",
	    alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz",
	    alnum = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz",
	    word = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz",
	    punct = R"(!"#$%&'()*+,-./:;<=>?@[\]^_`{|}~)",
	    graph =
	        R"(!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~)",
	    print =
	        R"( !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~)",
	    blank = " \t", space = " \t\n\r\f\v";
}  // namespace CharacterClass
#line 7 "/home/yuruhiya/programming/library/template/Input.cpp"
using namespace std;

#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#define fwrite_unlocked fwrite
#define fflush_unlocked fflush
#endif
class Scanner {
	static int gc() {
		return getchar_unlocked();
	}
	static char next_char() {
		char c;
		read(c);
		return c;
	}
	template <class T> static void read(T& v) {
		cin >> v;
	}
	static void read(char& v) {
		while (isspace(v = gc()))
			;
	}
	static void read(bool& v) {
		v = next_char() != '0';
	}
	static void read(string& v) {
		v.clear();
		for (char c = next_char(); !isspace(c); c = gc()) v += c;
	}
	static void read(int& v) {
		v = 0;
		bool neg = false;
		char c = next_char();
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c); c = gc()) v = v * 10 + (c - '0');
		if (neg) v = -v;
	}
	static void read(long long& v) {
		v = 0;
		bool neg = false;
		char c = next_char();
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c); c = gc()) v = v * 10 + (c - '0');
		if (neg) v = -v;
	}
	static void read(double& v) {
		v = 0;
		double dp = 1;
		bool neg = false, after_dp = false;
		char c = next_char();
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.') {
				after_dp = true;
			} else if (after_dp) {
				v += (c - '0') * (dp *= 0.1);
			} else {
				v = v * 10 + (c - '0');
			}
		}
		if (neg) v = -v;
	}
	static void read(long double& v) {
		v = 0;
		long double dp = 1;
		bool neg = false, after_dp = false;
		char c = next_char();
		if (c == '-') {
			neg = true;
			c = gc();
		}
		for (; isdigit(c) || c == '.'; c = gc()) {
			if (c == '.') {
				after_dp = true;
			} else if (after_dp) {
				v += (c - '0') * (dp *= 0.1);
			} else {
				v = v * 10 + (c - '0');
			}
		}
		if (neg) v = -v;
	}
	template <class T, class U> static void read(pair<T, U>& v) {
		read(v.first);
		read(v.second);
	}
	template <class T> static void read(vector<T>& v) {
		for (auto& e : v) read(e);
	}
	template <size_t N = 0, class T> static void read_tuple_impl(T& v) {
		if constexpr (N < tuple_size_v<T>) {
			read(get<N>(v));
			read_tuple_impl<N + 1>(v);
		}
	}
	template <class... T> static void read(tuple<T...>& v) {
		read_tuple_impl(v);
	}
	struct ReadVectorHelper {
		size_t n;
		ReadVectorHelper(size_t _n) : n(_n) {}
		template <class T> operator vector<T>() {
			vector<T> v(n);
			read(v);
			return v;
		}
	};
	struct Read2DVectorHelper {
		size_t n, m;
		Read2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}
		template <class T> operator vector<vector<T>>() {
			vector<vector<T>> v(n, vector<T>(m));
			read(v);
			return v;
		}
	};

public:
	string read_line() const {
		string v;
		for (char c = gc(); c != '\n' && c != '\0'; c = gc()) v += c;
		return v;
	}
	template <class T> T read() const {
		T v;
		read(v);
		return v;
	}
	template <class T> vector<T> read_vector(size_t n) const {
		vector<T> a(n);
		read(a);
		return a;
	}
	template <class T> operator T() const {
		return read<T>();
	}
	int operator--(int) const {
		return read<int>() - 1;
	}
	ReadVectorHelper operator[](size_t n) const {
		return ReadVectorHelper(n);
	}
	Read2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {
		return Read2DVectorHelper(nm);
	}
	void operator()() const {}
	template <class H, class... T> void operator()(H&& h, T&&... t) const {
		read(h);
		operator()(forward<T>(t)...);
	}

private:
	template <template <class...> class, class...> struct Multiple;
	template <template <class...> class V, class Head, class... Tail>
	struct Multiple<V, Head, Tail...> {
		template <class... Args> using vec = V<vector<Head>, Args...>;
		using type = typename Multiple<vec, Tail...>::type;
	};
	template <template <class...> class V> struct Multiple<V> { using type = V<>; };
	template <class... T> using multiple_t = typename Multiple<tuple, T...>::type;
	template <size_t N = 0, class T> void multiple_impl(T& t) const {
		if constexpr (N < tuple_size_v<T>) {
			auto& vec = get<N>(t);
			using V = typename remove_reference_t<decltype(vec)>::value_type;
			vec.push_back(read<V>());
			multiple_impl<N + 1>(t);
		}
	}

public:
	template <class... T> auto multiple(size_t h) const {
		multiple_t<T...> result;
		while (h--) multiple_impl(result);
		return result;
	}
} in;
#define inputs(T, ...) \
	T __VA_ARGS__;     \
	in(__VA_ARGS__)
#define ini(...) inputs(int, __VA_ARGS__)
#define inl(...) inputs(long long, __VA_ARGS__)
#define ins(...) inputs(string, __VA_ARGS__)
#line 7 "/home/yuruhiya/programming/library/template/Output.cpp"
#include <charconv>
#line 10 "/home/yuruhiya/programming/library/template/Output.cpp"
using namespace std;

struct BoolStr {
	const char *t, *f;
	BoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
	const char *d, *l;
	DivStr(const char* _d, const char* _l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
    no_endl(" ", "");
class Printer {
	BoolStr B{Yes};
	DivStr D{spc};

public:
	void print(int v) const {
		char buf[12]{};
		if (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {
			fwrite(buf, sizeof(char), ptr - buf, stdout);
		} else {
			assert(false);
		}
	}
	void print(long long v) const {
		char buf[21]{};
		if (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {
			fwrite(buf, sizeof(char), ptr - buf, stdout);
		} else {
			assert(false);
		}
	}
	void print(bool v) const {
		print(v ? B.t : B.f);
	}
	void print(vector<bool>::reference v) const {
		print(v ? B.t : B.f);
	}
	void print(char v) const {
		putchar_unlocked(v);
	}
	void print(const char* v) const {
		fwrite_unlocked(v, 1, strlen(v), stdout);
	}
	void print(double v) const {
		printf("%.20f", v);
	}
	void print(long double v) const {
		printf("%.20Lf", v);
	}
	template <class T> void print(const T& v) const {
		cout << v;
	}
	template <class T, class U> void print(const pair<T, U>& v) const {
		print(v.first);
		print(D.d);
		print(v.second);
	}
	template <class InputIterater>
	void print_range(const InputIterater& begin, const InputIterater& end) const {
		for (InputIterater i = begin; i != end; ++i) {
			if (i != begin) print(D.d);
			print(*i);
		}
	}
	template <class T> void print(const vector<T>& v) const {
		print_range(v.begin(), v.end());
	}
	template <class T, size_t N> void print(const array<T, N>& v) const {
		print_range(v.begin(), v.end());
	}
	template <class T> void print(const vector<vector<T>>& v) const {
		for (size_t i = 0; i < v.size(); ++i) {
			if (i) print(D.l);
			print(v[i]);
		}
	}

	Printer() = default;
	Printer(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}
	Printer& operator()() {
		print(D.l);
		return *this;
	}
	template <class H> Printer& operator()(H&& h) {
		print(h);
		print(D.l);
		return *this;
	}
	template <class H, class... T> Printer& operator()(H&& h, T&&... t) {
		print(h);
		print(D.d);
		return operator()(forward<T>(t)...);
	}
	template <class InputIterator>
	Printer& range(const InputIterator& begin, const InputIterator& end) {
		print_range(begin, end);
		print(D.l);
		return *this;
	}
	template <class T> Printer& range(const T& a) {
		range(a.begin(), a.end());
		return *this;
	}
	template <class... T> void exit(T&&... t) {
		operator()(forward<T>(t)...);
		std::exit(EXIT_SUCCESS);
	}
	Printer& flush() {
		fflush_unlocked(stdout);
		return *this;
	}
	Printer& set(const BoolStr& b) {
		B = b;
		return *this;
	}
	Printer& set(const DivStr& d) {
		D = d;
		return *this;
	}
	Printer& set(const char* t, const char* f) {
		B = BoolStr(t, f);
		return *this;
	}
} out;
#line 3 "/home/yuruhiya/programming/library/template/Step.cpp"
using namespace std;

template <class T> struct Step {
	using value_type = T;

	class iterator {
		value_type a, b, c;

	public:
		constexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}
		constexpr iterator(value_type _b, value_type _c, value_type _s)
		    : a(_b), b(_c), c(_s) {}
		constexpr iterator& operator++() {
			--b;
			a += c;
			return *this;
		}
		constexpr iterator operator++(int) {
			iterator tmp = *this;
			--b;
			a += c;
			return tmp;
		}
		constexpr const value_type& operator*() const {
			return a;
		}
		constexpr const value_type* operator->() const {
			return &a;
		}
		constexpr bool operator==(const iterator& i) const {
			return b == i.b;
		}
		constexpr bool operator!=(const iterator& i) const {
			return !(b == i.b);
		}
		constexpr value_type start() const {
			return a;
		}
		constexpr value_type size() const {
			return b;
		}
		constexpr value_type step() const {
			return c;
		}
	};
	constexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}
	constexpr iterator begin() const {
		return be;
	}
	constexpr iterator end() const {
		return en;
	}
	constexpr value_type start() const {
		return be.start();
	}
	constexpr value_type size() const {
		return be.size();
	}
	constexpr value_type step() const {
		return be.step();
	}
	constexpr value_type sum() const {
		return start() * size() + step() * (size() * (size() - 1) / 2);
	}
	operator vector<value_type>() const {
		return to_a();
	}
	auto to_a() const {
		vector<value_type> result;
		result.reserve(size());
		for (auto i : *this) {
			result.push_back(i);
		}
		return result;
	}

private:
	iterator be, en;
};
template <class T> constexpr auto step(T a) {
	return Step<T>(0, a, 1);
}
template <class T> constexpr auto step(T a, T b) {
	return Step<T>(a, b - a, 1);
}
template <class T> constexpr auto step(T a, T b, T c) {
	return Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);
}
#line 8 "/home/yuruhiya/programming/library/template/Ruby.cpp"
using namespace std;

template <class F> struct Callable {
	F func;
	Callable(const F& f) : func(f) {}
};
template <class T, class F> auto operator|(const T& v, const Callable<F>& c) {
	return c.func(v);
}

struct Sort_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			sort(begin(v), end(v), f);
			return v;
		});
	}
	template <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {
		sort(begin(v), end(v));
		return v;
	}
} Sort;
struct SortBy_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			sort(begin(v), end(v),
			     [&](const auto& i, const auto& j) { return f(i) < f(j); });
			return v;
		});
	}
} SortBy;
struct RSort_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			sort(rbegin(v), rend(v), f);
			return v;
		});
	}
	template <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {
		sort(rbegin(v), rend(v));
		return v;
	}
} RSort;
struct RSortBy_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			sort(begin(v), end(v),
			     [&](const auto& i, const auto& j) { return f(i) > f(j); });
			return v;
		});
	}
} RSortBy;
struct Reverse_impl {
	template <class T> friend auto operator|(T v, const Reverse_impl& c) {
		reverse(begin(v), end(v));
		return v;
	}
} Reverse;
struct Unique_impl {
	template <class T> friend auto operator|(T v, const Unique_impl& c) {
		v.erase(unique(begin(v), end(v), end(v)));
		return v;
	}
} Unique;
struct Uniq_impl {
	template <class T> friend auto operator|(T v, const Uniq_impl& c) {
		sort(begin(v), end(v));
		v.erase(unique(begin(v), end(v)), end(v));
		return v;
	}
} Uniq;
struct Rotate_impl {
	auto operator()(int&& left) {
		return Callable([&](auto v) {
			int s = static_cast<int>(size(v));
			assert(-s <= left && left <= s);
			if (0 <= left) {
				rotate(begin(v), begin(v) + left, end(v));
			} else {
				rotate(begin(v), end(v) + left, end(v));
			}
			return v;
		});
	}
} Rotate;
struct Max_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) { return *max_element(begin(v), end(v), f); });
	}
	template <class T> friend auto operator|(T v, const Max_impl& c) {
		return *max_element(begin(v), end(v));
	}
} Max;
struct Min_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) { return *min_element(begin(v), end(v), f); });
	}
	template <class T> friend auto operator|(T v, const Min_impl& c) {
		return *min_element(begin(v), end(v));
	}
} Min;
struct MaxPos_impl {
	template <class T> friend auto operator|(T v, const MaxPos_impl& c) {
		return max_element(begin(v), end(v)) - begin(v);
	}
} MaxPos;
struct MinPos_impl {
	template <class T> friend auto operator|(T v, const MinPos_impl& c) {
		return min_element(begin(v), end(v)) - begin(v);
	}
} MinPos;
struct MaxBy_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			auto max_it = begin(v);
			auto max_val = f(*max_it);
			for (auto it = next(begin(v)); it != end(v); ++it) {
				if (auto val = f(*it); max_val < val) {
					max_it = it;
					max_val = val;
				}
			}
			return *max_it;
		});
	}
} MaxBy;
struct MinBy_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			auto min_it = begin(v);
			auto min_val = f(*min_it);
			for (auto it = next(begin(v)); it != end(v); ++it) {
				if (auto val = f(*it); min_val > val) {
					min_it = it;
					min_val = val;
				}
			}
			return *min_it;
		});
	}
} MinBy;
struct MaxOf_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			auto max_val = f(*begin(v));
			for (auto it = next(begin(v)); it != end(v); ++it) {
				if (auto val = f(*it); max_val < val) {
					max_val = val;
				}
			}
			return max_val;
		});
	}
} MaxOf;
struct MinOf_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			auto min_val = f(*begin(v));
			for (auto it = next(begin(v)); it != end(v); ++it) {
				if (auto val = f(*it); min_val > val) {
					min_val = val;
				}
			}
			return min_val;
		});
	}
} MinOf;
struct Count_impl {
	template <class V> auto operator()(const V& val) {
		return Callable([&](auto v) { return count(begin(v), end(v), val); });
	}
} Count;
struct CountIf_impl {
	template <class F> auto operator()(const F& f) {
		return Callable([&](auto v) { return count_if(begin(v), end(v), f); });
	}
} CountIf;
struct Index_impl {
	template <class V> auto operator()(const V& val) {
		return Callable([&](auto v) -> optional<int> {
			auto result = find(begin(v), end(v), val);
			return result != end(v) ? optional(result - begin(v)) : nullopt;
		});
	}
} Index;
struct IndexIf_impl {
	template <class F> auto operator()(const F& f) {
		return Callable([&](auto v) -> optional<int> {
			auto result = find_if(begin(v), end(v), f);
			return result != end(v) ? optional(result - begin(v)) : nullopt;
		});
	}
} IndexIf;
struct FindIf_impl {
	template <class F> auto operator()(const F& f) {
		return Callable([&](auto v) -> optional<typename decltype(v)::value_type> {
			auto result = find_if(begin(v), end(v), f);
			return result != end(v) ? optional(*result) : nullopt;
		});
	}
} FindIf;
struct Sum_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			return accumulate(next(begin(v)), end(v), f(*begin(v)),
			                  [&](const auto& a, const auto& b) { return a + f(b); });
		});
	}
	template <class T> friend auto operator|(T v, const Sum_impl& c) {
		return accumulate(begin(v), end(v), typename T::value_type{});
	}
} Sum;
struct Includes {
	template <class V> auto operator()(const V& val) {
		return Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });
	}
} Includes;
struct IncludesIf_impl {
	template <class F> auto operator()(const F& f) {
		return Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });
	}
} IncludesIf;
struct RemoveIf_impl {
	template <class F> auto operator()(const F& f) {
		return Callable([&](auto v) {
			v.erase(remove_if(begin(v), end(v), f), end(v));
			return v;
		});
	}
} RemoveIf;
struct Each_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			for (const auto& i : v) {
				f(i);
			}
		});
	}
} Each;
struct Select_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			using value_type = typename decltype(v)::value_type;
			vector<value_type> result;
			for (const auto& i : v) {
				if (f(i)) result.push_back(i);
			}
			return result;
		});
	}
} Select;
struct Map_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			using result_type = invoke_result_t<F, typename decltype(v)::value_type>;
			vector<result_type> result;
			result.reserve(size(v));
			for (const auto& i : v) {
				result.push_back(f(i));
			}
			return result;
		});
	}
} Map;
struct Indexed_impl {
	template <class T> friend auto operator|(const T& v, Indexed_impl& c) {
		using value_type = typename T::value_type;
		vector<pair<value_type, int>> result;
		result.reserve(size(v));
		int index = 0;
		for (const auto& i : v) {
			result.emplace_back(i, index++);
		}
		return result;
	}
} Indexed;
struct AllOf_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			for (const auto& i : v) {
				if (!f(i)) return false;
			}
			return true;
		});
	}
} AllOf;
struct AnyOf_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			for (const auto& i : v) {
				if (f(i)) return true;
			}
			return false;
		});
	}
} AnyOf;
struct NoneOf_impl {
	template <class F> auto operator()(F&& f) {
		return Callable([&](auto v) {
			for (const auto& i : v) {
				if (f(i)) return false;
			}
			return true;
		});
	}
} NoneOf;

struct Tally_impl {
	template <class F> auto operator()(size_t max_val) {
		return Callable([&](auto v) {
			vector<size_t> result(max_val);
			for (const auto& i : v) {
				result[static_cast<size_t>(i)]++;
			}
			return result;
		});
	}
	template <class T, class value_type = typename T::value_type>
	friend auto operator|(const T& v, Tally_impl& c) {
		map<value_type, size_t> result;
		for (const auto& i : v) {
			result[i]++;
		}
		return result;
	}
} Tally;

template <class T> auto operator*(const vector<T>& a, size_t n) {
	T result;
	for (size_t i = 0; i < n; ++i) {
		result.insert(result.end(), a.begin(), a.end());
	}
	return result;
}
auto operator*(string a, size_t n) {
	string result;
	for (size_t i = 0; i < n; ++i) {
		result += a;
	}
	return result;
}
template <class T, class U> auto& operator<<(vector<T>& a, const U& b) {
	a.insert(a.end(), all(b));
	return a;
}
template <class T> auto& operator<<(string& a, const T& b) {
	a.insert(a.end(), all(b));
	return a;
}
template <class T, class U> auto operator+(vector<T> a, const U& b) {
	a << b;
	return a;
}
template <class T> auto operator+(string a, const T& b) {
	a << b;
	return a;
}
#line 7 "/home/yuruhiya/programming/library/template/functions.cpp"
using namespace std;

template <class T = long long> constexpr T TEN(size_t n) {
	T result = 1;
	for (size_t i = 0; i < n; ++i) result *= 10;
	return result;
}
template <class T, class U,
          enable_if_t<is_integral_v<T> && is_integral_v<U>, nullptr_t> = nullptr>
constexpr auto div_ceil(T n, U m) {
	return (n + m - 1) / m;
}
template <class T, class U> constexpr auto div_ceil2(T n, U m) {
	return div_ceil(n, m) * m;
}
template <class T> constexpr T triangle(T n) {
	return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T> constexpr T nC2(T n) {
	return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);
}
template <class T, class U> constexpr auto middle(const T& l, const U& r) {
	return l + (r - l) / 2;
}
template <class T, class U, class V>
constexpr bool in_range(const T& v, const U& lower, const V& upper) {
	return lower <= v && v < upper;
}
template <class T, enable_if_t<is_integral_v<T>, nullptr_t> = nullptr>
constexpr bool is_square(T n) {
	T s = sqrt(n);
	return s * s == n || (s + 1) * (s + 1) == n;
}
template <class T = long long> constexpr T BIT(int b) {
	return T(1) << b;
}
template <class T> constexpr int BIT(T x, int i) {
	return (x & (1 << i)) ? 1 : 0;
}
template <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>
constexpr T Pow(T a, U n) {
	assert(n >= 0);
	T result = 1;
	while (n > 0) {
		if (n & 1) {
			result *= a;
			n--;
		} else {
			a *= a;
			n >>= 1;
		}
	}
	return result;
}
template <class T, class U, enable_if_t<is_integral_v<U>, nullptr_t> = nullptr>
constexpr T Powmod(T a, U n, T mod) {
	assert(n >= 0);
	if (a > mod) a %= mod;
	T result = 1;
	while (n > 0) {
		if (n & 1) {
			result = result * a % mod;
			n--;
		} else {
			a = a * a % mod;
			n >>= 1;
		}
	}
	return result;
}
template <class T> bool chmax(T& a, const T& b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}
template <class T> bool chmin(T& a, const T& b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T> int sz(const T& v) {
	return v.size();
}
template <class T, class U> int lower_index(const T& a, const U& v) {
	return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> int upper_index(const T& a, const U& v) {
	return upper_bound(all(a), v) - a.begin();
}
template <class T> auto Slice(const T& v, size_t i, size_t len) {
	return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T();
}
template <class T, class U = typename T::value_type> U Gcdv(const T& v) {
	return accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd<U, U>);
}
template <class T, class U = typename T::value_type> U Lcmv(const T& v) {
	return accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm<U, U>);
}
namespace internal {
	template <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {
		if constexpr (N == 1) {
			return vector(sizes[0], init);
		} else {
			int size = sizes[N - 1];
			sizes.pop_back();
			return vector(size, make_vector<T, N - 1>(sizes, init));
		}
	}
}  // namespace internal
template <class T, size_t N>
auto make_vector(const int (&sizes)[N], const T& init = T()) {
	vector s(rbegin(sizes), rend(sizes));
	return internal::make_vector<T, N>(s, init);
}
#line 9 "/home/yuruhiya/programming/library/template/template.cpp"
#if __has_include(<library/dump.hpp>)
#include <library/dump.hpp>
#define LOCAL
#else
#define dump(...) ((void)0)
#endif

template <class T> constexpr T oj_local(const T& oj, const T& local) {
#ifndef LOCAL
	return oj;
#else
	return local;
#endif
}
#line 4 "/home/yuruhiya/programming/library/Graph/ConnectedComponent.cpp"
using namespace std;

tuple<int, vector<int>, vector<vector<int>>> ConnectedComponent(
    const vector<vector<int>>& graph) {
	int n = graph.size(), count_components = 0;
	vector<int> id(n, -1);
	vector<vector<int>> groups(n);
	auto dfs = [&](auto&& f, int ID, int v) -> void {
		id[v] = ID;
		groups[ID].push_back(v);
		for (int u : graph[v]) {
			if (id[u] == -1) f(f, ID, u);
		}
	};
	for (int i = 0; i < n; ++i) {
		if (id[i] == -1) dfs(dfs, count_components++, i);
	}
	groups.resize(count_components);
	return {count_components, id, groups};
}
#line 4 "/home/yuruhiya/programming/library/Utility/RLE.cpp"
using namespace std;

template <class T, class U = typename T::value_type> auto RLE(const T& a) {
	size_t n = a.size();
	vector<size_t> count;
	vector<U> value;
	for (size_t i = 0; i < n;) {
		size_t cnt = 0;
		auto val = a[i];
		for (; i < n && a[i] == val; ++i) ++cnt;
		count.push_back(cnt);
		value.push_back(val);
	}
	return make_pair(count, value);
}
#line 4 "a.cpp"

int main() {
	ini(n, r);
	VI p = in[n];
	VVI g(n);
	rep(i, n) {
		g[i].push_back(p[i] - 1);
		g[p[i] - 1].push_back(i);
	}
	auto [k, id, group] = ConnectedComponent(g);
	VI a = group | Map([&](auto a) -> int { return a.size(); });
	auto [cnt, val] = RLE(a | Sort);

	VI dp(n + 1, -1);
	dp[0] = 0;
	rep(i, sz(cnt)) {
		rep(j, n + 1) {
			if (dp[j] != -1) {
				dp[j] = cnt[i];
			} else if (j < val[i] || dp[j - val[i]] <= 0) {
				dp[j] = -1;
			} else {
				chmax(dp[j], dp[j - val[i]] - 1);
			}
		}
	}
	out(dp[r] != -1);
}
accuracy: 1
time_ms: 270
memory_kb: 55704
final_rank: 14

code_snippet: #include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

//repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const double EPS = 1e-3, PI = acos(-1);
//ここから編集

struct UnionFind{
  vector<int> par;
  vector<int> siz;

  UnionFind(int sz_): par(sz_), siz(sz_) {
    for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;
  }

  void init(int sz_){
    par.resize(sz_);
    siz.resize(sz_);
    for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;
  }

  int root(int x){
    if(x == par[x]) return x;
    return par[x] = root(par[x]);
  }

  bool merge(int x, int y){
    x = root(x), y = root(y);
    if(x == y) return false;
    if(siz[x] < siz[y]) swap(x, y);
    siz[x] += siz[y];
    par[y] = x;
    return true;
  }

  bool issame(int x, int y){
    return root(x) == root(y);
  }

  int size(int x){
    return siz[root(x)];
  }
};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(6);
    
    int N, R; cin >> N >> R;
    vector<int> P(N);
    UnionFind uf(N+10);
    REP(i,N) {
        cin >> P[i];
        uf.merge(P[i]-1, i);
    }

    set<int> st;
    REP(i,N) st.insert(uf.root(i));
    bitset<300010> dp;
    dp[0] = 1;
    int cnt = 0;
    vector<int> v;
    for(auto e: st){
        if(uf.size(e) == 1) cnt++;
        else dp = dp | (dp << uf.size(e));
    } 
    bool f = false;
    for(int i=0; i<=cnt; i++){
        if(R-i>=0 && dp[R-i]){
            f = true;
        }
    }
    if(f) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}
accuracy: 1
time_ms: 1730
memory_kb: 20392
final_rank: 18

code_snippet: #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ for(auto it : P) { s << "<" << it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ for(auto it : P) { s << "<" << it.first << "->" << it.second << "> "; } return s << endl; }


int main() {
    int N, R;
    cin >> N >> R;
    vector<int> P(N);
    for (int i = 0; i < N; ++i) cin >> P[i], --P[i];

    vector<bool> seen(N, false);
    map<int,int> ma;
    for (int i = 0; i < N; ++i) {
        if (seen[i]) continue;
        int cnt = 0;
        int j = i;
        do {
            seen[j] = true;
            ++cnt;
            j = P[j];
        } while (j != i);
        ma[cnt]++;
    }
    
    int K = ma.size();
    const int INF = 1<<29;
    vector<int> dp(R+1, INF), ndp(R+1, INF);
    dp[0] = 0;
    for (auto it : ma) {
        ndp.assign(R+1, INF);
        int val = it.first, num = it.second;
        for (int v = 0; v <= R; ++v) {
            if (dp[v] < INF) chmin(ndp[v], 0);
            if (v >= val && ndp[v-val] < num) chmin(ndp[v], ndp[v-val]+1);
        }
        swap(dp, ndp);
    }
    if (dp[R] < INF) cout << "Yes" << endl;
    else cout << "No" << endl;
}
accuracy: 1
time_ms: 300
memory_kb: 6676
final_rank: 6

code_snippet: #include <bits/stdc++.h>
using namespace std;

#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
using tp = tuple<ll, ll, ll>;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
//constexpr long long MOD = (ll)1e9 + 7;
constexpr long long MOD = 998244353LL;
using ld = long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;

template <class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

//グラフ関連
struct Edge {
    ll to, cap, rev;
    Edge(ll _to, ll _cap, ll _rev) {
        to = _to;
        cap = _cap;
        rev = _rev;
    }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

void add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
    G[from].push_back(Edge(to, cap, (ll)G[to].size()));
    if(revFlag)
        G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

class UnionFind {
    vector<int> data;
    int num;

  public:
    UnionFind(int size) : data(size, -1), num(size) {}
    bool unionSet(int x, int y) {
        x = root(x);
        y = root(y);
        if(x != y) {
            if(data[y] < data[x])
                swap(x, y);
            data[x] += data[y];
            data[y] = x;
            num--;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
    int numSet() {
        return num;
    }
};

template <int mod>
struct NumberTheoreticTransform {

    vector<int> rev, rts;
    int base, max_base, root;

    NumberTheoreticTransform() : base(1), rev{0, 1}, rts{0, 1} {
        assert(mod >= 3 && mod % 2 == 1);
        auto tmp = mod - 1;
        max_base = 0;
        while(tmp % 2 == 0)
            tmp >>= 1, max_base++;
        root = 2;
        while(mod_pow(root, (mod - 1) >> 1) == 1)
            ++root;
        assert(mod_pow(root, mod - 1) == 1);
        root = mod_pow(root, (mod - 1) >> max_base);
    }

    inline int mod_pow(int x, int n) {
        int ret = 1;
        while(n > 0) {
            if(n & 1)
                ret = mul(ret, x);
            x = mul(x, x);
            n >>= 1;
        }
        return ret;
    }

    inline int inverse(int x) {
        return mod_pow(x, mod - 2);
    }

    inline unsigned add(unsigned x, unsigned y) {
        x += y;
        if(x >= mod)
            x -= mod;
        return x;
    }

    inline unsigned mul(unsigned a, unsigned b) {
        return 1ull * a * b % (unsigned long long)mod;
    }

    void ensure_base(int nbase) {
        if(nbase <= base)
            return;
        rev.resize(1 << nbase);
        rts.resize(1 << nbase);
        for(int i = 0; i < (1 << nbase); i++) {
            rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
        }
        assert(nbase <= max_base);
        while(base < nbase) {
            int z = mod_pow(root, 1 << (max_base - 1 - base));
            for(int i = 1 << (base - 1); i < (1 << base); i++) {
                rts[i << 1] = rts[i];
                rts[(i << 1) + 1] = mul(rts[i], z);
            }
            ++base;
        }
    }

    void ntt(vector<int> &a) {
        const int n = (int)a.size();
        assert((n & (n - 1)) == 0);
        int zeros = __builtin_ctz(n);
        ensure_base(zeros);
        int shift = base - zeros;
        for(int i = 0; i < n; i++) {
            if(i < (rev[i] >> shift)) {
                swap(a[i], a[rev[i] >> shift]);
            }
        }
        for(int k = 1; k < n; k <<= 1) {
            for(int i = 0; i < n; i += 2 * k) {
                for(int j = 0; j < k; j++) {
                    int z = mul(a[i + j + k], rts[j + k]);
                    a[i + j + k] = add(a[i + j], mod - z);
                    a[i + j] = add(a[i + j], z);
                }
            }
        }
    }

    vector<int> multiply(vector<int> a, vector<int> b) {
        int need = a.size() + b.size() - 1;
        int nbase = 1;
        while((1 << nbase) < need)
            nbase++;
        ensure_base(nbase);
        int sz = 1 << nbase;
        a.resize(sz, 0);
        b.resize(sz, 0);
        ntt(a);
        ntt(b);
        int inv_sz = inverse(sz);
        for(int i = 0; i < sz; i++) {
            a[i] = mul(a[i], mul(b[i], inv_sz));
        }
        reverse(a.begin() + 1, a.end());
        ntt(a);
        a.resize(need);
        return a;
    }
};

void solve() {
    ll n, r;
    cin >> n >> r;
    vec<ll> p(n);
    UnionFind uni(n);
    REP(i, n) {
        cin >> p[i];
        p[i]--;
        uni.unionSet(p[i], i);
    }

    vec<int> sz;
    REP(i, n) {
        if(uni.root(i) == i)
            sz.push_back(uni.size(i));
    }

    NumberTheoreticTransform<MOD> ntt;

    auto cal = [&](auto &&self, int l, int r) -> vec<int> {
        if(l + 1 == r) {
            vec<int> ret(sz[l] + 1, 0);
            //ここらへんいい感じに書き換える
            ret[sz[l]] = 1;
            ret[0] = 1;
            return ret;
        } else {
            int m = l + r >> 1;
            vec<int> L = self(self, l, m);
            vec<int> R = self(self, m, r);
            return ntt.multiply(L, R);
        }
    };
    vec<int> con = cal(cal, 0, sz.size());

    if(con[r])
        cout << "Yes" << en;
    else
        cout << "No" << en;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    /*
    ll t;
    cin >> t;
    while(t--)*/
    solve();

    return 0;
}
accuracy: 1
time_ms: 640
memory_kb: 21180
final_rank: 11

code_snippet: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}

template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << '{';
  for (const T &item : v) out << item << ", ";
  out << "\b\b}";
  return out;
}
#endif

#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 300010

namespace FastFourierTransform {
  using real=double;

  struct C {
    real x, y;

    C() : x(0), y(0) {}

    C(real x, real y) : x(x), y(y) {}

    inline C operator+(const C &c) const { return C(x + c.x, y + c.y); }

    inline C operator-(const C &c) const { return C(x - c.x, y - c.y); }

    inline C operator*(const C &c) const { return C(x * c.x - y * c.y, x * c.y + y * c.x); }

    inline C conj() const { return C(x, -y); }
  };

  const real PI = acosl(-1);
  int base = 1;
  vector< C > rts = {{0, 0},
                     {1, 0}};
  vector< int > rev = {0, 1};


  void ensure_base(int nbase) {
    if(nbase <= base) return;
    rev.resize(1 << nbase);
    rts.resize(1 << nbase);
    for(int i = 0; i < (1 << nbase); i++) {
      rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
    }
    while(base < nbase) {
      real angle = PI * 2.0 / (1 << (base + 1));
      for(int i = 1 << (base - 1); i < (1 << base); i++) {
        rts[i << 1] = rts[i];
        real angle_i = angle * (2 * i + 1 - (1 << base));
        rts[(i << 1) + 1] = C(cos(angle_i), sin(angle_i));
      }
      ++base;
    }
  }

  void fft(vector< C > &a, int n) {
    assert((n & (n - 1)) == 0);
    int zeros = __builtin_ctz(n);
    ensure_base(zeros);
    int shift = base - zeros;
    for(int i = 0; i < n; i++) {
      if(i < (rev[i] >> shift)) {
        swap(a[i], a[rev[i] >> shift]);
      }
    }
    for(int k = 1; k < n; k <<= 1) {
      for(int i = 0; i < n; i += 2 * k) {
        for(int j = 0; j < k; j++) {
          C z = a[i + j + k] * rts[j + k];
          a[i + j + k] = a[i + j] - z;
          a[i + j] = a[i + j] + z;
        }
      }
    }
  }

  vector< int > multiply(const vector< int > &a, const vector< int > &b) {
    int need = (int) a.size() + (int) b.size() - 1;
    int nbase = 1;
    while((1 << nbase) < need) nbase++;
    ensure_base(nbase);
    int sz = 1 << nbase;
    vector< C > fa(sz);
    for(int i = 0; i < sz; i++) {
      int x = (i < (int) a.size() ? a[i] : 0);
      int y = (i < (int) b.size() ? b[i] : 0);
      fa[i] = C(x, y);
    }
    fft(fa, sz);
    C r(0, -0.25 / (sz >> 1)), s(0, 1), t(0.5, 0);
    for(int i = 0; i <= (sz >> 1); i++) {
      int j = (sz - i) & (sz - 1);
      C z = (fa[j] * fa[j] - (fa[i] * fa[i]).conj()) * r;
      fa[j] = (fa[i] * fa[i] - (fa[j] * fa[j]).conj()) * r;
      fa[i] = z;
    }
    for(int i = 0; i < (sz >> 1); i++) {
      C A0 = (fa[i] + fa[i + (sz >> 1)]) * t;
      C A1 = (fa[i] - fa[i + (sz >> 1)]) * t * rts[(sz >> 1) + i];
      fa[i] = A0 + A1 * s;
    }
    fft(fa, sz >> 1);
    vector< int > ret(need);
    for(int i = 0; i < need; i++) {
      ret[i] = llround(i & 1 ? fa[i >> 1].y : fa[i >> 1].x);
    }
    return ret;
  }
};

vector<int> dp[SIZE*4];

int main(){
  int N, R, P[SIZE];
  vector<int> vec;

  scanf("%d%d", &N, &R);

  for (int i=0; i<N; i++) {
    scanf("%d", P+i);
    P[i]--;
  }

  bool used[SIZE] = {};
  for (int i=0; i<N; i++) {
    int counter = 0;
    int now = i;

    while(!used[now]) {
      used[now] = true;
      counter++;
      now = P[now];
    }

    if (counter)
      vec.push_back(counter);
  }

  sort(vec.begin(), vec.end());

  int M = vec.size();

  int n2 = 1;
  for (;n2 < M; n2*=2);

  for (int i=0; i<M; i++) {
    dp[i+n2-1].assign(vec[i]+1, 0);
    dp[i+n2-1][0] = 1;
    dp[i+n2-1][vec[i]] = 1;
  }

  for (int i=n2-2; i>=0; i--) {
    if (dp[i*2+1].empty()) {

    } else if (dp[i*2+2].empty()) {
      swap(dp[i], dp[i*2+1]);
    } else {
      dp[i] = FastFourierTransform::multiply(dp[i*2+1], dp[i*2+2]);

      for (int j=0; j<dp[i].size(); j++)
        dp[i][j] = !!dp[i][j];
    }
  }

  if (dp[0][R]) {
    puts("Yes");
  } else {
    puts("No");
  }

  return 0;
}
accuracy: 1
time_ms: 450
memory_kb: 91864
final_rank: 19

code_snippet: #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


struct UnionFind{
  Int n,num;
  vector<Int> r,p;
  UnionFind(){}
  UnionFind(Int sz):n(sz),num(sz),r(sz,1),p(sz,0){iota(p.begin(),p.end(),0);}
  Int find(Int x){
    return (x==p[x]?x:p[x]=find(p[x]));
  }
  bool same(Int x,Int y){
    return find(x)==find(y);
  }
  void unite(Int x,Int y){
    x=find(x);y=find(y);
    if(x==y) return;
    if(r[x]<r[y]) swap(x,y);
    r[x]+=r[y];
    p[y]=x;
    num--;
  }
  Int size(Int x){
    return r[find(x)];
  }
  Int count() const{
    return num;
  }
};

//INSERT ABOVE HERE
signed main(){
  Int n,r;
  cin>>n>>r;
  vector<Int> ps(n);
  for(Int i=0;i<n;i++) cin>>ps[i],ps[i]--;

  UnionFind uf(n);
  for(Int i=0;i<n;i++) uf.unite(i,ps[i]);

  vector<Int> vs;
  for(Int i=0;i<n;i++)
    if(uf.find(i)==i) vs.emplace_back(uf.size(i));

  const Int BS = 600;
  vector<Int> cnt(BS,0);
  for(Int v:vs)
    if(v<BS) cnt[v]++;

  vector<Int> dp(n+1,0);
  dp[0]=1;
  for(Int w=1;w<BS;w++){
    vector<Int> nx(n+1,-1);
    for(Int i=0;i<=n;i++){
      if(dp[i]) chmax(nx[i],cnt[w]);
      if(nx[i]>0&&i+w<=n) chmax(nx[i+w],nx[i]-1);
    }
    for(Int i=0;i<=n;i++) dp[i]=nx[i]>=0;
  }

  for(Int v:vs){
    if(v<BS) continue;
    for(Int i=n;i>=0;i--)
      if(i+v<=n) dp[i+v]|=dp[i];
  }

  cout<<(dp[r]?"Yes":"No")<<endl;
  return 0;
}
accuracy: 1
time_ms: 390
memory_kb: 16944
final_rank: 8

code_snippet: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;


enum Type{
	UNDEFINED,
	USED,
	EITHER,
};

#define SIZE 300005

int N,R;
int table[SIZE],num[SIZE];
int dp[SIZE];
map<int,bool> MAP;
Type type[SIZE];


int main(){

	scanf("%d %d",&N,&R);

	int num_either;

	for(int i = 1; i <= N; i++){

		scanf("%d",&table[i]);
		if(i == table[i]){

			type[i] = EITHER; //どちらのグループでも良い
			num_either++;
		}else{

			type[i] = UNDEFINED;
		}
	}

	int sum = 0;

	for(int i = 0; i < SIZE; i++){

		num[i] = 0;
	}

	vector<int> V;

	//場所 != 数字となっている数字の、本来の位置を指したループを作る(グループ1)
	for(int i = 1; i <= N; i++){

		if(type[i] == UNDEFINED){

			int count = 0;

			type[i] = USED;
			count++;

			int loc = i;

			while(type[table[loc]] == UNDEFINED){

				type[table[loc]] = USED;
				count++;
				loc = table[loc];
			}

			sum += count;
			num[count] += 1;

			auto at = MAP.find(count); //初登場の数字
			if(at == MAP.end()){

				MAP[count] = true;
				V.push_back(count);
			}
		}
	}

	dp[0] = 0;
	for(int i = 1; i <= N; i++){

		dp[i] = -1;
	}
	for(int i = 0; i < V.size(); i++){ //数の種類のループ
		for(int k = 0; k <= N; k++){ //作りたい数のループ

			if(dp[k] >= 0){

				dp[k] = num[V[i]]; //V[i]の個数

			}else if(k < V[i] || dp[k-V[i]] <= 0){

				dp[k] = -1;

			}else{

				dp[k] = dp[k-V[i]]-1; //V[i]を1つ使用
			}
		}
	}

	for(int i = 0; i <= max(R,N-R); i++){
		if(dp[i] < 0)continue; //数字iを作れないならSKIP

		if(min(i,sum-i) <= min(R,N-R) && max(i,sum-i) <= max(R,N-R)){
			//差分は、eitherを適当に割り振って調整
			printf("Yes\n");
			return 0;
		}
	}

	printf("No\n");

	return 0;
}
accuracy: 1
time_ms: 200
memory_kb: 7908
final_rank: 4

code_snippet: #include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;

template <typename T>
void printv(const vector<T> &v)
{
    int sz = v.size();
    for (int i = 0; i < sz; i++)
    {
        cout << v[i] << " \n"[i == sz - 1];
    }
}

class UnionFind
{
    std::vector<int> data;

public:
    UnionFind(int size) : data(size, -1) {}
    bool unite(int x, int y)
    {
        x = root(x);
        y = root(y);
        if (x != y)
        {
            if (data[y] < data[x])
                std::swap(x, y);
            data[x] += data[y];
            data[y] = x;
        }
        return x != y;
    }
    bool find(int x, int y)
    {
        return root(x) == root(y);
    }
    int root(int x)
    {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x)
    {
        return -data[root(x)];
    }
};

constexpr int MAX_N = 300010;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, r;
    cin >> n >> r;
    vector<int> p(n), used(n, 0);
    for (int i = 0; i < n; i++)
    {
        cin >> p[i];
        p[i]--;
        if (i == p[i])
            used[i] = 1;
    }
    vector<int> sz;
    int sum = 0;
    UnionFind uf(n);
    for (int i = 0; i < n; i++)
    {
        if (used[i])
            continue;
        int pos = i;
        used[pos] = 1;
        while (used[p[pos]] == 0)
        {
            uf.unite(pos, p[pos]);
            pos = p[pos];
            used[pos] = 1;
        }
        sum += uf.size(i);
        sz.push_back(uf.size(i));
    }
    bitset<MAX_N> bs;
    bs[0] = 1;
    for (auto v : sz)
    {
        bs |= (bs << v);
    }
    for (int i = 0; i <= n; i++)
    {
        if (bs[i] == 0)
            continue;
        int j = sum - i;
        if(i<=r && j<=n-r)
        {
            cout << "Yes" << endl;
            return 0;
        }
        if(i<=n-r && j<=r)
        {
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}
accuracy: 1
time_ms: 1470
memory_kb: 7304
final_rank: 16

code_snippet: #include <iostream>
#include <vector>
using namespace std;

class UnionFind{
private:
    vector<int> p,s;
	int cnt;
public:
	UnionFind(){}
	UnionFind(int N){
		cnt = N;
		p = s = vector<int>(N+1,0);
		for(int i=1;i<=N;i++){
			p[i] = i; s[i] = 1;
		}
	}
	int find(int x){
		if(p[x]==x) return x;
		else return p[x] = find(p[x]);
	}
	void unite(int x,int y){
		x = find(x); y = find(y);
		if(x==y) return;
		if(s[x]>s[y]){
			p[y] = x;
			s[x] += s[y];
		}else{
			p[x] = y;
			s[y] += s[x];
		}
		cnt--;
	}
	bool is_same_set(int x,int y) {return find(x)==find(y);}
	int size(int x) {return s[find(x)];}
	int compnents_number(){return cnt;}
};

int N,R,p;
int cnt[500010] = {};
int checked[500010] = {};
int a[1010] = {},m[1010] = {};
int dp[500010];
int main(){
    cin >> N >> R;
    UnionFind uf(N);
    for(int i=1;i<=N;i++){
        cin >> p;
        uf.unite(i,p);
    }
    int ma = 0;
    for(int i=1;i<=N;i++) if(!checked[uf.find(i)]){
        ma = max(ma,uf.size(i));
        cnt[uf.size(i)]++;
        checked[uf.find(i)] = 1;
    }
    int num = 0;
    for(int i=1;i<=ma;i++){
        if(cnt[i]==0) continue;
        num++;
        a[num] = i; m[num] = cnt[i];
    }
    for(int i=1;i<=R;i++) dp[i] = -1;
    for(int i=1;i<=num;i++){
        for(int j=0;j<=R;j++){
            if(dp[j]>=0) dp[j] = m[i];
            else if(j<a[i] || dp[j-a[i]]<=0) dp[j] = -1;
            else dp[j] = dp[j-a[i]]-1;
        }
    }
    cout << (dp[R]>=0? "Yes":"No") << endl;
}
accuracy: 1
time_ms: 240
memory_kb: 7364
final_rank: 5

code_snippet: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using P = pair<int, int>;

template <class T> inline T chmax(T &a, T &b) {a = max(a, b);}
template <class T> inline T chmin(T &a, T &b) {a = min(a, b);}

constexpr int MOD = 1e9 + 7;
constexpr ll INF = 1e18;
constexpr double pi = acos(-1);
constexpr double EPS = 1e-10;

int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, r; cin>>n>>r;
    vector<int> id2p(n);
    for(int i=0; i<n; i++){
        int p; cin>>p;
        id2p[i] = --p;
    }

    vector<bool> visited(n, false);
    vector<int> groupNum;
    for(int i=0; i<n; i++){
        int cur = i;
        int cnt = 0;
        while(!visited[cur]){
            visited[cur] = true;
            cur = id2p[cur];
            cnt++;
        }

        if(cnt) groupNum.emplace_back(cnt);
    }

    r = min(r, n - r);
    bitset<150001> dp;
    dp[0] = 1;
    for(auto i : groupNum){
        dp |= (dp << i);
    }

    cout << (dp[r] ? "Yes" : "No") << endl;
}
accuracy: 1
time_ms: 1180
memory_kb: 6024
final_rank: 13

code_snippet: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using P = pair<int, int>;

template <class T> inline T chmax(T &a, T &b) {a = max(a, b);}
template <class T> inline T chmin(T &a, T &b) {a = min(a, b);}

constexpr int MOD = 1e9 + 7;
constexpr ll INF = 1e18;
constexpr double pi = acos(-1);
constexpr double EPS = 1e-10;

int dx[] = {1, 0, -1, 0};
int dy[] = {0, -1, 0, 1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, r; cin>>n>>r;
    vector<int> id2p(n);
    for(int i=0; i<n; i++){
        int p; cin>>p;
        id2p[i] = --p;
    }

    vector<bool> visited(n, false);
    map<int, int> groupNum;
    for(int i=0; i<n; i++){
        int cur = i;
        int cnt = 0;
        while(!visited[cur]){
            visited[cur] = true;
            cur = id2p[cur];
            cnt++;
        }

        if(cnt) groupNum[cnt]++;
    }

    vector<int> a, m;
    for(auto &i : groupNum){
        a.emplace_back(i.first);
        m.emplace_back(i.second);
    }

    int sz = a.size();
    r = min(r, n - r);
    
    vector<int> dp(r + 1, -1);
    dp[0] = 0;
    for(int i=0; i<sz; i++){
        for(int j=0; j<=r; j++){
            if(0 <= dp[j]){
                dp[j] = m[i];
            }
            else if(j - a[i] < 0 || dp[j-a[i]] <= 0){
                dp[j] = -1;
            }
            else{
                dp[j] = dp[j-a[i]] - 1;
            }
        }
    }

    if(0 <= dp[r]){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}
accuracy: 1
time_ms: 90
memory_kb: 4724
final_rank: 2

code_snippet: #include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

int n, r;

struct U {
  int a[333333];
  U() {
    memset(a, -1, sizeof(a));
  }
  int root(int p) {
    return a[p] < 0 ? p : (a[p] = root(a[p]));
  }
  bool same(int p, int q) {
    return root(p) == root(q);
  }
  bool merge(int p, int q) {
    if (same(p, q)) return false;
    p = root(p);
    q = root(q);
    a[p] += a[q];
    a[q] = p;
    return true;
  }
  int sz(int p) {
    return -a[root(p)];
  }
};

U uni;
int cnt[333333];
bool used[333333];
int m;
int a[333333], b[333333];
int dp[333333];

int main(void) {
  scanf("%d%d", &n, &r);
  for (int i = 0; i < n; i++) {
    int x; scanf("%d", &x); --x;
    uni.merge(i, x);
  }

  for (int i = 0; i < n; i++) {
    int r = uni.root(i);
    if (!used[r]) {
      cnt[uni.sz(i)] += 1;
      used[r] = true;
    }
  }

  for (int i = 0; i < n; i++) {
    if (cnt[i]) {
      a[m] = i;
      b[m] = cnt[i];
      // printf("%d: %d %d\n", m, i, cnt[i]);
      ++m;
    }
  }

  memset(dp, -1, sizeof(dp));
  dp[0] = 0;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j <= r; j++) {
      if (dp[j] >= 0) dp[j] = b[i];
      else if (j < a[i] || dp[j - a[i]] <= 0) dp[j] = -1;
      else dp[j] = dp[j - a[i]] - 1;
    }
  }

  puts(dp[r] >= 0 ? "Yes" : "No");

  return 0;
}
accuracy: 1
time_ms: 190
memory_kb: 5536
final_rank: 3