Submission #1334665

#TimeUsernameProblemLanguageResultExecution timeMemory
1334665yc11Council (JOI23_council)C++20
16 / 100
4093 ms16856 KiB
#include<bits/stdc++.h>
using namespace std;

signed main(){
    int n,m;
    cin>>n>>m;
    vector<vector<int> > n1;
    n1.resize(n);
    vector<int> n2;
    n2.assign(m,0);
    for (int i = 0;i<n;i++){
        n1[i].resize(m);
        for (int j = 0;j<m;j++){
            cin>>n1[i][j];
            n2[j]+=n1[i][j];
        }
    }
    for (int i = 0;i<n;i++){
        int ans = 0;
        for (int j = 0;j<n;j++){
            int ans1 = 0;
            if (i==j) continue;
            for (int k = 0;k<m;k++){
                if (n2[k]-n1[i][k]-n1[j][k]>=(n)/2) ans1++;
            }
            ans = max(ans,ans1);
        }
        cout<<ans<<"\n";
    }
    return 0;
    }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...