oj.uz

Submission #690913

# Submission time Handle Problem Language Result Execution time Memory
690913 2023-01-30T16:06:17 Z andrei_iorgulescu Subway (info1cup19_subway) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;

int k,n,t[100005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> k;
    while (k != 0)
    {
        n++;
        if (n == 1)
            t[n - 1] = -1;
        else
        {
            k -= (n - 1);
            if (k >= 0)
                t[n - 1] = n - 2;
            else
            {
                k += (n - 1);
                t[n - 1] = k;
                k = 0;
            }
        }
    }
    if (n > 0)
    {
        cout << n << '\n';
        for (int i = 0; i < n; i++)
            cout << i << ' ' << t[i] << '\n';
    }
    else
    {
        cout << 1 << '\n' << 0 << ' ' << -1;
    }
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB wrong number of pairs
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB wrong number of pairs
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB wrong number of pairs
4 Halted 0 ms 0 KB -