Submission #171050

#TimeUsernameProblemLanguageResultExecution timeMemory
171050MvCPopeala (CEOI16_popeala)C++11
17 / 100
2069 ms43288 KiB
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=2e4+50; const int mod=1e9+7; using namespace std; int n,t,s,i,j,a[nmax],nr[52][nmax],f[52][nmax],k,v[5050][5050]; char c; int cst(int l,int r) { int rs=0; for(int i=1;i<=n;i++) { if(nr[i][r]-nr[i][l-1]==r-l+1)rs+=a[r]-a[l-1]; } return rs; } int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); cin>>n>>t>>s; for(i=1;i<=t;i++)cin>>a[i],a[i]+=a[i-1]; for(i=1;i<=n;i++) { for(j=1;j<=t;j++) { cin>>c; nr[i][j]=nr[i][j-1]+(c=='1'); } } for(i=1;i<=t;i++) { for(j=i;j<=t;j++) { for(k=1;k<=n;k++)if(nr[k][j]-nr[k][i-1]==j-i+1)v[i][j]+=a[j]-a[i-1]; } } for(i=1;i<=t;i++)f[0][i]=2e9+5; for(i=1;i<=s;i++) { for(j=1;j<=t;j++) { f[i][j]=2e9+5; for(k=i-1;k<j;k++)f[i][j]=min(f[i][j],f[i-1][k]+v[k+1][j]); } cout<<f[i][t]<<'\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...