Submission #1005296


Source Code Expand

//ビームサーチ
#include <iostream>
#include <vector>
#include <queue>
#include <cstdlib>
#include <string>
#include <algorithm>
#define int long long
using namespace std;

int n;
int a[20000];
int power[17];

void randomSuffle() {
	static bool used[20000] = {false};
	static int b[20000];
	int t;
	
	for (int i = 0; i < n; i++) {
		do {
			t = rand() % n;
		} while (used[t]);
		
		used[t] = true;
		b[i] = a[t];
	}
	for (int i = 0; i < n; i++) {
		a[i] = b[i];
	}
}

//a < b (aをbより優先したい)ならtrueを返す。
bool compare(int &a, int &b) {
	for (int i = 0; i < 17; i++) {
		int a_cnt = (a / power[i]) % 10;
		int b_cnt = (b / power[i]) % 10;
		if (a_cnt != b_cnt) { return a_cnt > b_cnt; }
	}
	
	int a_sum = 0, b_sum = 0;
	for (int i = 0; i < 17; i++) {
		a_sum += (a / power[i]) % 10;
		b_sum += (b / power[i]) % 10;
	}
	return a_sum > b_sum;
}

signed main() {
	int i, j;
	
	power[0] = 1;
	for (i = 1; i < 17; i++) { power[i] = power[i - 1] * 10; }
	
	cin >> n;
	for (i = 0; i < n; i++) { cin >> a[i]; }
	randomSuffle();

	//ビームサーチ(商品1から順に選ぶ, 選ばない, をする)
	//{1円硬貨の枚数, 10円硬貨の枚数, …}を辞書順降順に並べて、width個だけ採用。
	//状態は:「金額」で持てばよい。
	
	const int WIDTH = 10;
	static vector<int> states[2];
	
	states[0].push_back(0);
	for (i = 0; i < n; i++) {
		for (j = 0; j < states[0].size(); j++) {
			states[1].push_back(states[0][j]);
			states[1].push_back(states[0][j] + a[i]);
		}
		
		sort(states[1].begin(), states[1].end(), compare);
		states[0].clear();
		for (j = 0; j < min((int)states[1].size(), WIDTH); j++) states[0].push_back(states[1][j]);
		states[1].clear();
	}
	
	int ans = 0;
	for (i = 0; i < 17; i++) {
		int max_cnt = 0;
		for (j = 0; j < states[0].size(); j++) {
			max_cnt = max(max_cnt, (states[0][j] / power[i]) % 10);
		}
		ans += max_cnt;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Exact Payment
User startcpp
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2025 Byte
Status WA
Exec Time 774 ms
Memory 640 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 1
WA × 1
AC × 4
WA × 96
Set Name Test Cases
sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 01-47.txt, 01-48.txt, 01-49.txt, 01-50.txt, 01-51.txt, 01-52.txt, 01-53.txt, 01-54.txt, 01-55.txt, 01-56.txt, 01-57.txt, 01-58.txt, 01-59.txt, 01-60.txt, 01-61.txt, 01-62.txt, 01-63.txt, 01-64.txt, 01-65.txt, 01-66.txt, 01-67.txt, 01-68.txt, 01-69.txt, 01-70.txt, 01-71.txt, 01-72.txt, 01-73.txt, 01-74.txt, 01-75.txt, 01-76.txt, 01-77.txt, 01-78.txt, 01-79.txt, 01-80.txt, 01-81.txt, 01-82.txt, 01-83.txt, 01-84.txt, 01-85.txt, 01-86.txt, 01-87.txt, 01-88.txt, 01-89.txt, 01-90.txt, 01-91.txt, 01-92.txt, 01-93.txt, 01-94.txt, 01-95.txt, 01-96.txt, 01-97.txt, 01-98.txt
Case Name Status Exec Time Memory
01-01.txt AC 3 ms 256 KB
01-02.txt AC 3 ms 256 KB
01-03.txt AC 3 ms 256 KB
01-04.txt WA 3 ms 256 KB
01-05.txt WA 3 ms 256 KB
01-06.txt WA 188 ms 512 KB
01-07.txt WA 199 ms 512 KB
01-08.txt WA 219 ms 512 KB
01-09.txt WA 245 ms 512 KB
01-10.txt WA 379 ms 512 KB
01-11.txt WA 347 ms 512 KB
01-12.txt WA 232 ms 512 KB
01-13.txt WA 247 ms 512 KB
01-14.txt WA 194 ms 512 KB
01-15.txt WA 200 ms 512 KB
01-16.txt WA 248 ms 512 KB
01-17.txt WA 305 ms 512 KB
01-18.txt WA 187 ms 512 KB
01-19.txt WA 299 ms 512 KB
01-20.txt WA 191 ms 512 KB
01-21.txt WA 180 ms 512 KB
01-22.txt WA 180 ms 512 KB
01-23.txt WA 170 ms 512 KB
01-24.txt WA 183 ms 512 KB
01-25.txt WA 188 ms 512 KB
01-26.txt WA 191 ms 512 KB
01-27.txt WA 199 ms 512 KB
01-28.txt WA 182 ms 512 KB
01-29.txt WA 197 ms 512 KB
01-30.txt WA 211 ms 512 KB
01-31.txt WA 210 ms 512 KB
01-32.txt WA 191 ms 512 KB
01-33.txt WA 184 ms 512 KB
01-34.txt WA 183 ms 512 KB
01-35.txt WA 208 ms 512 KB
01-36.txt WA 182 ms 512 KB
01-37.txt WA 173 ms 512 KB
01-38.txt WA 238 ms 512 KB
01-39.txt WA 254 ms 512 KB
01-40.txt WA 245 ms 512 KB
01-41.txt WA 192 ms 512 KB
01-42.txt WA 188 ms 512 KB
01-43.txt WA 212 ms 512 KB
01-44.txt WA 552 ms 512 KB
01-45.txt WA 533 ms 512 KB
01-46.txt WA 197 ms 512 KB
01-47.txt WA 195 ms 512 KB
01-48.txt WA 174 ms 512 KB
01-49.txt WA 209 ms 512 KB
01-50.txt WA 194 ms 512 KB
01-51.txt WA 181 ms 512 KB
01-52.txt WA 189 ms 512 KB
01-53.txt WA 192 ms 512 KB
01-54.txt WA 192 ms 512 KB
01-55.txt WA 195 ms 512 KB
01-56.txt WA 222 ms 512 KB
01-57.txt WA 189 ms 512 KB
01-58.txt WA 169 ms 512 KB
01-59.txt WA 185 ms 512 KB
01-60.txt WA 193 ms 512 KB
01-61.txt WA 201 ms 512 KB
01-62.txt WA 168 ms 512 KB
01-63.txt WA 189 ms 512 KB
01-64.txt WA 195 ms 512 KB
01-65.txt WA 192 ms 512 KB
01-66.txt WA 774 ms 512 KB
01-67.txt WA 551 ms 512 KB
01-68.txt WA 485 ms 640 KB
01-69.txt WA 599 ms 512 KB
01-70.txt WA 554 ms 512 KB
01-71.txt WA 692 ms 512 KB
01-72.txt WA 660 ms 512 KB
01-73.txt WA 697 ms 512 KB
01-74.txt WA 711 ms 512 KB
01-75.txt WA 672 ms 512 KB
01-76.txt WA 658 ms 512 KB
01-77.txt WA 515 ms 640 KB
01-78.txt WA 665 ms 512 KB
01-79.txt WA 679 ms 512 KB
01-80.txt WA 683 ms 512 KB
01-81.txt WA 650 ms 512 KB
01-82.txt WA 718 ms 512 KB
01-83.txt WA 696 ms 512 KB
01-84.txt WA 723 ms 512 KB
01-85.txt WA 691 ms 512 KB
01-86.txt WA 628 ms 512 KB
01-87.txt WA 640 ms 512 KB
01-88.txt WA 695 ms 512 KB
01-89.txt WA 664 ms 512 KB
01-90.txt WA 621 ms 512 KB
01-91.txt WA 750 ms 512 KB
01-92.txt WA 693 ms 512 KB
01-93.txt WA 757 ms 512 KB
01-94.txt WA 691 ms 512 KB
01-95.txt WA 587 ms 512 KB
01-96.txt WA 591 ms 512 KB
01-97.txt WA 653 ms 512 KB
01-98.txt WA 676 ms 512 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt WA 3 ms 256 KB