oj.uz

Submission #696259

# Submission time Handle Problem Language Result Execution time Memory
696259 2023-02-06T04:22:55 Z SanguineChameleon Vještica (COCI16_vjestica) C++17
160 / 160
 120 ms 940 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;
int cnt[20][26];
int com[(1 << 16) + 20];
int dp[(1 << 16) + 20];

void just_do_it() {
	fill_n(dp, (1 << 16) + 20, inf);
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		for (auto x: s) {
			cnt[i][x - 'a']++;
		}
		dp[(1 << i)] = s.size();
	}
	for (int i = 1; i < (1 << n); i++) {
		for (int k = 0; k < 26; k++) {
			int mi = inf;
			for (int j = 0; j < n; j++) {
				if ((i >> j) & 1) {
					mi = min(mi, cnt[j][k]);
				}
			}
			com[i] += mi;
		}
	}
	for (int i = 1; i < (1 << n); i++) {
		for (int j = (i - 1) & i; j > 0; j = (j - 1) & i) {
			dp[i] = min(dp[i], dp[j] + dp[i ^ j] - com[i]);
		}
	}
	cout << dp[(1 << n) - 1] + 1;
}

// END MAIN CODE

Compilation message

vjestica.cpp: In function 'void file_io(std::string, std::string)':
vjestica.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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
vjestica.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
160.0 / 160.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 98 ms 824 KB Output is correct
5 Correct 100 ms 848 KB Output is correct
6 Correct 118 ms 844 KB Output is correct
7 Correct 105 ms 940 KB Output is correct
8 Correct 120 ms 836 KB Output is correct
9 Correct 101 ms 928 KB Output is correct
10 Correct 113 ms 900 KB Output is correct