2019暑期个人排位集训补题--思维题

CodeForces - 768B Code For 1

Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become a maester, so he can return and take the deceased Aemon’s place as maester of Castle Black. Jon agrees to Sam’s proposal and Sam sets off his journey to the Citadel. However becoming a trainee at the Citadel is not a cakewalk and hence the maesters at the Citadel gave Sam a problem to test his eligibility.

Initially Sam has a list with a single element n. Then he has to perform certain operations on this list. In each operation Sam must remove any element x, such that x > 1, from the list and insert at the same position , , sequentially. He must continue with these operations until all the elements in the list are either 0 or 1.

Now the masters want the total number of 1s in the range l to r (1-indexed). Sam wants to become a maester but unfortunately he cannot solve this problem. Can you help Sam to pass the eligibility test?

Input
The first line contains three integers n, l, r (0 ≤ n < 250, 0 ≤ r - l ≤ 105, r ≥ 1, l ≥ 1) – initial element and the range l to r.

It is guaranteed that r is not greater than the length of the final list.

Output
Output the total number of 1s in the range l to r in the final sequence.

Examples
input
7 2 5
output
4
input
10 3 10
output
5
Note
Consider first example:
Elements on positions from 2-nd to 5-th in list is [1, 1, 1, 1]. The number of ones is 4.
For the second example:
Elements on positions from 3-rd to 10-th in list is [1, 1, 1, 0, 1, 0, 1, 0]. The number of ones is 5.

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <map>
#define LL long long
using namespace std;
map<LL,int> num;
void Init(LL n){//求2的倍数的位置n应该是什么值
    LL cnt=log2(n);
    cnt=pow(2,cnt+1);
    cnt/=2;
    while(cnt){
        num[cnt]=n&1;
        n>>=1;
        cnt>>=1;
    }
    return ;
}
LL Find_pos(LL x){//求对称位置
    if(x&1){//很容易就能发现奇数位置都是第一个位置对称过去的，而第一个位置肯定是1
        return 1;
    }
    LL p=2;
    while(x%p==0){//仔细想想，是对的，求是在哪个点对称过去的
        if(x==p)
            return x;
        p<<=1;
    }
    p>>=1;
    return p;
}
int main(){
    LL n,l,r;
    cin>>n>>l>>r;
    Init(n);
    LL ans=0;
    for(LL i=l;i<=r;i++){
        ans+=num[Find_pos(i)];
    }
    cout<<ans<<endl;
    return 0;
}
 

Gym - 100066B

本来是用了一个一个下去+1或-1或跟前面一样之类的的方法 但是有数据WA了 最后也没找出来。。。。后来发现 原来可以用这么简单的做法 我哭了T_T 直接排序 再按n–插回去

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

struct node
{
    int l;
    int n;
}a[100005];

bool cmp(node a,node b)
{
    if(a.l==b.l)return a.n<b.n;
    return a.l>b.l;
}
int main()
{
    int ans[100005];
    int n,cur;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i].l);
        a[i].n=i;
    }
    sort(a+1,a+n+1,cmp);
    cur=n;
    for(int i=1;i<=n;i++)
        ans[a[i].n]=cur--;
    for(int i=1;i<=n;i++)printf("%d ",ans[i]);
    return 0;
}