oj.uz

Submission #867635

# Submission time Handle Problem Language Result Execution time Memory
867635 2023-10-29T02:50:21 Z JellyTheOctopus Subway (info1cup19_subway) C++17
100 / 100
 6 ms 1324 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

const int MOD = 1e9+7;

int K;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> K;
    vector<pair<int, int>> edges;
    edges.push_back({0, -1});
    int cnt = 1;
    int node = 0;
    while (K >= cnt) {
        K -= cnt;
        edges.push_back({node+1, node});
        node++;
        cnt++;
    }
    if (K) {
        edges.push_back({node+1, K-1});
    }
    cout << (int)edges.size() << "\n";
    for (auto [u, v]: edges) {
        cout << u << " " << v << "\n";
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 1024 KB Output is correct
16 Correct 6 ms 1324 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 6 ms 1244 KB Output is correct
19 Correct 5 ms 992 KB Output is correct
20 Correct 4 ms 992 KB Output is correct