Codeforces Round #661 (Div. 3)——ABCD解题报告

mumei314

于 2021-03-18 00:22:51 发布

阅读量114

点赞数

分类专栏： codeforces 文章标签：算法

本文链接：https://blog.csdn.net/qq_43472263/article/details/114957830

版权

codeforces 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

Codeforces Round #661 (Div. 3)

比赛链接：https://codeforces.com/contest/1399

A. Remove Smallest

题解

排序后维护差分数组，如果差分数组的最大值大于 $1$ ，输出 $N O$ ，否则输出 $Y E S$ 。
原因：我们基于贪心的原则肯定从小到大取，当 $a_{i}-a_{i-1}>1$ 时， $a_{i-1}$ 消除不了。

代码

#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for (register int i = (s); i <= (t); i++)
#define RP(i,t,s) for (register int i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
inline int read(){
    int s=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        s=s*10+ch-'0';
        ch=getchar();
    }
    return s*f;
}
const int N = 1e5+7;
int a[N];
void solve(){
    int n=read();
    rp(i,1,n) a[i]=read();
    sort(a+1,a+1+n);
    rp(i,2,n){
        if(a[i]-a[i-1]>1){
            pN;
            return ;
        }
    }
    pY;
}
int main(){
    //ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt", "r", stdin);
    //debug = 1;
#endif
    //time_t beg, end;
    //if(debug) beg = clock();

    int T=read();
    while(T--) solve();

    /*
    if(debug) {
        end = clock();
        printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
    }
    */
    return 0;
}

B. Gifts Fixing

题解

容易得知一个结论：
最终糖果数和桔子数都会变成一个定值，这个定值就是各自数目的最小值。
因为每次只能减，而基于贪心的原则都变成最小值是最优的方案。
首先从前往后枚举礼物，然后考虑怎么取最优。
当糖果数 $a_{i}$ 和桔子数 $b_{i}$ 都大于最小值时，选择都减一。
最后剩下的再单独减即可。

代码

#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for (register int i = (s); i <= (t); i++)
#define RP(i,t,s) for (register int i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
inline int read(){
    int s=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        s=s*10+ch-'0';
        ch=getchar();
    }
    return s*f;
}
const int N = 1e5+7;
int a[N];
void solve(){
    int a=read(),b=read(),x=read(),y=read(),n=read();
    int num1=min(a-x,n);
    int num2=min(b-y,n);
    // outval2(num1,num2);
    if(a-num1<b-num2){
        cout<<1ll*(a-num1)*(max(y,b-(n-num1)))<<endl;
    }
    else {
        cout<<1ll*(b-num2)*(max(x,a-(n-num2)))<<endl;
    }
}
int main(){
    //ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt", "r", stdin);
    //debug = 1;
#endif
    //time_t beg, end;
    //if(debug) beg = clock();

    int T=read();
    while(T--) solve();

    /*
    if(debug) {
        end = clock();
        printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
    }
    */
    return 0;
}

C. Boats Competition

题解

范围比较小，我们可以直接枚举最终确定的那个和，维护最多的对数即可。

代码

#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for (register int i = (s); i <= (t); i++)
#define RP(i,t,s) for (register int i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
inline int read(){
    int s=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        s=s*10+ch-'0';
        ch=getchar();
    }
    return s*f;
}
const int N = 1e5+7;
int a[N],c[N];
ll dp[N];
map<int,int> mp;
void solve(){
    int n=read();
    rp(i,1,n) a[i]=read();
    rp(i,1,n*2) dp[i]=-1;
    sort(a+1,a+1+n);
    ll res=0;
    rp(i,1,n){
        rp(j,i+1,n){
            int sum=a[i]+a[j];
            if(dp[sum]!=-1) continue;
            ll num=0;
            mp.clear();
            rp(k,1,n) mp[a[k]]++;
            rp(k,1,n){
                if(mp[a[k]]>0&&mp.find(sum-a[k])!=mp.end()&&mp[sum-a[k]]>0){
                    if(a[k]==sum-a[k]&&mp[a[k]]>=2){
                        mp[a[k]]-=2;
                        num++;
                    }
                    else {
                        if(a[k]!=sum-a[k]){
                            mp[a[k]]--;
                            mp[sum-a[k]]--;
                            num++;
                        }
                    }
                }
            }
            dp[sum]=num;
            // outval2(sum,num);
            res=max(res,num);
        }
    }
    cout<<res<<endl;
}
int main(){
    //ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt", "r", stdin);
    //debug = 1;
#endif
    //time_t beg, end;
    //if(debug) beg = clock();

    int T=read();
    while(T--) solve();

    /*
    if(debug) {
        end = clock();
        printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
    }
    */
    return 0;
}

D. Decrease the Sum of Digits

题解

用 $s_{0}$ 表示结尾为 $0$ 的下标， $s_{1}$ 表示结尾为 $1$ 的下标，然后直接模拟整个过程即可。

代码

#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for (register int i = (s); i <= (t); i++)
#define RP(i,t,s) for (register int i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
inline int read(){
    int s=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        s=s*10+ch-'0';
        ch=getchar();
    }
    return s*f;
}
const int N = 1e5+7;
int sum[100];
int a[100],tot;
void solve(){
    ll n;scl(n);int s=read();
    tot=0;a[0]=0;
    while(n>0) a[++tot]=n%10,n/=10;
    rp(i,1,tot/2) swap(a[i],a[tot-i+1]);
    vector<int> ans;
    int sum=0;
    rp(i,1,tot) sum+=a[i];
    RP(i,tot,1){
        if(sum<=s) break;
        if(!a[i]){
            ans.push_back(0);
            continue;
        }
        else ans.push_back(10-a[i]);
        a[i-1]++;
        RP(j,i-1,0){
            if(a[j]==10) a[j]=0,a[j-1]++;
        }
        sum=0;
        rp(j,0,i-1) sum+=a[j];
        // outval2(i,sum);
    }
    if(ans.size()==0){
        cout<<0<<endl;
        return ;
    }
    reverse(ans.begin(),ans.end());
    for(auto val:ans) cout<<val;
    cout<<endl;
}
int main(){
    //ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt", "r", stdin);
    //debug = 1;
#endif
    //time_t beg, end;
    //if(debug) beg = clock();

    int T=read();
    while(T--) solve();

    /*
    if(debug) {
        end = clock();
        printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
    }
    */
    return 0;
}

mumei314

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Codeforces Round #661 (Div. 3)——ABCD解题报告

Codeforces Round #661 (Div. 3)比赛链接：https://codeforces.com/contest/1399A. Remove Smallest题解排序后维护差分数组，如果差分数组的最大值大于111，输出NONONO，否则输出YESYESYES。原因：我们基于贪心的原则肯定从小到大取，当ai−ai−1>1a_{i}-a_{i-1}>1ai−ai−1>1时，ai−1a_{i-1}ai−1消除不了。代码#include <bits/s
复制链接

扫一扫