oj.uz

Submission #239668

# Submission time Handle Problem Language Result Execution time Memory
239668 2020-06-17T06:44:08 Z Vimmer Timovi (COCI18_timovi) C++14
70 / 80
 1000 ms 3064 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;


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, m, k;

    cin >> n >> k >> m;

    ll a[n];

    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++;
    }

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

Subtask #1
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 19 ms 2304 KB Output is correct
4 Correct 20 ms 2304 KB Output is correct
5 Correct 933 ms 376 KB Output is correct
6 Execution timed out 1092 ms 384 KB Time limit exceeded
7 Correct 543 ms 2936 KB Output is correct
8 Correct 725 ms 3064 KB Output is correct