Submission #68739970

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
#define endl '\n'
using db = double;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<string> a(n);
    vector<int> cnt(n);
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    for (int j = 0; j < m; ++j)
    {
        vector<int> c(2);
        for (int i = 0; i < n; ++i)
            c[a[i][j] - '0']++;
        if (c[0] == 0 || c[1] == 0)
            continue;
        int tar = 0;
        if (c[0] > c[1])
            tar = 1;
        for (int i = 0; i < n; ++i)
            if (a[i][j] - '0' == tar)
                cnt[i]++;
    }
    int mx = *max_element(cnt.begin(), cnt.end());
    for (int i = 0; i < n; ++i)
        if (cnt[i] == mx)
            cout << i + 1 << " ";
    return 0;
}

Submission Info

Judge Result