济南赛补题

M题

• 题目

In China, there is a very famous problem about pancakes: You have a pan and you can fry two pancakes at the same time each time. For a pancake, its front and back sides need to be cooked, and it takes one hour for each side to be cooked.

So how long does it take at least to cook 3 pancakes? The answer is three hours:

In the first hour, fry the front of No.1 pancake and the front of No.2 pancake.

In the second hour, fry the back of No.2 pancake and the front of No.3 pancake.
In the third hour, fry the back of No.1 pancake and the back of No.3 pancake.
Now you have a pan and you can fry KK pancakes at the same time each time. How many hours does it takes at least to cook NN pancakes?
It’s noticed that you have to fry some side of the pancake until fully cooked every time, it means that you can’t fry some side of the pancake half-cooked and taking it out. So the answers are always integers.

• 题意

一口锅可以同时煎制k个饼，每张饼两面都需要煎制，每一面需要煎1小时，问最快把n张饼全部煎好需要多少小时

• 思路

共有n张饼就意味着如果一张一张煎制的话总时间是2n 但是现在可以同时煎制
如果2 ∗ n % k = 0 2n%k=02∗n%k=0 就可以每次都放上去k张，这样答案就是2 ∗ n / k 2n/k2∗n/k
如果2 ∗ n % k ! = 0 2n%k!=02∗n%k!=0 就可以像题目那样交叉着煎制，到最后把小于k的剩余饼全都放上去煎制好就成了，答案是2 ∗ n / k + 1 2*n/k+12∗n/k+1

• 代码

#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    int n,k;
    cin>>n>>k;
    int now = 2 * n / k + (2 * n % k == 0?0:1);
    if(now < 2) now = 2;
    cout<<now;
}
 
/*
 
4 2 4
4 3 3
4 4 2
4 5 2
4 6 2
4 8 1
 
*/

G题

• 题目

题目描述
MianKing has one integer XX, he wants to perform some operations to transform XX to YY (Y<X)(Y<X).
In each operation, MianKing can choose one integer 0\leq A<X0≤A<X and let X=X_xorAX=X xor A.
it’s noticed that after an operation, the upper bound of AA will change because XX has changed.
Now you need to help MianKing to find a way to transform XX to YY by doing at most 55 operations.

输入描述:
The first line has two integers X,YX,Y.

$1<=Y<X<=10^{18}$
$1\le Y<X\le 10^{18}$
.

输出描述:
The first line has one integer d denotes the number of operations you did.
Then there are d integers $A_{1...d}$
$0\le d\le 5$.

• 思路

  如果 $XxorY<X$ 那就直接异或 X^Y 否则先异或上Y,再异或上X。

• 代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll X,Y;cin>>X>>Y;
    if((X^Y)<X)
    {
        printf("1\n");
        printf("%lld\n",X^Y);
    }
    else
    {
        printf("2\n");
        
        cout<<Y<<" "<<X<<endl;
    }
}

C题

• 题意
  有 $a_1,a_2,a_3$ 堆数量分别为1，2，3 的石子，每次合并花费为$(xmod3)\ast (ymod3)$, 问合成一堆最小花费是多少？
• 思路
  这题太简单了，直接一发$AC$。就是分类讨论就可了，直接看代码。
• 代码

#include<iostream>

using namespace std;

int main()
{
    int a,b,c;
    cin>>a>>b>>c;
    int res=0;
    if(a<b)
    {
        res+=(a*2);
        b-=a;
        int x=b/3;
        res+=x*6;
        if(b%3==2)
            res+=4;
        cout<<res<<endl;
    }
    else if(a==b)
    {
        cout<<2*a<<endl;
    }
    else
    {
        res+=2*b;
        a-=b;
        int x=a/3;
        res+=x*3;
        if(a%3==2)
            res+=1;
        cout<<res<<endl;
    }
}

D题

• 题意
  n个同学，每个同学写论文的字数区间$[l，r]$，与此同时他们的成绩是$n-k_i$，$k_i$ 是指比他字数写的多的人的个数。这题给了一个初始$plan$，就是每个人按自己的字数最大值去写，所以每个人都有一个初始成绩，但是，为了尽量的缩短需要写的论文的字数，并保证成绩不会低于初始成绩的条件下，求${\sum }_{i=0}^n{w}_i$ 最小值。
• 思路
  贪心。按照$R$ 为第一关键字、$L$ 为第二关键字排序。$R$相同的直接去所有能满足条件的最小的就行。注意要始终更新每个区间能满足的最小值。
• 代码

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N=1e5+10;
struct node {
	ll l,r;
}X[N];

bool cmp(node a,node b)
{
	if(a.r==b.r)
		return a.l<b.l;
	return a.r<b.r;
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>X[i].l>>X[i].r;
	}
	sort(X+1,X+1+n,cmp);
	ll last=X[1].r;
	ll res=0;
	int k=1;
    ll m=X[1].l;
	for(int i=2;i<=n;i++)
	{
		if(X[i].r==last)
		{
			k++;
		}
		else
		{
            m=max(m,X[i-1].l);
			res+=(k*m);
			last=X[i].r;
			k=1;
		}
	}
	res+=(k*max(m,X[n].l));
	cout<<res<<endl;
}