Educational Codeforces Round 104 (Rated for Div. 2) A-E 题解

最新推荐文章于 2024-07-05 17:32:57 发布

ljq真的不能再吃了

最新推荐文章于 2024-07-05 17:32:57 发布

阅读量207

点赞数

分类专栏： ACM Codeforces

本文链接：https://blog.csdn.net/heucodesong/article/details/114748103

版权

ACM 同时被 2 个专栏收录

455 篇文章 0 订阅

订阅专栏

Codeforces

71 篇文章 0 订阅

订阅专栏

A. Arena
介绍了一下博弈的规则我们发现只有从顺序第二个不同的数的人开始有机会获胜因为他可以不断找比自己积分少的人单挑

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;

#define ll long long
#define dbg(x) cout << #x << " = " << (x) << endl;
#define dbg2(x,y) cout << #x << " = " << (x) << " " << #y << " = " << (y) << endl;
#define dbg3(x,y,z) cout << #x << " = " << (x) << " " << #y << " = " << (y) << " " << #z << " = " << (z) << endl;
const int MAX_N = 105;
int arr[MAX_N];

int main()
{
    int t,n,minn = -1,ans = n+1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        ans = n+1;
        minn = -1;
        for(int i = 1;i<=n;++i)
        {
            scanf("%d",&arr[i]);
        }
        sort(arr+1,arr+1+n);
        for(int i = 1;i<=n;++i)
        {
            if(minn==-1) minn = arr[i];
            else if(minn==0x3f3f3f3f) continue;
            else if(arr[i]!=minn)
            {
                ans = i;
                minn = 0x3f3f3f3f;
            }
        }
        printf("%d\n",n-ans+1);
    }

    return 0;
}

B. Cat Cycle
手完一下发现如果 $n$ 是偶数两人一定不会相遇，否则在 $n / 2$ 步的时候 $B$ 一定会因为遇到 $A$ $+ 1 步$ ,所以我们要做的就是按照这个思路统计出 $B$ 的步数， $+ 1 步$ 的贡献在达到 $n$ 次后，就会形成一个循环节

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;

#define ll long long
#define dbg(x) cout << #x << " = " << (x) << endl;
#define dbg2(x,y) cout << #x << " = " << (x) << " " << #y << " = " << (y) << endl;
#define dbg3(x,y,z) cout << #x << " = " << (x) << " " << #y << " = " << (y) << " " << #z << " = " << (z) << endl;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll n,m,ans;
        scanf("%lld%lld",&n,&m);
        if(n%2==0)
        {
            if(m%n==0) ans = n;
            else ans = m%n;
        }
        else
        {
            m += (m-1)/(n/2);
            if(m%n==0) ans = n;
            else ans = m%n;
        }
        printf("%lld\n",ans);
    }

    return 0;
}

C. Minimum Ties
所有胜负都是 $0$ 平局当然是ok的但是答案想要 $0$ 最少
我们发现奇数的时候一定可以没平局构造出来
偶数的时候会多出 $s u m$ 个 $0$ 我们只要将 $i < = s u m 的 i 与 i + s u m$ 构造平局即可

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;

#define ll long long
#define dbg(x) cout << #x << " = " << (x) << endl;
#define dbg2(x,y) cout << #x << " = " << (x) << " " << #y << " = " << (y) << endl;
#define dbg3(x,y,z) cout << #x << " = " << (x) << " " << #y << " = " << (y) << " " << #z << " = " << (z) << endl;
const int MAX_N = 10025;
int ans[MAX_N],cnt[105],check[105];

int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        int len = 0;
        scanf("%d",&n);
        for(int i = 1;i<=n;++i)
        {
            cnt[i] = 0;
            check[i] = 0;
        }
        int ck = (n-1)*n/2/n;
        int sum = n*(n-1)/2 - ck * n;
        for(int i = 1;i<=n;++i)
        {
            for(int j = i+1;j<=n;++j)
            {
                if((n%2)==0&&(i<=sum)&&(j==i+sum))
                {
                    ans[++len] = 0;
                    check[i]++;
                    check[j]++;
                    continue;
                }
                if(cnt[i]<ck)
                {
                    ans[++len] = 1;
                    cnt[i]++;
                    check[i]+=3;
                }
                else if(cnt[j]<ck)
                {
                    ans[++len] = -1;
                    cnt[j]++;
                    check[j]+=3;
                }
                else
                {
                    dbg3(i,j,len);
                    ans[++len] = 0;
                    check[i]++;
                    check[j]++;
                }
            }
        }
        for(int i = 1;i<=len;++i)
        {
            i==len?printf("%d\n",ans[i]):printf("%d ",ans[i]);
        }
    }

    return 0;
}

D. Pythagorean Triples
数学题用下勾股定理和题意给的
可以退出 $a^2 = 2*b+1 = b+c$
那么二分求答案即可因为 $a^2 =2b+1 < 2b+2 <2000000002$

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;

#define ll long long
#define dbg(x) cout << #x << " = " << (x) << endl;
#define dbg2(x,y) cout << #x << " = " << (x) << " " << #y << " = " << (y) << endl;
#define dbg3(x,y,z) cout << #x << " = " << (x) << " " << #y << " = " << (y) << " " << #z << " = " << (z) << endl;
const int MAX_N = 500250;

int ans[MAX_N],len = 0;


void init()
{
    for(ll i = 2;1ll*i*i<=2000000001;++i)
    {
        if(1ll*i*i>2000000001) break;
        if(1ll*i*i%2==1)
        {
            if(((i*i-1)/2)<=i) continue;
            ans[++len] = (i*i-1)/2+1;
        }
    }
}

int main()
{
    init();
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("%d\n",upper_bound(ans+1,ans+1+len,1ll*n)-ans-1);
    }
    return 0;
}

E. Cheap Dinner
四种类型食物给你 $1 - 2 和 2 - 3 和 3 - 4$ 类食物互相不能共存的关系满足条件每个类型里选一种使得花费最小
我们发现如果暴力跑 $n * n$ 对于一种关系比较好做那么 $3$ 种关系就是 $* 3$ 可是会超时
如果我们每次对于 $i$ 食物关注 $i - 1$ 已经拼好的最小值我们只要 $i - 1$ 与自己可以共存且 $i - 1$ 方案值最小即可
容易想到用 $m u l t i s e t$ 去维护但是要注意这个时间复杂度只和边有关最差复杂度是 $m * l o g n$ 一开始自己想成了 $n * n * l o g n$ 绝对铁定会 $T$ 还是图论做少了以前都交给 $z l s$ 现在自己也要重新开始了

#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
const int MAX_N = 150025;
vector<int> vt[5][MAX_N];

#define ll long long
#define dbg(x) cout << #x << " = " << (x) << endl;
#define dbg2(x,y) cout << #x << " = " << (x) << " " << #y << " = " << (y) << endl;
#define dbg3(x,y,z) cout << #x << " = " << (x) << " " << #y << " = " << (y) << " " << #z << " = " << (z) << endl;
int N[5],arr[5][MAX_N];
ll dp[5][MAX_N];

void solve(ll dpLast[MAX_N],ll dpNow[MAX_N],int arrNow[MAX_N],int numLast,int num,vector<int> *Vt)
{
    multiset<ll> st;
    for(int i = 1;i<=num;++i) dpNow[i] = -1;
    for(int j = 1;j<=numLast;++j) if(dpLast[j]!=-1) st.insert(dpLast[j]);
    for(int i = 1;i<=num;++i)
    {
        for(auto v:Vt[i]) if(dpLast[v]!=-1) st.erase(st.find(dpLast[v]));
        if(st.empty()) dpNow[i] = -1;
        else dpNow[i] = arrNow[i] + (*st.begin());
        for(auto v:Vt[i]) if(dpLast[v]!=-1) st.insert(dpLast[v]);
    }
}
int main()
{
    int m,x,y;
    for(int i = 1;i<=4;++i) scanf("%d",&N[i]);
    for(int i = 1;i<=4;++i)
    {
        for(int j = 1;j<=N[i];++j)
        {
            scanf("%d",&arr[i][j]);
        }
    }
    for(int i = 1;i<=3;++i)
    {
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d",&x,&y);
            vt[i+1][y].push_back(x);
        }
    }
    for(int i = 1;i<=N[1];++i) dp[1][i] = arr[1][i];
    for(int i = 1;i<=3;++i) solve(dp[i],dp[i+1],arr[i+1],N[i],N[i+1],vt[i+1]);
    ll ans = 0x3f3f3f3f3f3f3f3f;
    for(int i = 1;i<=N[4];++i) if(dp[4][i]!=-1) ans = min(ans,dp[4][i]);
    if(ans==0x3f3f3f3f3f3f3f3f) printf("-1\n");
    else printf("%lld\n",ans);
    return 0;
}

ljq真的不能再吃了

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Educational Codeforces Round 104 (Rated for Div. 2) A-E 题解

A. Arena介绍了一下博弈的规则我们发现只有从顺序第二个不同的数的人开始有机会获胜因为他可以不断找比自己积分少的人单挑#include<cstdio>#include<iostream>#include<vector>#include<map>#include<set>#include<stack>#include<algorithm>#include<cstring>#includ
复制链接

扫一扫

专栏目录