A. Nastia and Nearly Good Numbers
题意
给出a,b,构造出x,y,z,使得x+y=z,x%a=0,y%a=0,z%a=0,x%b!=0,y%b!=0,z%b=0
思路
- 显然,当b是1无解
- 否则给a乘上1倍和2b-1倍就可以构造出x和y,继续构造z即可
时间复杂度
O(T)
参考代码
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#define max(a,b) (a>b?a:b)
using namespace std;
const int maxn=1e6+10;
long long a,b;
int t;
int main(){
scanf("%d",&t);
while(t--){
// scanf("%d",&n);
scanf("%lld%lld",&a,&b);
if(b==1){
printf("NO\n");
continue;
}
printf("YES\n");
printf("%lld %lld %lld\n",a*1,a*(b*2-1),a*b*2);
}
}
B. Nastia and a Good Array
题意
给出数组A,每次操作可以换数字,将ai和aj换位x和y,但是要求min(ai,aj)=min(x,y),最多可以换n次,使得数组每两个相邻元素互质
思路
- 显然,最小的数字无论怎样都无法换掉
- 换元素的次数十分充分,我们从这个位置开始,把相邻元素换成数字相差为1的数字即可
时间复杂度
O(Tn)
参考代码
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
const int maxn=1e5+10;
int t,n,k,cnt,a[maxn];
int main(){
scanf("%d",&t);
while(t--){
cnt=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int id=1;
for(int i=2;i<=n;i++) if(a[id]>a[i]) id=i;
printf("%d\n",n-1);
for(int i=id+1;i<=n;i++) printf("%d %d %d %d\n",id,i,a[id],a[id]+i-id);
for(int i=id-1;i>=1;i--) printf("%d %d %d %d\n",id,i,a[id],a[id]-i+id);
}
}
C. Nastia and a Hidden Permutation
题意
交互题:1到n的全排列,每次可以给出下标i,j,数字x,可以选择要或者,使用不超过次问询找出数组
思路
- 显然,问询就是找出两个数的较大值或者较小值,但是由于n只能取1到n-1,可能会影响1问询的后项和2的后项,所以遇到答案是1或者n-1的时候可以交换两个位置进行问询,就可以得到准确答案
- 换元素的次数十分充分,我们选择3个数字一组,进行4次问询即可得到数字,总问询次数不超过显然满足题意
时间复杂度
O(Tn)
参考代码
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
const int maxn=1e5+10;
int t,n,k,ans[maxn];
void solve(int pos){
printf("? 1 %d %d %d\n",pos,pos-1,n-1);fflush(stdout);
int max1;scanf("%d",&max1);
if(max1==n-1){
printf("? 1 %d %d %d\n",pos-1,pos,n-1);fflush(stdout);
scanf("%d",&max1);
}
if(max1!=ans[pos-1]){
ans[pos]=max1;
return;
}
printf("? 2 %d %d %d\n",pos,pos-1,1);fflush(stdout);
scanf("%d",&max1);
if(max1==2){
printf("? 2 %d %d %d\n",pos-1,pos,1);fflush(stdout);
scanf("%d",&max1);
}
ans[pos]=max1;
}
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i+=3){
if(i+2>n){
if(i+1==n){
solve(i);
solve(i+1);
}
else if(i==n){
solve(i);
}
break;
}
printf("? 1 %d %d %d\n",i,i+1,n-1);fflush(stdout);
int max1;scanf("%d",&max1);
if(max1==n-1){
printf("? 1 %d %d %d\n",i+1,i,n-1);fflush(stdout);
scanf("%d",&max1);
}
printf("? 2 %d %d %d\n",i,i+1,1);fflush(stdout);
int min1;scanf("%d",&min1);
if(min1==2){
printf("? 2 %d %d %d\n",i+1,i,1);fflush(stdout);
scanf("%d",&min1);
}
printf("? 1 %d %d %d\n",i+1,i+2,n-1);fflush(stdout);
int max2;scanf("%d",&max2);
if(max2==n-1){
printf("? 1 %d %d %d\n",i+2,i+1,n-1);fflush(stdout);
scanf("%d",&max2);
}
printf("? 2 %d %d %d\n",i+1,i+2,1);fflush(stdout);
int min2;scanf("%d",&min2);
if(min2==2){
printf("? 2 %d %d %d\n",i+2,i+1,1);fflush(stdout);
scanf("%d",&min2);
}
if(min1==min2){
ans[i+1]=min1;
ans[i]=max1;
ans[i+2]=max2;
}
if(min1==max2){
ans[i+1]=min1;
ans[i]=max1;
ans[i+2]=min2;
}
if(max1==min2){
ans[i+1]=max1;
ans[i]=min1;
ans[i+2]=max2;
}
if(max1==max2){
ans[i+1]=max1;
ans[i]=min1;
ans[i+2]=min2;
}
}
printf("! ");
for(int i=1;i<=n;i++) printf("%d ",ans[i]);
printf("\n");
fflush(stdout);
}
}
D. Nastia Plays with a Tree
题意
给出一棵树,重连最少的边,让他变成一条链
思路
- 找到树的一个叶子结点,开始dfs,每次遇到分叉就留一根,剩下的全部拉过去,注意更新叶子结点的标号,就是最优解
时间复杂度
O(T*n)
参考代码
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#define max(a,b) (a>b?a:b)
using namespace std;
const int maxn=1e5+10;
struct A {
int a,b,c,d;
}xx;
int t,n,rt;
vector<int> G[maxn];
vector<A> ans;
A change(int a,int b,int c,int d){
xx.a=a,xx.b=b,xx.c=c,xx.d=d;
return xx;
}
int dfs(int u,int fa){
int cnt=0,nxt=u;
for(int i=0,z=G[u].size();i<z;i++){
int v=G[u][i];
if(v==fa) continue;
int to=dfs(v,u);
if(to<0) continue;
cnt++;
if(cnt==1){
nxt=to;
}else if(cnt==2){
ans.push_back(change(fa,u,nxt,to));
nxt=-1;
}else{
ans.push_back(change(u,v,v,to));
}
}
return nxt;
}
int main(){
scanf("%d",&t);
while(t--) {
ans.clear();
scanf("%d",&n);
for(int i=1;i<=n;i++) G[i].clear();
for(int i=1,u,v;i<n;i++) {
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
for(int i=1;;i++)
if(G[i].size()==1){
rt=dfs(i,i);
break;
}
printf("%d\n",ans.size());
for(int i=0,z=ans.size();i<z;i++){
xx=ans[i];
printf("%d %d %d %d\n",xx.a,xx.b,rt,xx.c);
rt=xx.d;
}
}
}