oj.uz

Submission #171050

# Submission time Handle Problem Language Result Execution time Memory
171050 2019-12-27T08:33:11 Z MvC Popeala (CEOI16_popeala) C++11
17 / 100
 2000 ms 43288 KB 
#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;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 760 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3448 KB Output is correct
2 Correct 19 ms 3448 KB Output is correct
3 Correct 21 ms 3448 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 13592 KB Output is correct
2 Correct 1360 ms 23672 KB Output is correct
3 Execution timed out 2069 ms 43288 KB Time limit exceeded

Subtask #4
0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 19 ms 3448 KB Output is correct
4 Correct 19 ms 3448 KB Output is correct
5 Correct 21 ms 3448 KB Output is correct
6 Correct 537 ms 13592 KB Output is correct
7 Correct 1360 ms 23672 KB Output is correct
8 Execution timed out 2069 ms 43288 KB Time limit exceeded