結果

問題 No.1059 素敵な集合
ユーザー ningenMeningenMe
提出日時 2020-05-23 02:45:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 155 ms / 2,000 ms
コード長 3,507 bytes
コンパイル時間 2,278 ms
コンパイル使用メモリ 208,720 KB
実行使用メモリ 13,936 KB
最終ジャッジ日時 2023-09-30 15:36:04
合計ジャッジ時間 4,183 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,696 KB
testcase_01 AC 88 ms
13,936 KB
testcase_02 AC 24 ms
7,136 KB
testcase_03 AC 3 ms
4,760 KB
testcase_04 AC 3 ms
4,804 KB
testcase_05 AC 3 ms
4,580 KB
testcase_06 AC 19 ms
6,436 KB
testcase_07 AC 19 ms
6,452 KB
testcase_08 AC 27 ms
7,580 KB
testcase_09 AC 6 ms
5,288 KB
testcase_10 AC 42 ms
8,124 KB
testcase_11 AC 22 ms
6,648 KB
testcase_12 AC 10 ms
5,656 KB
testcase_13 AC 53 ms
8,820 KB
testcase_14 AC 3 ms
4,824 KB
testcase_15 AC 113 ms
11,760 KB
testcase_16 AC 24 ms
7,060 KB
testcase_17 AC 21 ms
6,980 KB
testcase_18 AC 4 ms
4,504 KB
testcase_19 AC 153 ms
13,612 KB
testcase_20 AC 155 ms
13,404 KB
testcase_21 AC 110 ms
11,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/*
 * @title UnionFindTree
 */
class UnionFindTree {
public:
	vector<int> parent;
	vector<int> rank;

	UnionFindTree(int N) : parent(N), rank(N,0){
		iota(parent.begin(),parent.end(),0);
	} 
	int root(int n) {
		return (parent[n] == n ? n : parent[n] = root(parent[n]));
	}
	inline int same(int n, int m) {
		return root(n) == root(m);
	}
	inline void unite(int n, int m) {
		n = root(n);
		m = root(m);
		if (n == m) return;
		if (rank[n]<rank[m]) {
			parent[n] = m;
		}
		else{
			parent[m] = n;
			if(rank[n] == rank[m]) rank[n]++;
		}
	}
};

int main() {
    int L,R; cin >> L >> R;
    UnionFindTree uf(200001);
    set<int> st;
    for(int i = L; i <= R; ++i) {
        if(st.count(i)) continue;
        for(int j = i; j+i <= R; j += i) {
            st.insert(j);
            uf.unite(j,j+i);
        }
    }
    int sum = 0;
    for(int i = L; i+1 <= R; ++i) {
        if(!uf.same(i,i+1)){
            sum++;
            uf.unite(i,i+1);
        }
    }
    cout << sum << endl;

    return 0;
}
0