A. Petya and Origami
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,k;
int main()
{
scanf("%d%d",&n,&k);
printf("%d\n",(2*n+k-1)/k+(5*n+k-1)/k+(8*n+k-1)/k);
return 0;
}
B. Margarite and the best present
- 附上网上大佬简洁优雅的代码。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int t,l,r;
int solve(int x){
if(x%2)return x/2-x;
return x/2;
}
int main()
{
scanf("%d",&t);
while(t--){
scanf("%d%d",&l,&r);
printf("%d\n",solve(r)-solve(l-1));
}
return 0;
}
C. Masha and two friends
刚开始分情况讨论的,很小心的写了好久好久,Wrong answer on test 43,无奈了,最后百度看到处理相交区域的方法。
- 通过横纵坐标相加后的奇偶性可以直接判断该点的颜色
- solve函数返回区域内黑块个数
- 假如刷白区域和刷黑区域相交的话,相交区域为:(max(x1,x3),max(y1,y3),min(x2,x4),min(y2,y4))
- 统计黑块个数,首先求出区域(1,1,m,n)黑块个数,其次减去刷白区域中黑块个数,然后加上刷黑区域内白块个数,最后,如果两区域相交再加上相交区域黑块个数。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll t,n,m;
ll solve(ll x1,ll y1,ll x2,ll y2){ //返回区域黑块个数
if(x2<x1||y2<y1)return 0;
ll d=(x2-x1+1)*(y2-y1+1);
if(d%2==0)return d/2;
if((x1+y1)%2)return d/2+1;
return d/2;
}
int main()
{
scanf("%lld",&t);
while(t--){
scanf("%lld%lld",&n,&m);
ll x1,y1,x2,y2,x3,y3,x4,y4;
scanf("%lld%lld%lld%lld%lld%lld%lld%lld",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
ll k=solve(1,1,m,n); //黑块个数
k-=solve(x1,y1,x2,y2); //区域刷白后黑块个数
k+=(x4-x3+1)*(y4-y3+1)-solve(x3,y3,x4,y4); //区域刷黑后黑块的个数
//相交区域黑块个数
k+=solve(max(x1,x3),max(y1,y3),min(x2,x4),min(y2,y4));
printf("%lld %lld\n",m*n-k,k);
}
return 0;
}
D.Olya and magical square
一开始,观察到了n>31时,输出YES和n-1。然后讨论枚举了路径上正方形的边长2^i(i从0到n-1)所对应的最多切割次数R(有规律可寻,多画画),然后根据R和K的关系输出相应的i。忽略了枚举了路径上正方形的边长 2^i(i从0到n-1)所对应的最少切割次数L,导致WA。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max_n=1e6+10;
ll t,n,k;
ll s[Max_n];
ll check(ll n,ll k){
ll t=0,l=0,r=0;
for(ll i=n-1;i>=0;i--){ //枚举路径上正方形的边长
t=t*2+1;l+=t;
r+=t+(2*t-1)*s[i]; //求r的方法和照片里大佬思路不一样
//cout<<l<<' '<<r<<endl;
if(k>=l&&k<=r)return i;
}
return -1;
}
int main()
{
s[0]=0;
for(int i=1;i<=30;i++)
s[i]=s[i-1]*4+1;
scanf("%lld",&t);
while(t--){
scanf("%lld%lld",&n,&k);
if(n>31)printf("YES %lld\n",n-1);
else {
ll ans=check(n,k);
if(ans<0)puts("NO");
else printf("YES %lld\n",ans);
}
}
return 0;
}