A. 签到题, 输出2~n+1即可满足
B.
问:
给定n,求是否有刚好有a个数,他们两边的数都小于他,b个数,他们两边的数都大于他。
如果有输出一种n个数的排列,不然输出-1。
解:
易知,把一个排列按1, n, 2, n-1 排会发现:
a 和 b最大相差1个
然后按最优情况排即可,排完直接按顺序正序或者倒序输出剩下的数。
#pragma GCC optimize (2)
#pragma G++ optimize(2)
#pragma GCC optimize (3)
#pragma G++ optimize(3)
#define fastio ios_base::sync_with_stdio(0); cin.tie(NULL);
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define LL long long
#define debug1 cout << "???" << endl;
#define debug2(x) cout << "debug: " << x << endl;
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5+7;
int T, n, a[N], maxnum, minnum, st, ed;
int main()
{
fastio
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
cin >> T;
while(T--)
{
st = 0, ed = 0;
cin >> n >> maxnum >> minnum;
int maxn = (n-1)/2, sum = maxnum + minnum;
if(maxnum > maxn || minnum > maxn || maxnum + minnum > n-2 || abs(maxnum - minnum) > 1)
{
cout << "-1\n";
continue;
}
st = 1, ed = n;
if(maxnum > minnum)
{
rep(i, 1, sum+1)
{
if(i%2)
a[i] = st++;
else
a[i] = ed--;
}
rep(i, sum+2, n)
a[i] = ed--;
}
else if(minnum > maxnum)
{
rep(i, 1, sum+1)
{
if(i%2)
a[i] = ed--;
else
a[i] = st++;
}
rep(i, sum+2, n)
a[i] = st++;
}
else
{
rep(i, 1, sum)
{
if(i%2)
a[i] = st++;
else
a[i] = ed--;
}
rep(i, sum+1, n)
a[i] = st++;
}
rep(i, 1, n)
cout << a[i] << ' ';
cout << endl;
}
return 0;
}
C
问:
两个地图,n个选手有两个地图的能力值,任意进行n-1场比赛,每个人是否有可能活到最后。
考虑对于第一个地图的能力值升序排序,知道能力值最大的一定可以赢,然后倒序查找,如果比当前能赢的第二个地图能力值高,就也能到最后,然后把这个数到维护到的末尾的人都判断为能赢。
//#pragma GCC optimize (2)
//#pragma G++ optimize(2)
//#pragma GCC optimize (3)
//#pragma G++ optimize(3)
#define fastio ios_base::sync_with_stdio(0); cin.tie(NULL);
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define LL long long
#define debug(x) cout << #x << ": " << x << endl
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5+7;
int T, n, ans[N], tmp[N][2];
struct node
{
int mp1, mp2, idx;
node(int mp1 = 0, int mp2 = 0, int idx = 0):mp1(mp1), mp2(mp2), idx(idx){}
bool operator < (const node & p)const{return mp1 < p.mp1;}
}a[N];
int main()
{
fastio
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
cin >> T;
while(T--)
{
int n, minn;
cin >> n;
rep(i, 1, n)
ans[i] = 0;
rep(i, 1, n)
cin >> tmp[i][0];
rep(i, 1, n)
cin >> tmp[i][1];
rep(i, 1, n)
a[i] = node(tmp[i][0], tmp[i][1], i);
sort(a+1, a+n+1);
ans[a[n].idx] = 1;
minn = a[n].mp2;
int j = n-1;
per(i, n-1, 1)
{
if(a[i].mp2 > minn)
{
ans[a[i].idx] = 1;
rep(k, i+1, j)
{
ans[a[k].idx] = 1;
minn = min(minn, a[k].mp2);
}
j = i;
}
}
rep(i, 1, n)
cout << ans[i];
cout << endl;
}
return 0;
}