Codeforces Round 898 (Div. 4) A - F

Codeforces Round 898 (Div. 4)

A. Short Sort

思路：
水题就不用多说,直接代码展示

#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[110][110],b[110][110];
int prime[N];
bool st[N];
int g[100][100];
map<int,int>mp;
void solve(){
   string s;cin>>s;
   int f=0;
   rep(i,0,2)if(s[i]==char('a'+i))f++;
   if(f){
       cout<<"YES\n";
   }else{
       cout<<"NO\n";
   }
}
signed main(){
    cin>>t;
    while(t--)solve();
}

B. Good Kid

思路：水题直接看代码

#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[N],b[110][110];
int prime[N];
bool st[N];
int g[100][100];
map<int,int>mp;
void solve(){
  cin>>n;
  rep(i,1,n)cin>>a[i];
  int mx=0;
  rep(i,1,n){
      a[i]++;
      int sum=1;
      rep(j,1,n){
          sum*=a[j];
      }
      //cout<<"s== "<<sum<<endl;
      mx=max(mx,sum);
      a[i]--;
      //cout<<a[i]<<" ";
  }
  cout<<mx<<endl;
}
signed main(){
    cin>>t;
    while(t--)solve();
}

C. Target Practice

思路：水题直接代码展示

#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[N],b[110][110];
int prime[N];
bool st[N];
char g[100][100];
map<int,int>mp;
void solve(){
    int res=0;
  rep(i,1,10){
      rep(j,1,10){
          cin>>g[i][j];
          if(g[i][j]=='X'){
              int x=min(i,10-i+1);
              int y=min(j,10-j+1);
              res+=min(x,y);
          }
      }
  }
  cout<<res<<endl;
}
signed main(){
    cin>>t;
    while(t--)solve();
}

D. 1D Eraser

思路：水题代码展示

#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[N],b[110][110];
int prime[N];
bool st[N];
char g[100][100];
map<int,int>mp;
void solve(){
    cin>>n>>m;
    string s;cin>>s;
    s="?"+s;
    int res=0;
    int l=1;
    while(l<=n){
        if(s[l]=='B'){
            res++;
            l=l+m;
            continue;
        }
        l++;
    }
    cout<<res<<endl;
}
signed main(){
    cin>>t;
    while(t--)solve();
}

E. Building an Aquarium

思路：裸二分，水题（但被恶心到了，一直wa4）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
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;
typedef long long LL;
int n,m,k,Q,cnt,t,x;
vector<int>del;
int a[N],b[110][110];
int prime[N];
bool st[N];
char g[100][100];
bool check(int mid){
     LL ans = 0;
    for (int i = 0; i < n; ++i)
        ans += max(mid - a[i],0ll);
        // cout << "ans  = " << ans << nl;
    if(ans > x) return false;
    return true;
}
void solve(){
     cin >> n >> x;
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
        // b[i] =
    }

    LL l = 1, r = 1e10+10;
    while (l < r)
    {
        LL mid = (l + r + 1) /2;
        if (check(mid))
            l = mid;
        else
            r = mid - 1;
    }
    cout << r << endl;
}
signed main(){
    cin>>t;
    while(t--)solve();
}

F. Money Trees

思路：
考虑到位置 i 能往后延伸到的最远位置和 i+1 能往后延伸到的最远位置相关，逆序递推一下。对于每一个位置，二分查找合适的右端点，然后取长度的 max即可 。

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve() {
    int n, k;
    std::cin >> n >> k;
    std::vector<int> a(n + 1);
    std::vector<int> h(n + 1);
    for (int i = 1; i <= n; i++) {
        std::cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        std::cin >> h[i];
    }
    std::vector<int> r(n + 1);
    std::vector<i64> pref(n + 1);
    for (int i = 1; i <= n; i++) {
        pref[i] = pref[i - 1] + a[i];
    }
    std::iota(r.begin(), r.end(), 0);
    //for(int i=1;i<=n;i++)cout<<r[i]<<" ";
    //cout<<endl;
    for (int i = n - 1; i >= 1; i--) {
        if (h[i] % h[i + 1] == 0) {
            r[i] = r[i + 1];
        }
    }
   //for(int i=1;i<=n;i++)std::cout<<r[i]<<" ";
    //cout<<endl;
    
    int max = 0;
    for (int i = 1; i <= n; i++) {
        int pos = std::upper_bound(pref.begin() + i, pref.begin() + r[i] + 1, k + pref[i - 1]) - pref.begin();
        pos--;
        //acout<<pos<<endl;
        max = std::max(max, pos - i + 1);
    }
   std::cout << max << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}