CODE FESTIVAL 2016 Exhibition(Parallel)

Submission #1070672

Source codeソースコード

#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>

#define mp make_pair
#define pb push_back


typedef long long ll;
typedef long double ld;

using namespace std;
vector<pair<ll, ll> > buf;

int opt(vector<pair<ll, ll> >& vv) {
	for (int i = 0; i < vv.size(); ++i)
		if (vv[i].second <= vv[i].first)
			return 1;
	sort(vv.begin(), vv.end());
	if (vv[0].first == 0)
		return 1;
	buf.clear();
	for (int i = 0; i < vv.size(); ++i) {
		if (!buf.empty() && buf.back().second >= vv[i].first)
			buf.back().second = max(buf.back().second, vv[i].second);
		else
			buf.push_back(vv[i]);
	}
	vv = buf;
	return 0;
}

int n;
ll a[120000];
vector<pair<ll, ll> > vv;

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i)
		scanf("%lld", a + i);
	ll now = 1;
	int ans = 0;
	for (int it = 0; it <= 16; ++it, now *= 10) {
		for (int k = 9; k >= 1; --k) {
			vv.clear();
			vv.push_back(make_pair(k * now, (k + 1) * now));
			int fl = 0;
			for (int i = 0; i < n; ++i) {
				ll x = a[i] % (10 * now);
				int sz = vv.size();
				for (int j = 0; j < sz; ++j) {
					ll l = vv[j].first - x;
					ll r = vv[j].second - x;
					if (l < 0)
						l += 10 * now;
					if (r <= 0)
						r += 10 * now;
					vv.push_back(make_pair(l, r));
				}
				if (opt(vv)) {
					fl = 1;
					break;
				}
			}
			if (fl) {
				ans += k;
			//	cerr << k << "\n";
				break;
			}
		}
	}
	cout << ans << "\n";
	return 0;
}


Submission

Task問題 B - Exact Payment
User nameユーザ名 LHiC
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1500
Source lengthソースコード長 1664 Byte
File nameファイル名
Exec time実行時間 90 ms
Memory usageメモリ使用量 384 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:50:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", a + i);
^

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt
All 1500 / 1500 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt AC 3 ms 256 KB
01-02.txt AC 2 ms 256 KB
01-03.txt AC 3 ms 256 KB
01-04.txt AC 3 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 12 ms 384 KB
01-07.txt AC 15 ms 384 KB
01-08.txt AC 17 ms 384 KB
01-09.txt AC 19 ms 384 KB
01-10.txt AC 41 ms 384 KB
01-11.txt AC 37 ms 384 KB
01-12.txt AC 15 ms 384 KB
01-13.txt AC 15 ms 384 KB
01-14.txt AC 12 ms 384 KB
01-15.txt AC 15 ms 384 KB
01-16.txt AC 21 ms 384 KB
01-17.txt AC 16 ms 384 KB
01-18.txt AC 16 ms 384 KB
01-19.txt AC 16 ms 384 KB
01-20.txt AC 16 ms 384 KB
01-21.txt AC 16 ms 384 KB
01-22.txt AC 15 ms 384 KB
01-23.txt AC 15 ms 384 KB
01-24.txt AC 18 ms 384 KB
01-25.txt AC 18 ms 384 KB
01-26.txt AC 16 ms 384 KB
01-27.txt AC 14 ms 384 KB
01-28.txt AC 12 ms 384 KB
01-29.txt AC 18 ms 384 KB
01-30.txt AC 15 ms 384 KB
01-31.txt AC 16 ms 384 KB
01-32.txt AC 17 ms 384 KB
01-33.txt AC 18 ms 384 KB
01-34.txt AC 15 ms 384 KB
01-35.txt AC 14 ms 384 KB
01-36.txt AC 18 ms 384 KB
01-37.txt AC 13 ms 384 KB
01-38.txt AC 15 ms 384 KB
01-39.txt AC 16 ms 384 KB
01-40.txt AC 16 ms 384 KB
01-41.txt AC 16 ms 384 KB
01-42.txt AC 15 ms 384 KB
01-43.txt AC 15 ms 384 KB
01-44.txt AC 12 ms 384 KB
01-45.txt AC 13 ms 384 KB
01-46.txt AC 12 ms 384 KB
01-47.txt AC 12 ms 384 KB
01-48.txt AC 12 ms 384 KB
01-49.txt AC 12 ms 384 KB
01-50.txt AC 12 ms 384 KB
01-51.txt AC 12 ms 384 KB
01-52.txt AC 12 ms 384 KB
01-53.txt AC 12 ms 384 KB
01-54.txt AC 12 ms 384 KB
01-55.txt AC 12 ms 384 KB
01-56.txt AC 12 ms 384 KB
01-57.txt AC 12 ms 384 KB
01-58.txt AC 12 ms 384 KB
01-59.txt AC 12 ms 384 KB
01-60.txt AC 12 ms 384 KB
01-61.txt AC 12 ms 384 KB
01-62.txt AC 12 ms 384 KB
01-63.txt AC 12 ms 384 KB
01-64.txt AC 12 ms 384 KB
01-65.txt AC 12 ms 384 KB
01-66.txt AC 90 ms 384 KB
01-67.txt AC 31 ms 384 KB
01-68.txt AC 23 ms 384 KB
01-69.txt AC 23 ms 384 KB
01-70.txt AC 20 ms 384 KB
01-71.txt AC 55 ms 384 KB
01-72.txt AC 56 ms 384 KB
01-73.txt AC 58 ms 384 KB
01-74.txt AC 67 ms 384 KB
01-75.txt AC 69 ms 384 KB
01-76.txt AC 78 ms 384 KB
01-77.txt AC 21 ms 384 KB
01-78.txt AC 55 ms 384 KB
01-79.txt AC 47 ms 384 KB
01-80.txt AC 52 ms 384 KB
01-81.txt AC 48 ms 384 KB
01-82.txt AC 49 ms 384 KB
01-83.txt AC 58 ms 384 KB
01-84.txt AC 62 ms 384 KB
01-85.txt AC 56 ms 384 KB
01-86.txt AC 61 ms 384 KB
01-87.txt AC 61 ms 384 KB
01-88.txt AC 63 ms 384 KB
01-89.txt AC 62 ms 384 KB
01-90.txt AC 16 ms 384 KB
01-91.txt AC 44 ms 384 KB
01-92.txt AC 55 ms 384 KB
01-93.txt AC 52 ms 384 KB
01-94.txt AC 48 ms 384 KB
01-95.txt AC 50 ms 384 KB
01-96.txt AC 15 ms 384 KB
01-97.txt AC 44 ms 384 KB
01-98.txt AC 48 ms 384 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 3 ms 256 KB