Educational Codeforces Round 108 (Rated for Div. 2)

A - Red and Blue Beans

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define mem(a,b) memset(a,b,sizeof a)
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
const double eps = 1e-6;
const int mod = 998244353;
const int N = 1e6 + 10;
const int M = 555;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;

void solve(){
    ll t;
    cin>>t;
    while(t--){
        ll r,b,d;
        cin>>r>>b>>d;
        ll minn=min(r,b);
        ll res=abs(r-b);
        ll ans=res/minn;
        if(res%minn) ans++;
        if(ans>d) cout<<"NO"<<endl;
        else cout<<"YES"<<endl;
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
	return 0;
}

B - The Cake Is a Lie

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define mem(a,b) memset(a,b,sizeof a)
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
const double eps = 1e-6;
const int mod = 998244353;
const int N = 1e6 + 10;
const int M = 555;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;

void solve(){
    int t;
    cin>>t;
    while(t--){
        int n,m,d;
        cin>>n>>m>>d;
        int res=n*(m-1)+(n-1);
        if(res==d) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
	return 0;
}

C - Berland Regional

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define mem(a,b) memset(a,b,sizeof a)
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
const double eps = 1e-6;
const int mod = 998244353;
const int N = 2e5 + 10;
const int M = 555;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;

ll vis[N];
//set<ll>sc;
//queue<ll>sc;
vector<ll>vp[N];
vector<ll>bo;
//vector<ll>ans;

bool cmp(ll x,ll y){
    return x>y;
}

void solve(){
    ll t;
    cin>>t;
    while(t--){
//        sc.clear();
        queue<ll>sc;
        ll n;
        cin>>n;
        for(ll i=1;i<=n;i++) vp[i].clear();
        for(ll i=1;i<=n;i++){
            cin>>vis[i];
//            if(bo.count(vis[i])) q.push(vis[i]);
//            bo.pb(vis[i]);
//            if(!sc.count(vis[i])) sc.insert(vis[i]);
        }
        for(ll i=1;i<=n;i++){
            ll x;
            cin>>x;
            vp[vis[i]].pb(x);
        }

        for(int i=1;i<=n;i++){
            vis[i]=0;
            sort(vp[i].begin(),vp[i].end(),cmp);
            if(!(int)vp[i].size()) continue;
            for(int j=1;j<(int)vp[i].size();j++){
                vp[i][j]+=vp[i][j-1];
            }
            sc.push(i);
        }
        for(int k=1;k<=n;k++){
            ll res=0;
            while(sc.size()){
                int t=sc.front();
                if(vis[t]==k) break;
                vis[t]=k;
                sc.pop();
                ll l=vp[t].size();
                if(l<k) continue;
                ll col=l%k;
                l-=col;
                res+=vp[t][l-1];
                if((int)vp[t].size()>k) sc.push(t);
            }
            cout<<res<<" ";
        }

//        for(auto i:sc) cout<<i<<"***\n";
//        for(ll k=1;k<=n;k++){
//            ll res=0;
//            for(auto i:sc){
//                    cout<<i<<"*"<<endl;
//                ll len=vp[i].size();
//                if(len<k){
//                    sc.erase(i);
//                    continue;
//                }
//                ll col=len%k;
//                len-=col;
//                res+=vp[i][len-1];
//            }
//            cout<<res<<" ";
        cout<<endl;
        }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
	return 0;
}

D - Maximum Sum of Products

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define mem(a,b) memset(a,b,sizeof a)
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
const double eps = 1e-6;
const int mod = 998244353;
const int N = 2e5 + 10;
const int M = 5555;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;

ll a[M];
ll b[M];
ll ans[M];
ll dp[M][M];

//bool cmp(node x,node y){
//    return x.num<y.num;
//}

void solve(){
    ll n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    ans[n+1]=0;
    for(int i=n;i>=1;i--) ans[i]=ans[i+1]+a[i]*b[i];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            dp[i][j]=a[i]*b[j];
            if(i>1) dp[i][j]+=dp[i-1][j+1];
        }
    }
    ll sum=ans[1];
    ll res=sum;
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            ll cur=sum-(ans[i]-ans[j+1])+dp[j][i];
            if(i>1) cur-=dp[i-1][j+1];
            res=max(res,cur);
        }
    }
    cout<<res<<endl;
//    cout<<sum<<endl;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
	return 0;
}