Submission #995704


Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;

#ifdef LOCAL
	#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
	#define eprintf(...) 42
#endif

typedef long long int int64;

const int N = (int) 2e4 + 100;
long long a[N], b[N];

vector <pair <long long, long long> > v, nv;

int main(int,  char **)
{
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif


	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%lld", &a[i] );

	int ans = 0;
	long long x = 1;
	for (int it = 0; it < 18; it++)
	{
		long long x10 = x * 10;
		for (int i = 0; i < n; i++)
			b[i] = a[i] % x10;
	
		bool win = false;
		for (int d = 9; d >= 0; d--)
		{
			v.clear();
			v.emplace_back(x * d, x * (d + 1) - 1);
			if (d == 0) win = true;
			for (int i = 0; i < n && !win; i++)
			{
				nv.clear();
				for (auto p : v)
				{
					long long l = p.first - b[i], r = p.second - b[i];
					if (l < 0 && r >= 0)
					{
						win = true;
						break;
					}
					if (l < 0 && r < 0)
					{
						l += 10 * x;
						r += 10 * x;
					}
					nv.emplace_back(l, r);
					if (l == 0)
					{
						win = true;
						break;
					}
				}
				if (win) break;
				for (auto p : nv)
					v.push_back(p);
				sort(v.begin(), v.end() );
				nv.clear();
				long long l = -1, r = -1;
				for (auto p : v)
				{
					if (p.first > r)
					{
						if (l != -1)
							nv.emplace_back(l, r);
						l = p.first;
						r = p.second;
					}
					r = max(r, p.second);
				}
				nv.emplace_back(l, r);
				v = nv;
				nv.clear();
			}
			if (win)
			{
				ans += d;
				break;
			}
		}

		x *= 10;
	}
	printf("%d\n", ans);


	return 0;
}

Submission Info

Submission Time
Task B - Exact Payment
User team132
Language C++14 (GCC 5.4.1)
Score 1500
Code Size 1931 Byte
Status AC
Exec Time 67 ms
Memory 640 KB

Compile Error

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

Judge Result

Set Name sample All
Score / Max Score 0 / 0 1500 / 1500
Status
AC × 2
AC × 100
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 AC 3 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 17 ms 512 KB
01-07.txt AC 20 ms 512 KB
01-08.txt AC 21 ms 512 KB
01-09.txt AC 22 ms 512 KB
01-10.txt AC 37 ms 512 KB
01-11.txt AC 34 ms 640 KB
01-12.txt AC 20 ms 512 KB
01-13.txt AC 20 ms 512 KB
01-14.txt AC 17 ms 512 KB
01-15.txt AC 20 ms 512 KB
01-16.txt AC 25 ms 512 KB
01-17.txt AC 20 ms 512 KB
01-18.txt AC 20 ms 512 KB
01-19.txt AC 20 ms 512 KB
01-20.txt AC 20 ms 512 KB
01-21.txt AC 20 ms 640 KB
01-22.txt AC 20 ms 512 KB
01-23.txt AC 20 ms 512 KB
01-24.txt AC 21 ms 512 KB
01-25.txt AC 22 ms 512 KB
01-26.txt AC 20 ms 512 KB
01-27.txt AC 19 ms 512 KB
01-28.txt AC 18 ms 512 KB
01-29.txt AC 21 ms 512 KB
01-30.txt AC 20 ms 512 KB
01-31.txt AC 20 ms 512 KB
01-32.txt AC 21 ms 512 KB
01-33.txt AC 21 ms 512 KB
01-34.txt AC 20 ms 512 KB
01-35.txt AC 19 ms 512 KB
01-36.txt AC 22 ms 512 KB
01-37.txt AC 18 ms 512 KB
01-38.txt AC 20 ms 512 KB
01-39.txt AC 20 ms 512 KB
01-40.txt AC 20 ms 640 KB
01-41.txt AC 20 ms 512 KB
01-42.txt AC 20 ms 512 KB
01-43.txt AC 20 ms 512 KB
01-44.txt AC 18 ms 512 KB
01-45.txt AC 18 ms 512 KB
01-46.txt AC 17 ms 512 KB
01-47.txt AC 17 ms 512 KB
01-48.txt AC 17 ms 512 KB
01-49.txt AC 17 ms 512 KB
01-50.txt AC 17 ms 512 KB
01-51.txt AC 17 ms 512 KB
01-52.txt AC 17 ms 512 KB
01-53.txt AC 17 ms 512 KB
01-54.txt AC 17 ms 512 KB
01-55.txt AC 17 ms 512 KB
01-56.txt AC 17 ms 512 KB
01-57.txt AC 17 ms 512 KB
01-58.txt AC 17 ms 640 KB
01-59.txt AC 17 ms 512 KB
01-60.txt AC 17 ms 512 KB
01-61.txt AC 17 ms 512 KB
01-62.txt AC 18 ms 512 KB
01-63.txt AC 17 ms 512 KB
01-64.txt AC 17 ms 512 KB
01-65.txt AC 17 ms 512 KB
01-66.txt AC 67 ms 512 KB
01-67.txt AC 30 ms 512 KB
01-68.txt AC 25 ms 512 KB
01-69.txt AC 26 ms 512 KB
01-70.txt AC 23 ms 512 KB
01-71.txt AC 46 ms 512 KB
01-72.txt AC 46 ms 512 KB
01-73.txt AC 48 ms 512 KB
01-74.txt AC 56 ms 640 KB
01-75.txt AC 55 ms 512 KB
01-76.txt AC 66 ms 512 KB
01-77.txt AC 24 ms 512 KB
01-78.txt AC 46 ms 640 KB
01-79.txt AC 40 ms 512 KB
01-80.txt AC 44 ms 512 KB
01-81.txt AC 41 ms 512 KB
01-82.txt AC 42 ms 512 KB
01-83.txt AC 50 ms 512 KB
01-84.txt AC 51 ms 512 KB
01-85.txt AC 50 ms 512 KB
01-86.txt AC 51 ms 512 KB
01-87.txt AC 54 ms 512 KB
01-88.txt AC 52 ms 512 KB
01-89.txt AC 51 ms 512 KB
01-90.txt AC 20 ms 512 KB
01-91.txt AC 38 ms 512 KB
01-92.txt AC 46 ms 512 KB
01-93.txt AC 44 ms 512 KB
01-94.txt AC 41 ms 512 KB
01-95.txt AC 43 ms 512 KB
01-96.txt AC 19 ms 512 KB
01-97.txt AC 38 ms 512 KB
01-98.txt AC 41 ms 512 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 3 ms 256 KB