codeforces 474F F. Ant colony(线段树+数论)

题目链接:

codeforces 474F


题目大意:

给出一些数,每次给出一个区间,所有的数两两比较,如果a能整除b得一分,b能整除a得一分,问没有得满分的有多少个。


题目分析:

  • 我们可以知道,每个区间的数最多只有一种数字满足条件,也就是所有数的gcd,那么我们利用线段树,维护某一个区间的gcd,和这个gcd出现的次数即可,无修改的线段树水题

AC代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define MAX 100007

using namespace std;

typedef pair<int,int> PII;
int n,m;
int a[MAX];

struct Tree
{
    int l,r,gcd,num;
}tree[MAX<<2];

int gcd ( int a , int b )
{
    return !b?a:gcd(b,a%b);
}

void push_up ( int u )
{
    int a = tree[u<<1].gcd;
    int b = tree[u<<1|1].gcd;
    int x = tree[u<<1].num;
    int y = tree[u<<1|1].num;
    int d = gcd ( a , b );
    tree[u].gcd = d;
    tree[u].num = 0;
    if ( d == a ) 
        tree[u].num += x;
    if ( d == b )
        tree[u].num += y;
}

void build ( int u , int l , int r )
{
    tree[u].l = l;
    tree[u].r = r;
    if ( l == r )
    {
        tree[u].gcd = a[l];
        tree[u].num = 1;
        return;
    }
    int mid = l+r>>1;
    build ( u<<1 , l , mid );
    build ( u<<1|1 , mid+1 , r );
    push_up ( u );
}

PII query ( int u , int left , int right )
{
    int l = tree[u].l;
    int r = tree[u].r;
    if ( left <= l && r <= right )
        return make_pair ( tree[u].gcd , tree[u].num );
    PII ret,temp;
    ret.first = -1;
    int mid = l+r>>1;
    if ( left <= mid && right >= l ) 
        ret = query ( u<<1 , left , right );
    if ( left <= r && right > mid )
    {
        temp = query ( u<<1|1 ,left , right );
        if ( ret.first == -1 ) ret = temp;
        else
        {
            int d = gcd ( ret.first , temp.first );
            if ( d != ret.first ) ret.second = 0;
            if ( d == temp.first ) ret.second += temp.second;
            ret.first = d;
        }
    }
    return ret;
}

int main ( )
{
    while ( ~scanf ( "%d" , &n  ) )
    {
        for ( int i = 1 ; i <= n ; i++ )
            scanf ( "%d" , &a[i] );
        build ( 1 , 1 , n );
        scanf ( "%d" , &m );
        while ( m-- )
        {
            int l,r;
            scanf ( "%d%d" , &l , &r );
            printf ( "%d\n" , r-l+1-query ( 1, l , r ).second );
        }
    }
}
根据提供的引用内容,Codeforces Round 511 (Div. 1)是一个比赛的名称。然而,引用内容中没有提供与这个比赛相关的具体信息或问题。因此,我无法回答关于Codeforces Round 511 (Div. 1)的问题。如果您有关于这个比赛的具体问题,请提供更多的信息,我将尽力回答。 #### 引用[.reference_title] - *1* [Codeforces Round 860 (Div. 2)题解](https://blog.csdn.net/qq_60653991/article/details/129802687)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control,239^v3^insert_chatgpt"}} ] [.reference_item] - *2* [Codeforces Round 867 (Div. 3)(A题到E题)](https://blog.csdn.net/wdgkd/article/details/130370975)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control,239^v3^insert_chatgpt"}} ] [.reference_item] - *3* [Codeforces Round 872 (Div. 2)(前三道](https://blog.csdn.net/qq_68286180/article/details/130570952)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值