This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int maxn = 2e5 + 5;
const int oo = 1e9 + 7;
const ll inf = 1e18;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int n;
    cin >> n;
    vector<int> s(3, 0);
    map<string, char> mp;
    mp["section"] = 0, mp["subsection"] = 1, mp["subsubsection"] = 2;
    for (int i = 1; i <= n; i++) {
        string t, c;
        cin >> t >> c;
        s[mp[t]]++;
        if (t == "section")
            cout << s[mp["section"]] << ' ' << c << '\n', s[1] = s[2] = 0;
        else if (t == "subsection")
            cout << s[mp["section"]] << '.' << s[mp["subsection"]] << ' ' << c << '\n', s[2] = 0;
        else 
            cout << s[mp["section"]] << '.' << s[mp["subsection"]] << '.' << s[mp["subsubsection"]] << ' ' << c << '\n';
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |