oj.uz

Submission #696458

# Submission time Handle Problem Language Result Execution time Memory
696458 2023-02-06T14:26:55 Z SanguineChameleon Kas (COCI17_kas) C++17
100 / 100
 454 ms 407416 KB 
// BEGIN BOILERPLATE CODE

#include <bits/stdc++.h>
using namespace std;

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const int inf = 1e9 + 20;
const int lim = 1e5;
int a[520];
int dp[520][lim * 2 + 20];

void just_do_it() {
	fill_n(&dp[0][0], 520 * (lim * 2 + 20), inf);
	int n;
	cin >> n;
	int s = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		s += a[i];
	}
	dp[0][lim] = 0;
	for (int i = 0; i < n; i++) {
		for (int j = -lim; j <= lim; j++) {
			if (dp[i][j + lim] == inf) {
				continue;
			}
			dp[i + 1][j + lim] = min(dp[i + 1][j + lim], dp[i][j + lim] + a[i + 1]);
			dp[i + 1][j + a[i + 1] + lim] = min(dp[i + 1][j + a[i + 1] + lim], dp[i][j + lim]);
			dp[i + 1][j - a[i + 1] + lim] = min(dp[i + 1][j - a[i + 1] + lim], dp[i][j + lim]);
		}
	}
	cout << (s + dp[n][lim]) / 2;
}

// END MAIN CODE

Compilation message

kas.cpp: In function 'void file_io(std::string, std::string)':
kas.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
kas.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 407344 KB Output is correct
2 Correct 185 ms 407304 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 407296 KB Output is correct
2 Correct 182 ms 407296 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 407348 KB Output is correct
2 Correct 177 ms 407348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 407372 KB Output is correct
2 Correct 192 ms 407368 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 407328 KB Output is correct
2 Correct 175 ms 407380 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 407416 KB Output is correct
2 Correct 189 ms 407324 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 407336 KB Output is correct
2 Correct 200 ms 407276 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 407352 KB Output is correct
2 Correct 250 ms 407288 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 407364 KB Output is correct
2 Correct 279 ms 407344 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 407372 KB Output is correct
2 Correct 454 ms 407388 KB Output is correct