Submission #497672

# Submission time Handle Problem Language Result Execution time Memory
497672 2021-12-23T14:06:37 Z hgmhc Kaučuk (COCI21_kaucuk) C++17
50 / 50
1 ms 316 KB
#include <bits/stdc++.h>
#define REP(i,a,b) for (auto i = (a); i <= (b); ++i)
#define debug(x) cerr << #x << " is " << x << endl
#define el '\n'
using namespace std; using ll = long long;

const int N = 103;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    pair<int,pair<int,int>> x {0,{0,0}};
    REP(i,1,n) {
        string command, q;
        cin >> command >> q;
        if (command == "section") {
            cout << ++x.first << ' ' << q << el;
            x.second = {0,0};
        } else if (command == "subsection") {
            cout << x.first << '.' << ++(x.second.first) << ' ' << q << el;
            x.second.second = 0;
        } else {
            cout << x.first << '.' << x.second.first << '.' << ++(x.second.second) << ' ' << q << el;
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 312 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 308 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct