Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) D. Same Count One

Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) D. Same Count One

Considering that we need to make the number of 1 1 1s in each array the same, we should calculate the sum of 1 1 1s, and every array has s u m / n sum/n sum/n 1 1 1s. Because only the same position of two different arrays can be selected for exchange each time, for a position pos , we traverse each array each time. If the number of 1 1 1s in this array is not enough, then we need to turn some 0 0 0s into 1 1 1s; If the number of 1 1 1s in this array is more than we need, then some 1 1 1s should be turned into 0 0 0s. It can be proved that as long as the total number of 1 1 1s is a multiple of n, the number of 1 1 1s in each array can be made the same through exchange.

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int T;cin>>T;
    while(T--)
    {
        int n,m;cin>>n>>m;
        vector<vector<int>> a(n+1,vector<int>(m+1));
        multimap<int,int> b;
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            int res=0;
            for(int j=1;j<=m;j++)
            {
                cin>>a[i][j];
                res+=a[i][j];
                sum+=a[i][j];
            }
            b.insert({res,i});
        }
        if(sum%n!=0)
        {
            cout<<"-1"<<endl;
            continue;
        }
        vector<array<int,3>> cnt;
        while(1)
        {
            auto begin=b.begin();
            auto end=--b.end();

            if(begin->first==end->first) break;
            else
            {
                int bx=begin->first,by=begin->second;
                int ex=end->first,ey=end->second;

                for(int i=1;i<=m;i++)
                    if(!a[by][i] && a[ey][i])
                    {
                        swap(a[by][i],a[ey][i]);
                        cnt.push_back({by,ey,i});
                        break;
                    }
                b.erase(begin);
                b.erase(end);
                b.insert({bx+1,by});
                b.insert({ex-1,ey});
            }
        }
        cout<<cnt.size()<<endl;
        for(auto &[x,y,z]:cnt)
            cout<<x<<" "<<y<<" "<<z<<endl;
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Wa_Automata

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值