Submission #2855890


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

long long dp[100][100];

long long solve2(vector<int>vec1, vector<int>vec2) {
	for (int i = 0; i <= vec1.size(); i++) { for (int j = 0; j <= vec2.size(); j++) dp[i][j] = 0; }
	dp[0][0] = 1;
	for (int i = 0; i < vec1.size(); i++) {
		for (int j = 0; j <= vec2.size(); j++) {
			dp[i + 1][j] += dp[i][j];
			for (int k = j; k < vec2.size(); k++) {
				if (vec1[i] == vec2[k]) dp[i + 1][k + 1] += dp[i][j];
				if (j == 0 && k == 0) break;
			}
		}
	}
	long long F = 0;
	for (int i = 1; i <= vec2.size(); i++) F += dp[vec1.size()][i];
	return F;
}

long long solve(vector<int>vec) {
	long long ret = 0;
	for (int i = 1; i < vec.size(); i++) {
		vector<int>vec1, vec2;
		for (int j = 0; j < i; j++) vec1.push_back(vec[j]);
		for (int j = i; j < vec.size(); j++) vec2.push_back(vec[j]);
		ret += solve2(vec1, vec2);
	}
	return ret;
}

vector<pair<long long, vector<int>>>vec;

void init() {
	for (int i = 1; i <= 40; i++) {
		vector<int>V;
		for (int j = 0; j < i; j++) V.push_back(j);
		long long ret = solve(V);
		vec.push_back(make_pair(ret, V));
	}
	for (int i = 1; i <= 55; i++) {
		for (int j = 0; j < 100; j++) {
			vector<int>V;
			for (int k = 0; k < i; k++) V.push_back(rand() % 2);
			long long ret = solve(V);
			vec.push_back(make_pair(ret, V));
		}
	}
	sort(vec.begin(), vec.end());
}

long long n;

int main() {
	init();
	cin >> n;
	int cnt = 0; vector<int>ans;
	while (n >= 1) {
		int pos = 0;
		for (int i = 0; i < vec.size(); i++) {
			if (vec[i].first <= n) pos = i;
		}
		vector<int>G = vec[pos].second;
		for (int i = 0; i < G.size(); i++) ans.push_back(cnt * 2 + G[i] + 1);
		n -= vec[pos].first;
		cnt++;
	}
	cout << ans.size() << endl;
	for (int i = 0; i < ans.size(); i++) { if (i)cout << " "; cout << ans[i]; } cout << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User E869120
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1913 Byte
Status AC
Exec Time 803 ms
Memory 1276 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 32
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 797 ms 1148 KB
00_example_02.txt AC 795 ms 1148 KB
01.txt AC 800 ms 1148 KB
02.txt AC 795 ms 1148 KB
03.txt AC 795 ms 1148 KB
04.txt AC 798 ms 1148 KB
05.txt AC 800 ms 1148 KB
06.txt AC 800 ms 1148 KB
07.txt AC 803 ms 1148 KB
08.txt AC 800 ms 1148 KB
09.txt AC 798 ms 1148 KB
10.txt AC 801 ms 1148 KB
11.txt AC 798 ms 1148 KB
12.txt AC 799 ms 1148 KB
13.txt AC 799 ms 1148 KB
14.txt AC 798 ms 1148 KB
15.txt AC 799 ms 1148 KB
16.txt AC 799 ms 1148 KB
17.txt AC 799 ms 1148 KB
18.txt AC 799 ms 1148 KB
19.txt AC 798 ms 1148 KB
20.txt AC 801 ms 1148 KB
21.txt AC 798 ms 1148 KB
22.txt AC 799 ms 1148 KB
23.txt AC 799 ms 1276 KB
24.txt AC 796 ms 1148 KB
25.txt AC 796 ms 1148 KB
26.txt AC 798 ms 1148 KB
27.txt AC 799 ms 1148 KB
28.txt AC 797 ms 1148 KB
29.txt AC 799 ms 1148 KB
30.txt AC 800 ms 1148 KB