oj.uz

Submission #1108749

# Submission time Handle Problem Language Result Execution time Memory
1108749 2024-11-05T01:36:41 Z huantran Kaučuk (COCI21_kaucuk) C++17
50 / 50
 1 ms 848 KB 
#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';
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 508 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct