CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)
A. MEXanized Array
思路:
我们可以发现,当k>n或者k-1>x那么就不能组成想要的答案,然后就是我们可以让0到k-1都出现,然后其余都放剩下满足最大的那个
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define SZ(v) ((int)v.size())
#define fs first
#define sc second
const int N=2e6+10,M=2e5;
typedef double db;
typedef pair<int,int>pii;
int n,m,k,Q,cnt,t,x;
vector<int>del;
int a[200010],b[200010];
int prime[N];
bool st[N];
map<int,int>mp;
void solve(){
cin>>n>>k>>x;
if(n<k||x<k-1){
cout<<-1<<endl;
return ;
}
int res=0;
res+=(k*(k-1))/2;
res+=(x==k?x-1:x)*(n-k);
cout<<res<<endl;
}
signed main(){
cin>>t;
while(t--)solve();
}
B. Friendly Arrays
思路:
当时写的时候没有想到异或什么不会改变,一股脑全设置的为一,这里我直接猜的,就是将b里面的值全部或起来,然后输出了他们异或每一位,和不异或每一位的值发现,答案就是里面的最大和最小值
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define SZ(v) ((int)v.size())
#define fs first
#define sc second
const int N=2e6+10,M=2e5;
typedef double db;
typedef pair<int,int>pii;
int n,m,k,Q,cnt,t,x;
vector<int>del;
int a[200010],b[200010];
int prime[N];
bool st[N];
map<int,int>mp;
void solve(){
cin>>n>>m;
rep(i,1,n)cin>>a[i];
rep(i,1,m)cin>>b[i];
int res=0;
int x=0;
rep(i,1,m)x|=b[i];
int y=0;
rep(i,1,n){
y^=(a[i]|x);
res^=(a[i]);
}
cout<<min(y,res)<<" "<<max(y,res)<<endl;
}
signed main(){
cin>>t;
while(t--)solve();
}
C. Colorful Table
思路:
根据样例可以发现,最终每一位答案必然是最左边和最右边能出现的最远距离,这里需要跟新的就是可能前一位可以跟新其他的最大值和最小值
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define SZ(v) ((int)v.size())
#define fs first
#define sc second
const int N=2e6+10,M=2e5;
typedef double db;
typedef pair<int,int>pii;
int n,m,k,Q,cnt,t,x;
vector<int>del;
int a[200010],b[200010];
int prime[N];
bool st[N];
map<int,int>mp;
int nm[36][2],mle[36][2];
int l[N],r[N];
void solve(){
cin>>n>>k;
rep(i,1,k)l[i]=N,r[i]=0;
rep(i,1,n)cin>>a[i];
mp.clear();
rep(i,1,n){
l[a[i]]=min(l[a[i]],i),r[a[i]]=max(r[a[i]],i);
mp[a[i]]++;
}
per(i,0,k-1){
l[i]=min(l[i],l[i+1]);
r[i]=max(r[i],r[i+1]);
}
rep(i,1,k){
if(mp[i]){
cout<<(r[i]-l[i]+1)*2<<" ";
}else{
cout<<0<<" ";
}
}
cout<<endl;
}
signed main(){
cin>>t;
while(t--)solve();
}
D. Prefix Purchase
思路:
我们从后往前找,将比当前位置小的数存入栈中,并找到最小值mn,购买之后可能会剩余一些金币,我们贪心地从最小的位置不断往后寻找,用后面的a[i]来替换mn ,同时更新mn 直到不能再购买为止。
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int n,k;
const int INF=1e9+7;
typedef pair<int,int>PII;
void solve()
{
LL Min = INF;
cin >> n;
vector<LL> c(n);
vector<PII> b(n);
for (int i = 0; i < n; i++)
{
cin >> c[i];
}
cin >> k;
stack<PII> stk;
for (int i = n - 1; i >= 0; i--)
{
if (c[i] < Min)
{
stk.push({c[i], i});
// cout << c[i] << ' ' << i << '\n';
}
Min = min(Min, c[i]);
}
LL Max = k / Min;
LL lst = k - Max * Min; // 剩余
vector<LL> out(n, 0);
out[(stk.top()).second] = Max;
auto tp = stk.top();
while (stk.size())
{
auto it = stk.top();
// cout << it.first << ' ' << it.second << '\n';
stk.pop();
if (tp == it)
{
continue;
}
LL x = min(Max, (lst / (it.first - Min)));
// cout << x << '\n';
if (!x)
{
break;
}
out[it.second] = x;
lst -= x * (it.first - Min);
Max = x;
Min = it.first;
}
LL now = 0;
for (int i = n - 1; i >= 0; i--)
{
now = max(now, out[i]);
out[i] = now;
}
for (int i = 0; i < n; i++)
{
cout << out[i] << ' ';
}
cout << '\n';
}
int main(){
int t;cin>>t;
while(t--)solve();
}