Submission #1085959

#TimeUsernameProblemLanguageResultExecution timeMemory
1085959BananabreadCouncil (JOI23_council)C++17
16 / 100
4089 ms53272 KiB
#include<bits/stdc++.h> #define ll long long #define ntr "\n" #define mod (ll)(1e9+7) #define taskname "" #define frep freopen(taskname".inp","r",stdin); freopen(taskname".out","w",stdout); using namespace std; ll pref[300001]; ll arr[300001][21]; ll ans[300001]; ll n,m; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); //frep; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>arr[i][j]; } } for(int j=1;j<=m;j++){ for(int i=1;i<=n;i++){ pref[j]+=arr[i][j]; } } for(int i=1;i<=n;i++){ for(int j=i+1;j<=n;j++){ ll cnt=0; for(int u=1;u<=m;u++){ ll c=pref[u]-arr[i][u]-arr[j][u]; if(c>n/2-1) cnt++; } ans[i]=max(ans[i],cnt); ans[j]=max(ans[j],cnt); } } for(int i=1;i<=n;i++){ cout<<ans[i]<<ntr; } }
#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...