2020.6.30
今天火力对决开始了,晚上回去玩。今天上午还算可以,有点成果,除了一道比较艹的拓展欧几里得,其他效率还行。等一下图书馆闭馆就去恰饭了。匆匆写下这篇解题报告。
这个就是问从l到r有多少互相不含大于p的质因数集合。那么说到独立集肯定想到用并查集按秩合并,说到质因数肯定先把线性筛敲出来。首先想到bfs,从所有数字放进去。然后通过素数表判断,如果是倍数,那么就探索加上这个质因数的数字,合并,如果不是直接跳过就行了。这也算是比较好想的了。算法整体复杂度平方的,因为部分分看上去有80,我本来没想先拿满分,打个暴力再说,结果因为大常数只有30分,把循环换成二分lower_bound也才60,按理说1k数据拿80是没什么问题。最后无奈,算了不用bfs了,直接把循环拿出来单处理,结果意外可行hhh,按理说都是nlogn~nsqrtn的
(已更正)闭馆之前把我的程序优化了一下,结果确实拿满了部分分。
闭馆了,下午再补充,先去吃饭了
80分代码:
#include <bits/stdc++.h>
using namespace std;
#define limit (100000 + 5)//防止溢出
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f
#define lowbit(i) i&(-i)//一步两步
#define EPS 1e-6
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ff(a) printf("%d\n",a );
#define pi(a,b) pair<a,b>
#define rep(i, a, b) for(ll i = a; i <= b ; ++i)
#define per(i, a, b) for(ll i = b ; i >= a ; --i)
#define mint(a,b,c) min(min(a,b), c)
#define MOD 988244353
#define FOPEN freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\data.txt", "rt", stdin)
#define FOUT freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\dabiao.txt", "wt", stdout)
typedef long long ll;
typedef unsigned long long ull;
ll read(){
ll sign = 1, x = 0;char s = getchar();
while(s > '9' || s < '0' ){if(s == '-')sign = -1;s = getchar();}
while(s >= '0' && s <= '9'){x = x * 10 + s - '0';s = getchar();}
return x * sign;
}//快读
void write(ll x){
if(x < 0) putchar('-'),x = -x;
if(x / 10) write(x / 10);
putchar(x % 10 + '0');
}
int n,k;
int fa[limit];
void init(int s){
rep(i,1,s){
fa[i] = i;
}
}
int getroot(int x){
return fa[x] == x ? x : fa[x] = getroot(fa[x]) ;
}//合并
void merge(int x, int y){
if(x > y)swap(x, y);
int root1= getroot(x);
int root2 = getroot(y);
if(root1 != root2){
fa[root2] = root1;
}
}
int prime[limit], num[limit],tot;
void get_prime( const int &N){
memset(num, 1, sizeof(num));
tot = 0;
rep(i ,2,N){
if(num[i])prime[++tot] = i;
for(int j = 1 ; j <= tot && i * prime[j] <= N ; ++j){
num[i * prime[j]] = 0;
if(i % prime[j] == 0)break;//线性筛
}
}
}
int vis[limit];
int main() {
#ifdef LOCAL
FOPEN;
#endif
int a,b,p;
a = read(), b = read(), p = read();
init(b);//初始化并查集
get_prime(b);
int l = lower_bound(prime + 1 , prime + 1 + tot, a) - prime;
int t = lower_bound(prime + 1, prime + 1 + tot, p) - prime;
int r = tot;
int ans = r - l;
queue<int>q;
rep(i ,a, b){
if(!num[i])q.push(i);
}
while (q.size()){
int cur = q.front();
q.pop();//跳出
rep(i ,t, tot){
if(prime[i] + cur > b)break;
if(cur % prime[i] == 0){
//如果确有质因数
if(!vis[cur + prime[i]])q.push(cur + prime[i]),vis[cur + prime[i]] = 1;
merge(cur, cur + prime[i]);//合并
}
}
}
set<int>s;
rep(i ,a,b){
s.insert(fa[i]);
}
ff(s.size())
return 0;
}
在这里插入代码片
AC代码:
#include <bits/stdc++.h>
using namespace std;
#define limit (100000 + 5)//防止溢出
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f
#define lowbit(i) i&(-i)//一步两步
#define EPS 1e-6
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ff(a) printf("%d\n",a );
#define pi(a,b) pair<a,b>
#define rep(i, a, b) for(ll i = a; i <= b ; ++i)
#define per(i, a, b) for(ll i = b ; i >= a ; --i)
#define mint(a,b,c) min(min(a,b), c)
#define MOD 988244353
#define FOPEN freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\data.txt", "rt", stdin)
#define FOUT freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\dabiao.txt", "wt", stdout)
typedef long long ll;
typedef unsigned long long ull;
ll read(){
ll sign = 1, x = 0;char s = getchar();
while(s > '9' || s < '0' ){if(s == '-')sign = -1;s = getchar();}
while(s >= '0' && s <= '9'){x = x * 10 + s - '0';s = getchar();}
return x * sign;
}//快读
void write(ll x){
if(x < 0) putchar('-'),x = -x;
if(x / 10) write(x / 10);
putchar(x % 10 + '0');
}
int n,k;
int fa[limit];
void init(int s){
rep(i,1,s){
fa[i] = i;
}
}
int getroot(int x){
return fa[x] == x ? x : fa[x] = getroot(fa[x]) ;
}//合并
void merge(int x, int y){
if(x > y)swap(x, y);
int root1= getroot(x);
int root2 = getroot(y);
if(root1 != root2){
fa[root2] = root1;
}
}
int prime[limit], num[limit],tot;
void get_prime( const int &N){
memset(num, 1, sizeof(num));
tot = 0;
rep(i ,2,N){
if(num[i])prime[++tot] = i;
for(int j = 1 ; j <= tot && i * prime[j] <= N ; ++j){
num[i * prime[j]] = 0;
if(i % prime[j] == 0)break;//线性筛
}
}
}
int vis[limit];
int main() {
#ifdef LOCAL
FOPEN;
#endif
int a,b,p;
a = read(), b = read(), p = read();
init(b);//初始化并查集
get_prime(b);
int l = lower_bound(prime + 1 , prime + 1 + tot, p) - prime;
rep(i ,l, tot){
for(int div = ceil(1.0 * a / prime[i]);div * prime[i] <= b;++div){
merge(prime[i] , prime[i] * div);
}
}
set<int>s;
rep(i ,a,b){
s.insert(getroot(fa[i]));
}
write(s.size());
return 0;
}