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

A - Fair Playoff

题目链接

答案

#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 x first
#define y second
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eb emplace_back
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];

inline void solve(){
    int t;
    cin>>t;
    while(t--){
        int n=4;
        for(int i=1;i<=n;i++){
            cin>>dp[i];
        }
        int maxl=-1;
        int maxr=-1;
        for(int i=1;i<=n/2;i++) maxl=max(maxl,dp[i]);
        for(int i=n/2+1;i<=n;i++) maxr=max(maxr,dp[i]);
        sort(dp+1,dp+1+n);
        int l=dp[n-1];
        int r=dp[n];
        if((l==maxl&&r==maxr)||(l==maxr&&r==maxl)) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}

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

B - Array Reodering

题目链接

答案

#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 x first
#define y second
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eb emplace_back
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;

vector<int>ji,ou,one;
int dp[N];

inline void solve(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int k;
        one.clear();
        ji.clear();
        ou.clear();
        for(int i=1;i<=n;i++){
            cin>>k;
            if(k==1) one.eb(k);
            else if(k&1) ji.eb(k);
            else ou.eb(k);
        }
        int pos=0;
        for(auto i:ou) dp[++pos]=i;
        for(auto i:ji) dp[++pos]=i;
        for(auto i:one) dp[++pos]=i;
        int res=0;
        for(int i=1;i<=pos;i++){
            for(int j=i+1;j<=pos;j++){
                if(__gcd(dp[i],2*dp[j])>1) res++;
            }
        }
        cout<<res<<endl;
    }
}

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

C - Unstable String

题目链接

答案

#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 x first
#define y second
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eb emplace_back
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;

inline void solve(){
    int t;
    cin>>t;
    while(t--){
        string s;
        cin>>s;
        int l,r;
        l=r=-1;
        ll res=0;
        for(int i=0;i<s.size();i++){
            if(s[i]!='?'){
                int p=i-s[i]+2+'0';
                if(p&1) r=i;
                else l=i;
            }
            res+=i-min(l,r);
        }
        cout<<res<<endl;
    }
}

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