SDUT 2021 Spring Individual Contest - F(Gym 101473)

A - Zero or One

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#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
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;



void solve(){
    int dp[10];
    int sum=0;
    int pos;
    for(int i=1;i<=3;i++){
         cin>>dp[i];
         if(!dp[i]) sum++;
    }
    if(sum==3||!sum) cout<<"*"<<endl;
    else if(sum==2){
        for(int i=1;i<=3;i++){
            if(dp[i]==1){
                pos=i;
                break;
            }
        }
        if(pos==1) cout<<"A"<<endl;
        else if(pos==2) cout<<"B"<<endl;
        else if(pos==3) cout<<"C"<<endl;
    }
    else if(sum==1){
        for(int i=1;i<=3;i++){
            if(!dp[i]){
                pos=i;
                break;
            }
        }
        if(pos==1) cout<<"A"<<endl;
        else if(pos==2) cout<<"B"<<endl;
        else if(pos==3) cout<<"C"<<endl;
    }
}

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

E - Dangerous Dive

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#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
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;

int dp[N];

void solve(){
    int n,r;
    cin>>n>>r;
    mem(dp,0);
    int x=r;
    while(r--){
        int k;
        cin>>k;
        dp[k]++;
    }
    if(x==n) cout<<"*"<<endl;
    else{
        bool flag=0;
        for(int i=1;i<=n;i++){
            if(!dp[i]){
                if(flag) cout<<" "<<i;
                else {
                    cout<<i;
                    flag=1;
                }
            }
        }
        cout<<endl;
    }
}

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

F - Triangles

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#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
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;

ll dp[N];
ll num[N];
map<ll,bool>vis;

void solve(){
    ll n;
    cin>>n;
    ll sum=0;
    for(ll i=1;i<=n;i++){
        cin>>dp[i];
        sum+=dp[i];
        vis[sum]=1;
        num[i]=sum;
    }
    if(sum%3!=0){
        cout<<"0"<<endl;
        return ;
    }
    else{
        ll len=sum/3;
        ll res=0;
        for(ll i=1;i<=n;i++){
            ll key=num[i]+len;
            if(vis[key]){
                if(vis[key+len]) res++;
            }
        }
        cout<<res<<endl;
    }
}

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

I - Patches

题目链接

答案

#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#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
#define eps 1e-8
#define x first
#define y second
const int mod = 1e9 + 7;
const int MOD = 1e4+7;
const int N = 1e5 + 10;
const int M = 1111;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
int dxy[][2]={{0,1},{1,0},{1,1},{-1,1}};
using namespace std;

ll n,c,t1,t2;
ll dp[N];
ll mp[N];

ll judge(ll pos){
    if(pos>n) return 0;
    if(mp[pos]!=-1) return mp[pos];
    ll l1=dp[pos]+t1;
    ll k1=upper_bound(dp+pos+1,dp+n+1,l1)-dp;
    ll r1=t1+judge(k1);
    ll l2=dp[pos]+t2;
    ll k2=upper_bound(dp+pos+1,dp+n+1,l2)-dp;
    ll r2=t2+judge(k2);
    return mp[pos]=min(r1,r2);
}

void solve(){
    cin>>n>>c>>t1>>t2;
    for(ll i=1;i<=n;i++) cin>>dp[i];
    ll res=2*c;
    for(ll i=1;i<=n;i++){
        mem(mp,-1);
        ll ans=judge(1);
        res=min(res,ans);
        dp[i]+=c;
        sort(dp+1,dp+1+n);
    }
    cout<<res<<endl;
}

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