oj.uz

답안 #239672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239672 2020-06-17T07:03:41 Z Vimmer Timovi (COCI18_timovi) C++14
80 / 80
 21 ms 2944 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


ll calc(ll n, ll k, ll x) {return (n - 1) * k * x + n * k;}

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    ll n, k, m;

    cin >> n >> k >> m;

    ll a[n];

    if (m / k <= 200000)
    {
        memset(a, 0, sizeof(a));

        int i = -1;

        while (m > 0)
        {
            while (m > 0 && i < n)
            {
                i++;

                if (i == n) continue;

                if (m >= k)
                {
                    m -= k;

                    a[i] += k;
                } else {a[i] += m; m = 0;}
            }

            i--;

            while (m > 0 && i >= 0)
            {
                i--;

                if (i == -1) continue;

                if (m >= k)
                {
                    m -= k;

                    a[i] += k;
                } else {a[i] += m; m = 0;}
            }

            i++;
        }
    }
    else
    {

    ll l = 0, r = m;

    while (l + 1 < r)
    {
        ll md = (l + r) >> 1;

        if (m >= calc(n, k, md)) l = md; else r = md;
    }

    while (calc(n, k, l + 1) <= m) l++;

    while (calc(n, k, l) > m) l--;

    if (l == -1)
    {
        for (int i = 0; i < n; i++)
        {
            if (m >= k)
            {
                a[i] = k;

                m -= k;
            }
            else
            {
                a[i] = m;

                m = 0;
            }
        }

        exit(0);
    }

    ll ost = m - calc(n, k, l);

    for (int i = 0; i < n; i++)
    {
       ll sum = k;

        if (i == 0) sum += ((l + 1) / 2) * k;
          else if (i == n - 1) sum += (l / 2) * k;
            else sum += l * k;

        a[i] = sum;
    }

    if (l % 2)
        for (int i = 1; i < n; i++)
        {
             if (ost >= k)
            {
                a[i] += k;

                ost -= k;
            }
            else
            {
                a[i] += ost;

                ost = 0;
            }
        }

    if (l % 2 == 0)
    {
        for (int i = n - 2; i >= 0; i--)
        {
             if (ost >= k)
            {
                a[i] += k;

                ost -= k;
            }
            else
            {
                a[i] += ost;

                ost = 0;
            }
        }
    }

    }
    for (int i = 0; i < n; i++) cout << a[i] << " ";

}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 18 ms 2304 KB Output is correct
4 Correct 19 ms 2304 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 21 ms 2944 KB Output is correct
8 Correct 21 ms 2944 KB Output is correct