Submission #2627263


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

int N;
long long A[20009], p10[20];

void unify (vector < pair < long long, long long > > &v)
{
    vector < pair < long long, long long > > h = v;
    sort (h.begin (), h.end ()), v.clear ();
    long long l = -1, r = -1;
    for (int i=0; i<h.size (); i++)
        if (h[i].first > r)
        {
            if (i != 0) v.push_back ({l, r});
            l = h[i].first, r = h[i].second;
        }
        else
        if (h[i].second > r) r = h[i].second;
    v.push_back ({l, r});
}

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d", &N);
for (int i=1; i<=N; i++)
    scanf ("%lld", &A[i]);
p10[0] = 1;
for (int i=1; i<=18; i++)
    p10[i] = 10LL * p10[i - 1];
int ans = 0;
for (int pos = 0; pos < 17; pos ++)
    for (int target = 9; target >= 1; target --)
    {
        vector < pair < long long, long long > > v, h;
        v.push_back ({1LL * target * p10[pos], 1LL * target * p10[pos] + p10[pos] - 1});
        bool any = 0;
        for (int i=1; i<=N; i++)
        {
            long long curr = A[i] % p10[pos + 1];
            h = v;
            v.clear ();
            for (auto it : h)
            {
                v.push_back ({it.first, it.second});
                long long l = it.first - curr, r = it.second - curr;
                if (l <= 0 && r >= 0)
                {
                    any = 1;
                    break;
                }
                if (l < 0) l += p10[pos + 1], r += p10[pos + 1];
                v.push_back ({l, r});
            }
            if (any) break;
            unify (v);
        }
        if (any)
        {
            ans += target;
            break;
        }
    }
printf ("%d\n", ans);
return 0;
}

Submission Info

Submission Time
Task B - Exact Payment
User geniucos
Language C++14 (GCC 5.4.1)
Score 1500
Code Size 1829 Byte
Status AC
Exec Time 152 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 scanf ("%d", &N);
                 ^
./Main.cpp:31:26: 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 × 102
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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 16 ms 384 KB
01-07.txt AC 20 ms 384 KB
01-08.txt AC 23 ms 384 KB
01-09.txt AC 27 ms 384 KB
01-10.txt AC 66 ms 384 KB
01-11.txt AC 58 ms 384 KB
01-12.txt AC 20 ms 384 KB
01-13.txt AC 20 ms 384 KB
01-14.txt AC 16 ms 384 KB
01-15.txt AC 20 ms 384 KB
01-16.txt AC 30 ms 384 KB
01-17.txt AC 21 ms 384 KB
01-18.txt AC 21 ms 384 KB
01-19.txt AC 21 ms 384 KB
01-20.txt AC 21 ms 384 KB
01-21.txt AC 21 ms 384 KB
01-22.txt AC 21 ms 384 KB
01-23.txt AC 21 ms 384 KB
01-24.txt AC 24 ms 384 KB
01-25.txt AC 24 ms 384 KB
01-26.txt AC 21 ms 384 KB
01-27.txt AC 19 ms 384 KB
01-28.txt AC 16 ms 384 KB
01-29.txt AC 24 ms 384 KB
01-30.txt AC 20 ms 384 KB
01-31.txt AC 21 ms 384 KB
01-32.txt AC 24 ms 384 KB
01-33.txt AC 24 ms 384 KB
01-34.txt AC 21 ms 384 KB
01-35.txt AC 19 ms 384 KB
01-36.txt AC 24 ms 384 KB
01-37.txt AC 17 ms 384 KB
01-38.txt AC 21 ms 384 KB
01-39.txt AC 21 ms 384 KB
01-40.txt AC 21 ms 384 KB
01-41.txt AC 21 ms 384 KB
01-42.txt AC 21 ms 384 KB
01-43.txt AC 21 ms 384 KB
01-44.txt AC 16 ms 384 KB
01-45.txt AC 17 ms 384 KB
01-46.txt AC 16 ms 384 KB
01-47.txt AC 16 ms 384 KB
01-48.txt AC 16 ms 384 KB
01-49.txt AC 16 ms 384 KB
01-50.txt AC 16 ms 384 KB
01-51.txt AC 15 ms 384 KB
01-52.txt AC 16 ms 384 KB
01-53.txt AC 16 ms 384 KB
01-54.txt AC 15 ms 384 KB
01-55.txt AC 16 ms 384 KB
01-56.txt AC 16 ms 384 KB
01-57.txt AC 16 ms 384 KB
01-58.txt AC 16 ms 384 KB
01-59.txt AC 16 ms 384 KB
01-60.txt AC 16 ms 384 KB
01-61.txt AC 16 ms 384 KB
01-62.txt AC 16 ms 384 KB
01-63.txt AC 16 ms 384 KB
01-64.txt AC 16 ms 384 KB
01-65.txt AC 16 ms 384 KB
01-66.txt AC 152 ms 384 KB
01-67.txt AC 45 ms 384 KB
01-68.txt AC 32 ms 384 KB
01-69.txt AC 33 ms 384 KB
01-70.txt AC 29 ms 384 KB
01-71.txt AC 87 ms 384 KB
01-72.txt AC 92 ms 384 KB
01-73.txt AC 93 ms 384 KB
01-74.txt AC 109 ms 384 KB
01-75.txt AC 114 ms 384 KB
01-76.txt AC 130 ms 384 KB
01-77.txt AC 30 ms 384 KB
01-78.txt AC 88 ms 384 KB
01-79.txt AC 77 ms 384 KB
01-80.txt AC 84 ms 384 KB
01-81.txt AC 78 ms 384 KB
01-82.txt AC 79 ms 384 KB
01-83.txt AC 97 ms 384 KB
01-84.txt AC 100 ms 384 KB
01-85.txt AC 93 ms 384 KB
01-86.txt AC 98 ms 384 KB
01-87.txt AC 102 ms 384 KB
01-88.txt AC 101 ms 384 KB
01-89.txt AC 102 ms 384 KB
01-90.txt AC 22 ms 384 KB
01-91.txt AC 71 ms 384 KB
01-92.txt AC 88 ms 384 KB
01-93.txt AC 83 ms 384 KB
01-94.txt AC 78 ms 384 KB
01-95.txt AC 82 ms 384 KB
01-96.txt AC 21 ms 384 KB
01-97.txt AC 71 ms 384 KB
01-98.txt AC 78 ms 384 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB