oj.uz

Submission #27892

# Submission time Handle Problem Language Result Execution time Memory
27892 2017-07-14T11:14:55 Z rondojim Popeala (CEOI16_popeala) C++14
100 / 100
 533 ms 33820 KB 
#include "bits/stdc++.h"
using namespace std;
#define prev sdkjflksd
 
int points[20010];
long long pref[20010];
 
int result[55][20010];
int prev[55][20010];
vector <int> v[20010];
 
long long dp[55][20010];
const long long inf = 1e16;
long long maxn[55][20010];
char s[20010];
 
int main(int argc, char const *argv[])
{
	int N, T, S;
	scanf("%d %d %d", &N, &T, &S);
 
	for(int i = 1; i <= T; i++) {
		scanf("%d", &points[i]);
		pref[i] = pref[i - 1] + points[i];
	}
	for(int i = 1; i <= N; i++) {
		scanf("%s", s);
		for(int j = 1; j <= T; j++) {
			result[i][j] = s[j-1] - '0';
		}
	} 
	for(int i = 1; i <= N; i++) {
		for(int j = 1; j <= T; j++) {
			if(result[i][j] == 1) {
				prev[i][j] = 1 + prev[i][j - 1];
			} else {
				prev[i][j] = 0;
			}
		}
	}
	for(int i = 1; i <= T; i++) {
		vector <int> h;
		for(int j = 1; j <= N; j++) {
			h.push_back(prev[j][i]);
		}
		sort(h.begin(), h.end());
		reverse(h.begin(), h.end());
		for(auto j : h) {
			v[i].push_back(i - j);
		}
		v[i].push_back(i);
	}
 
	dp[0][0] = 0;
	for(int i = 1; i <= T; i++) {
		dp[0][i] = inf;
	}
	for(int x = 0; x < (int) v[1].size(); x++) {
		maxn[x][0] = dp[0][0] - x * pref[0];
		for(int j = 1; j <= T; j++) {
			maxn[x][j] = min(maxn[x][j - 1], dp[0][j] - x * pref[j]);
		}
	}
	for(int i = 1; i <= S; i++) {
		dp[i][0] = inf;
		for(int j = 1; j <= T; j++) {
			dp[i][j] = inf;
			for(int x = 0; x < (int) v[j].size(); x++) {
				if(v[j][x] > 0) dp[i][j] = min(dp[i][j], maxn[x][v[j][x] - 1] + pref[j] * x);
			}
		}
		for(int x = 0; x < (int) v[i].size(); x++) {
			maxn[x][0] = dp[i][0] - x * pref[0];
			for(int j = 1; j <= T; j++) {
				maxn[x][j] = min(maxn[x][j - 1], dp[i][j] - x * pref[j]);
			}
		}
	}
	for(int i = 1; i <= S; i++) {
		printf("%lld\n", dp[i][T]);
	}
	return 0;
}

Compilation message

popeala.cpp: In function 'int main(int, const char**)':
popeala.cpp:20:31: 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:23:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &points[i]);
                          ^
popeala.cpp:27:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", s);
                 ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 28540 KB Output is correct
2 Correct 0 ms 28540 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 28672 KB Output is correct
2 Correct 9 ms 28672 KB Output is correct
3 Correct 6 ms 28672 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 29200 KB Output is correct
2 Correct 59 ms 29332 KB Output is correct
3 Correct 83 ms 29596 KB Output is correct

Subtask #4
74.0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 28540 KB Output is correct
2 Correct 0 ms 28540 KB Output is correct
3 Correct 9 ms 28672 KB Output is correct
4 Correct 9 ms 28672 KB Output is correct
5 Correct 6 ms 28672 KB Output is correct
6 Correct 39 ms 29200 KB Output is correct
7 Correct 59 ms 29332 KB Output is correct
8 Correct 83 ms 29596 KB Output is correct
9 Correct 133 ms 30256 KB Output is correct
10 Correct 196 ms 30784 KB Output is correct
11 Correct 416 ms 33820 KB Output is correct
12 Correct 453 ms 33820 KB Output is correct
13 Correct 533 ms 33820 KB Output is correct
14 Correct 489 ms 33820 KB Output is correct
15 Correct 466 ms 33820 KB Output is correct