codeforces1407C Chocolate Bunny

https://codeforces.com/contest/1407/problem/C

因为是1-n的排列，那么如果pi%pj<pj%pi,那么一定是pj=pj % pi,每次随便找两个没确定的数字比较一下，一共2*(n-1)次询问就能找出1-n-1.

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;const int maxl=3e5+10;int n,m,cnt,tot,cas,ans;
int a[maxl];
bool vis[maxl],numin[maxl];
char s[maxl];inline void prework()
{scanf("%d",&n);
}inline int print(int u,int v)
{int x;printf("? %d %d\n",u,v);fflush(stdout);scanf("%d",&x);return x;
}inline void mainwork()
{if(n==1){printf("! 1");fflush(stdout);return;}int t1,t2,last=1,now;for(int i=1;i<=n-1;i++){for(int j=1;j<=n;j++)if(!vis[j] && last!=j){now=j;break;}t1=print(last,now);t2=print(now,last);if(t1>t2){vis[last]=true;numin[t1]=true;a[last]=t1;last=now;}else{vis[now]=true;numin[t2]=true;a[now]=t2;last=last;}}for(int i=1;i<=n;i++)if(!vis[i])a[i]=n;printf("!");for(int i=1;i<=n;i++)printf(" %d",a[i]);fflush(stdout);
}int main()
{int t=1;//scanf("%d",&t);for(cas=1;cas<=t;cas++){prework();mainwork();       }return 0;
}

codeforces1407C Chocolate Bunny相关推荐

C. Chocolate Bunny（思维）
题目传送门 Chocolate Bunny 题目大意求一个长度为n的数组每次可以输入两个值i和j询问,将会得到一个为pimodpjp_i\ mod\ p_jpi mod pj返回值,最多可以进 ...
1407C. Chocolate Bunny(交互,推导)
交互题还是很难搞呀~ C. Chocolate Bunny(交互,推导) 假设ai%aj=x假设a_i\%a_j=x假设ai%aj=x aj%ai=ya_j\%a_i=yaj%ai=y 其实就 ...
CodeForces 1K-1600R-1407C Chocolate Bunny
1407C-Chocolate Bunny Description Link Analysis 题目概述交互题给出一个 1→n1\to n1→n 的排列(1≤n≤1041\le n\le10^41 ...
C. Chocolate Bunny
https://codeforces.com/contest/1407/problem/C 交互题对于i,j,如果ai%aj<aj%ai,则aj<ai.每次登都进行两个数的前后的相互询问 ...
C. Chocolate Bunny(思维+规律)
https://codeforces.com/contest/1407/problem/C 题意:交互题,每次最多询问i,j的pimodpj的值,问最后这个长度为n的排列是什么. 首先考虑到题目给的最 ...
Codeforces Round #669 (Div. 2)
那天晚上和同学打球打的有点晚,结果就鸽了,现在来补一下 A - Ahahahahahahahaha 直接看原数组中0的个数cnt0和1的个数cnt1,谁多留谁即可,注意留1的时候要留偶数个. #def ...
2015: [Usaco2010 Feb]Chocolate Giving
2015: [Usaco2010 Feb]Chocolate Giving Time Limit: 10 Sec Memory Limit: 162 MB Submit: 269 Solved: ...
HDU 2282 Chocolate （最小费用最大流）
HDU 2282 Chocolate (最小费用最大流) #include <iostream> #include <cstdio> #include <queue&g ...
14行代码AC_Break the Chocolate HDU-4112（数学推导+解析）
励志用少的代码做高效表达 Problem describe Benjamin is going to host a party for his big promotion coming up. Eve ...

codeforces1407C Chocolate Bunny

codeforces1407C Chocolate Bunny相关推荐

最新文章

热门文章