上海iai2020年7月月赛丙组

2020年7月月赛

盈亏问题

#include <bits/stdc++.h>
using namespace std;
const int N = 809;
using ll = long long; 
int main()
{
    int a,x,y;
    cin>>a>>x>>y;
    int n=y+x;
    int xx=a*n-x;
    cout<<n<<" "<<xx;
    return 0;
}

感应门

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+6;
using ll = long long;
int a[N]; 
int main()
{
    int n,d;
    cin>>n>>d;
    for(int i=1;i<=n;i++)cin>>a[i];
    int ans=d;
    for(int i=1;i<n;i++)
    {
        ans+=min(d,a[i+1]-a[i]);
    }
    cout<<ans;
    return 0;
}

数根

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+6;
using ll = long long;
int a[N]; 
int main()
{
    string s;
    cin>>s;
    while(s.size()>1)
    {
        string ss;
        int ans=0;
        for(auto i:s)ans+=i-'0';
        if(ans==0)ss="0";
        while(ans)
        {
            ss+=ans%10+'0';
            ans/=10;
        }
        s=ss;
    }
    cout<<s;
    return 0;
}

倍数区间

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100007;
int a[N];
int main()
{
    int n,k;
    cin>>n>>k;
    ll sum=0;
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        sum+=x;
        ans+=a[sum%k];
        a[sum%k]++;
    }
    cout<<ans+a[0];
    return 0;
}

闯关升级

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+7;
ll a[N],b[N];
int main()
{
    int n;
    ll t;
    cin>>n>>t;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]+=a[i-1];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>b[i];
        b[i]+=b[i-1];
    }
    int ans=0;
    for(int i=0;i<=n;i++)
    {
        if(a[i]>t)break;
        int id=upper_bound(b,b+n+1,t-a[i])-b-1;
        ans=max(ans,i+id);
    }
    cout<<ans;
    return 0;
}