Submission #989146

#TimeUsernameProblemLanguageResultExecution timeMemory
989146AlphaMale06Council (JOI23_council)C++17
16 / 100
4097 ms13280 KiB
#include <bits/stdc++.h> using namespace std; const int N = 300001; const int M = 20; const int to = 1024; int a[N], sum[M], ans[N], mn[N], masks[N]; int dp[to][to], ppcnt[to][to]; void smin(int & x, int y){ if(x>y)x=y; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; for(int i=0; i< n; i++){ for(int j=0; j< m; j++){ int x; cin >> x; a[i]+=x<<j; sum[j]+=x; } } for(int i=0; i< n; i++)mn[i]=1e9; for(int i=0; i< n; i++){ for(int j=0; j< m; j++)sum[j]-=(a[i] & (1<<j))>>j; for(int j=0; j< m; j++){ if(sum[j]>=n/2)ans[i]++; if(sum[j]==n/2)masks[i]+=1<<j; } for(int j=0; j< m; j++)sum[j]+=(a[i] & (1<<j))>>j; } for(int i=0; i< (1<<M); ++i){ int f = i>>10; int s = i%1024; dp[f][s]=1e9; ppcnt[f][s]=__builtin_popcount(f & s); } for(int i=0; i< n-1; ++i){ short f = a[i]>>10; short s = a[i]%1024; for(short j = 0; j<to; ++j){ smin(dp[j][s], ppcnt[j][f]); } f = masks[i+1]>>10; s = masks[i+1]%1024; for(short j=0; j<to; ++j){ smin(mn[i+1], dp[f][j]+ppcnt[s][j]); } } for(int i=0; i< (1<<M); ++i)dp[i>>10][i%1024]=1e9; for(int i=n-1; i>0; i--){ short f = a[i]>>10; short s = a[i]%1024; for(short j = 0; j<to; ++j){ smin(dp[j][s], ppcnt[j][f]); } f = masks[i-1]>>10; s = masks[i-1]%1024; for(short j=0; j<to; ++j){ smin(mn[i-1], dp[f][j]+ppcnt[s][j]); } } for(int i=0; i< n; i++){ cout << ans[i]-mn[i] << '\n'; } }
#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...