이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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... |