SDUT 2021 Spring Individual Contest - D（2）(Kattis)

E - Secret Santa

题目链接

答案：

#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 = 1e4 + 10;
const int M = 111;
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(){
    ll n;
    cin>>n;
    if(n>10) n=10;
    for(int i=0;i<n;i++) dp[i]=i;
    int l=0;
    int r=0;
    do{
        for(int i=0;i<n;i++){
            if(dp[i]==i){
                r++;
                break;
            }
        }
        l++;
    }while(next_permutation(dp,dp+n));
    printf("%.8f\n",1.0*r/l);
}

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

F - Fridge

题目链接

答案：

#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 = 1e4 + 10;
const int M = 111;
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;

string s;
struct node{
    int sum;
    int num;
}dp[N];

bool cmp(node x,node y){
    if(x.sum<y.sum) return 1;
    else if(x.sum==y.sum&&x.num<y.num) return 1;
    return 0;
}

void solve(){
    cin>>s;
    for(int i=0;i<(int)s.size();i++){
        dp[s[i]-'0'].sum++;
        dp[s[i]-'0'].num=s[i]-'0';
    }
    for(int i=1;i<=9;i++){
        if(!dp[i].sum){
            cout<<i<<endl;
            return ;
        }
    }
    if(!dp[0].sum){
        cout<<10<<endl;
        return ;
    }
    sort(dp+1,dp+10,cmp);
    if(dp[0].sum<dp[1].sum){
        cout<<1;
        for(int i=0;i<=dp[0].sum;i++) cout<<0;
        cout<<endl;
    }
    else{
        for(int i=0;i<=dp[1].sum;i++) cout<<dp[1].num;
        cout<<endl;
    }
}

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

I - Grass Seed Inc.

题目链接

答案：

#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 = 1e4 + 10;
const int M = 111;
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(){
    double c;
    int n;
    cin>>c;
    cin>>n;
    double w,l;
    double tot=0;
    for(int i=1;i<=n;i++){
        cin>>w>>l;
        tot+=w*l*c;
    }
    printf("%.7f\n",tot);
}

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

L - Elegant Showroom

题目链接

答案：

#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 = 1e4 + 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 n,m;
int dxx,dyy;
char mp[M][M];
int vis[M][M];
int minn=INF;

struct node{
    int dist;
    int x;
    int y;
};

void BFS(){
    queue<node>que;
    node st;
    st.x=dxx;
    st.y=dyy;
    st.dist=1;
    que.push(st);
    mem(vis,INF);
    vis[st.x][st.y]=1;
    while(!que.empty()){
        node top=que.front();
        que.pop();
        if(top.x==1||top.x==n||top.y==1||top.y==m) minn=min(minn,top.dist);
        int xx;
        int yy;
        rep(i,0,3){
            xx=top.x+dx[i];
            yy=top.y+dy[i];
            if(xx<1||yy<1||xx>n||yy>m||mp[xx][yy]=='#') continue;
            if(mp[xx][yy]=='D') st.dist=top.dist;
            else st.dist=top.dist+1;
            if(vis[xx][yy]>st.dist){
                vis[xx][yy]=st.dist;
                st.x=xx;
                st.y=yy;
                que.push(st);
            }
        }
    }
    cout<<minn<<endl;
}

void solve(){
    cin>>n>>m;
    rep(i,1,n){
//        getchar();
        rep(j,1,m){
            cin>>mp[i][j];
        }
    }
    mem(vis,0);
    cin>>dxx>>dyy;
    BFS();
}

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