Submission #1688691


Source Code Expand

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    unsigned long long K;
    cin >> K;

    long long N = 50;
    vector<long long> numVec;

    for (int i = 0; i < N; i++)
    {
        numVec.push_back(i);
    }

    for (int count = 0; count < K; count++)
    {
        for (int i = 0; i < N; i++)
        {
            if (i == count)
            {
                numVec[i] += N;
            }
            else
            {
                numVec[i]--;
            }
        }
    }

    cout << N << endl;

    for (int i = 0; i < N; i++)
    {
        if (i)
            cout << " ";
        cout << numVec[i];
    }

    cout << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Decrease (Contestant ver.)
User TKD
Language C++14 (GCC 5.4.1)
Score 0
Code Size 730 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 4
TLE × 1
AC × 9
TLE × 16
Set Name Test Cases
Sample example0, example1, example2, example3, example4
All corner0, corner1, corner2, corner3, corner4, corner5, corner6, corner7, corner8, corner9, example0, example1, example2, example3, example4, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9
Case Name Status Exec Time Memory
corner0 AC 1 ms 256 KB
corner1 TLE 2103 ms 256 KB
corner2 AC 1 ms 256 KB
corner3 TLE 2103 ms 256 KB
corner4 AC 1 ms 256 KB
corner5 TLE 2103 ms 256 KB
corner6 AC 1 ms 256 KB
corner7 TLE 2103 ms 256 KB
corner8 AC 1 ms 256 KB
corner9 TLE 2103 ms 256 KB
example0 AC 1 ms 256 KB
example1 AC 1 ms 256 KB
example2 AC 1 ms 256 KB
example3 AC 1 ms 256 KB
example4 TLE 2103 ms 256 KB
rand0 TLE 2103 ms 256 KB
rand1 TLE 2103 ms 256 KB
rand2 TLE 2103 ms 256 KB
rand3 TLE 2103 ms 256 KB
rand4 TLE 2103 ms 256 KB
rand5 TLE 2103 ms 256 KB
rand6 TLE 2103 ms 256 KB
rand7 TLE 2103 ms 256 KB
rand8 TLE 2103 ms 256 KB
rand9 TLE 2103 ms 256 KB