제출 #171048

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
171048		MvC	조교 (CEOI16_popeala)	C++11	17 / 100	2048 ms	1516 KiB

popeala

#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;
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;
}
void rec(int l,int r,int opl,int opr)
{
	if(l>r)return;
	int mid=(l+r)/2;
	f[k][mid]=2e9+5;
	pair<int,int>mn=mkp(2e9+5,0);
	for(int i=opl;i<=min(opr,mid);i++)
	{
		mn=min(mn,mkp(cst(i,mid)+f[k-1][i-1],i));
	}
	f[k][mid]=mn.fr;
	rec(l,mid-1,opl,mn.sc);
	rec(mid+1,r,mn.sc,opr);
}
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++)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]+cst(k+1,j));		
		}
		cout<<f[i][t]<<'\n';
	}
	/*for(i=1;i<=s;i++)
	{
		k++;
		rec(1,t,1,t);
		cout<<f[k][t]<<'\n';
	}*/
	return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 74