Submission #125004

#	Time	Username	Problem	Language	Result	Execution time	Memory
125004		eriksuenderhauf	Popeala (CEOI16_popeala)	C++11	8 / 100	4 ms	1016 KiB

popeala

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<ll,int,hash<ll>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 55;
const int MAXT = 2e4 + 5;
const double eps = 1e-9;
int a[MAXT], dp[2][MAXT];
int bitsm[MAXN][MAXT], mi[MAXN];
char str[MAXT];

int main() {
	int n, t, s;
	scanf("%d %d %d", &n, &t, &s);
	for (int i = 1; i <= t; i++) {
		ni(a[i]);
		a[i] += a[i-1];
	}
	for (int i = 0; i < n; i++) {
		scanf("%s", str);
		for (int j = 1; j <= t; j++) {
			if (str[j-1] == '1')
				bitsm[j][i] = bitsm[j-1][i];
			else
				bitsm[j][i] = j;
		}
	}
	for (int i = 1; i <= t; i++) {
		bitsm[i][n] = i;
		sort(bitsm[i], bitsm[i]+n+1);
	}
	mem(dp, 0x3f);
	dp[0][0] = 0;
	for (int i = 1; i <= s; i++) {
		mem(mi, 0x3f);
		mem(dp[i&1], 0x3f);
		for (int j = 1; j <= t; j++) {
			for (int k = 0; k <= n; k++) {
				for (int l = bitsm[j-1][k]; l < bitsm[j][k]; l++)
					mi[k] = min(mi[k], dp[(i&1)^1][l] - a[l] * k);
				dp[i&1][j] = min(dp[i&1][j], mi[k] + a[j] * k);
			}
		}
		printf("%d\n", dp[i&1][t]);
	}
    return 0;
}

Compilation message (stderr)

popeala.cpp: In function 'int main()':
popeala.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &t, &s);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
popeala.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
popeala.cpp:46:3: note: in expansion of macro 'ni'
   ni(a[i]);
   ^~
popeala.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", str);
   ~~~~~^~~~~~~~~~~

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