Submission #483749

#	Time	Username	Problem	Language	Result	Execution time	Memory
483749		NhatMinh0208	Popeala (CEOI16_popeala)	C++14	100 / 100	356 ms	17860 KiB

popeala

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
ll n,m,i,j,ii,jj,k,t,t1,u,v,a,b;
ll dp[20001][51];
ll fail[20001][51];
ll sc[20001];
ll ps[20001];
ll ls[51];
ll mn[51];
ll cnt[20001];
int main()
{
	fio;
	char c;
	cin>>m>>n>>k;
	for (i=1;i<=n;i++) {
		cin>>sc[i];
		ps[i]=ps[i-1]+sc[i];
	}
	for (i=1;i<=m;i++) {
		for (j=1;j<=n;j++) {
			cin>>c;
			fail[j][i]=c-48;
		}
	}
	a=1e18;
	for (i=0;i<n;i++) dp[i][0]=1e18;
	for (i=1;i<=k;i++) dp[n][i]=1e18;
	for (j=1;j<=k;j++) {
		for (i=0;i<=m;i++) {
			mn[i]=1e18;
			ls[i]=n+1;
		}
		for (i=n;i>=1;i--) {
			cnt[i]=m;
			mn[m]=min(mn[m],dp[i][j-1]+m*ps[i]);
			for (ii=1;ii<=m;ii++) if (fail[i][ii]==0) {
				for (jj=i;jj<ls[ii];jj++) {
					cnt[jj]--;
					mn[cnt[jj]]=min(mn[cnt[jj]],dp[jj][j-1]+cnt[jj]*ps[jj]);
				}
				ls[ii]=i;
			}
			dp[i-1][j]=1e18;
			for (ii=0;ii<=m;ii++) dp[i-1][j]=min(dp[i-1][j],mn[ii]-ps[i-1]*ii);
			// cout<<dp[i][j]<<"-"<<ls[2]<<' ';
		}
		cout<<dp[0][j]<<endl;
	}
}
// N;

Compilation message (stderr)

popeala.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

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