Codeforces Round 935 (Div. 3) ( 6 / 8 )

A  Setting up Camp

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int a,b,c;
    cin>>a>>b>>c;
    if(b!=0&&b%3+c<3&&b%3!=0)cout<<"-1"<<endl;
    else{
        int ans=a+((b+c)/3)+1;
        if((b+c)%3==0)ans--;
        cout<<ans<<endl;
    }
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

B  Fireworks

#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
    int a,b,m;
    cin>>a>>b>>m;
    cout<<(m/a+1)+(m/b+1)<<endl;
}
signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

C  Left and Right Houses

#include<bits/stdc++.h>
using namespace std;
const int N=1e7+10;
int s[N][2],n;
char ss[10000000];
int  x,ans;
void solve(){
    int mi=0x7fffffff;
    cin>>n>>(ss+1);
    for(int i=1;i<=n;i++){
        x=ss[i]-'0';
        s[i][0]=s[i-1][0];
        s[i][1]=s[i-1][1];
        s[i][x]++;
    }
    for(int i=0;i<=n;i++){
        if(s[i][0]>=ceil(i*1.0/2)&&s[n][1]-s[i][1]>=ceil((n-i)*1.0/2)){
            if(fabs(n*1.0/2-i)<mi)mi=fabs(n*1.0/2-i),ans=i;
        }
    }
    cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

  

D  Seraphim the Owl

#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
    int n,m,p,sum=0,res=0x7fffffff;
    int ans=0;
    cin>>n>>m;
    vector<int>a(n);
    vector<int>b(n);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    for(int i=n-1;i>=m;i--){
        ans+=min(a[i],b[i]);
    }
    if(m==1)ans+=a[0];
    else for(int i=m-1;i>0;i--){
        p=min(sum+b[i]+a[i-1],a[m-1]);
        sum+=b[i];
        res=min(res,p);
    }
    if(res!=0x7fffffff)cout<<ans+res<<endl;
    else cout<<ans<<endl;
}
signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

E  Binary Search

#include<bits/stdc++.h>
using namespace std;
void solve(){
    int n,x,p;
    cin>>n>>x;
    vector<int>a(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(a[i]==x)p=i;
    }
    int l=1,r=n+1;
    while(r-l!=1){
        int m=(r+l)/2;
        if(a[m]<=x)l=m;
        else r=m;
    }
    if(a[l]==x)cout<<'0'<<endl;
    else {
        cout<<'1'<<endl;
        cout<<p<<' '<<l<<endl;
    }
}
int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}

F  Kirill and Mushrooms

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e7+10;
void solve(){
    int n,x,ans=0,id=0;
    cin>>n;
    vector<int>v(n),p(n);
    for(int i=0;i<n;i++)cin>>v[i];
    for(int i=0;i<n;i++)cin>>p[i],p[i]--;
    priority_queue<int,vector<int>,greater<int>>q;
    for(int i=n-1;i>=0;i--){
        q.push(v[p[i]]);
        while(q.size()>i+1)q.pop();
        if(q.size()==i+1){
            if(ans<=(i+1)*q.top())
                ans=max(ans,(i+1)*q.top()),id=i+1;
        }
    }
    cout<<ans<<' '<<id<<endl;
}
signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    //t=1;
    while(t--)solve();
    return 0;
}