Educational Codeforces Round 109 (Rated for Div. 2) 题解

A - Potion-making

题目链接

答案

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

void solve(){
    int t;
    cin>>t;
    while(t--){
        int k;
        cin>>k;
        int n=100-k;
        if(k==100||!k) cout<<"1"<<endl;
        else{
            int g=__gcd(n,k);
            cout<<100/g<<endl;
        }
    }
}

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

B - Permutation Sort

题目链接

答案

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

int dp[N];

void solve(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        bool flag=0;
        for(int i=1;i<=n;i++){
            cin>>dp[i];
            if(dp[i]!=i) flag=1;
        }
        if(!flag){
            cout << "0" << endl;
            continue;
        }
        if (dp[1] == 1 || dp[n] == n) {
            cout << "1" << endl;
            continue;
        }
        if (dp[1] == n && dp[n] == 1) {
            cout << "3" << endl;
            continue;
        } else {
            cout << "2" << endl;
            continue;
        }
    }
}

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

D - Armchairs

题目链接

答案

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

int vis0[M];
int vis1[M];
int dp[M][M];

void solve(){
    // int t;
    // cin>>t;
    // while(t--){
        int n;
        cin>>n;
        int sum0=0;
        int sum1=0;
        for(int i=1;i<=n;i++){
            int k;
            cin>>k;
            if(k==1) vis1[++sum1]=i;
            else vis0[++sum0]=i;
        }
        mem(dp,inf);
        for(int i=0;i<=sum0;i++) dp[0][i]=0;
        for(int i=1;i<=sum1;i++){
            for(int j=1;j<=sum0;j++){
                dp[i][j]=min(dp[i][j-1],dp[i-1][j-1]+abs(vis1[i]-vis0[j]));
            }
        }
        cout<<dp[sum1][sum0]<<endl;
    // }
}

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