結果
問題 | No.1059 素敵な集合 |
ユーザー |
![]() |
提出日時 | 2020-05-22 21:46:12 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 14 ms / 2,000 ms |
コード長 | 3,700 bytes |
コンパイル時間 | 1,594 ms |
コンパイル使用メモリ | 171,884 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 09:27:22 |
合計ジャッジ時間 | 2,326 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
#include <bits/stdc++.h>using namespace std;/*#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace __gnu_pbds;template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)#define REP(i, n) FOR(i,0,n)#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)#define IREP(i, n) IFOR(i,0,n)#define Sort(v) sort(v.begin(), v.end())#define Reverse(v) reverse(v.begin(), v.end())#define all(v) v.begin(),v.end()#define SZ(v) ((int)v.size())#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))#define Max(a, b) a = max(a, b)#define Min(a, b) a = min(a, b)#define bit(n) (1LL<<(n))#define bit_exist(x, n) ((x >> n) & 1)#define debug(x) cout << #x << "=" << x << endl;#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout <<endl;} }#define Return(ans) { cout << (ans) << endl; return 0; }#define pb push_back#define f first#define s second#define int long long#define INF 1000000000000000000template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout <<endl; }; return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }template<typename T> void Out(T x) { cout << x << endl; }template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }using vec = vector<int>;using mat = vector<vec>;using Pii = pair<int, int>;using PiP = pair<int, Pii>;using PPi = pair<Pii, int>;using Pdi = pair<double, int>;using bools = vector<bool>;using pairs = vector<Pii>;//int dx[4] = {1,0,-1,0};//int dy[4] = {0,1,0,-1};//char d[4] = {'D','R','U','L'};const int mod = 1000000007;//const int mod = 998244353;//#define Add(x, y) x = (x + (y)) % mod//#define Mult(x, y) x = (x * (y)) % modstruct UnionFind{vector<int> par, sz;int n_cc;UnionFind(int N){par = vector<int>(N);REP(i, N) par[i] = i;sz = vector<int>(N, 1);n_cc = N;}int find(int x){if(par[x] == x) return x;else return par[x] = find(par[x]);}void unite(int x, int y){x = find(x);y = find(y);if(x == y) return;if(sz[x] < sz[y]) swap(x, y);par[y] = x;sz[x] += sz[y];n_cc--;}bool is_union(int x, int y){x = find(x);y = find(y);return x == y;}int union_size(int x){return sz[find(x)];}};signed main(){int L, R; cin >> L >> R;UnionFind UF(R + 1);FOR(i, L, R + 1){for(int j = 2 * i; j <= R; j += i){UF.unite(i, j);}}int ans = UF.n_cc - L - 1;Out(ans);return 0;}