# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
818614 | 2023-08-10T05:45:51 Z | Sandarach151 | Kaučuk (COCI21_kaucuk) | C++17 | 1 ms | 300 KB |
#include <bits/stdc++.h> using namespace std; typedef string subsubsection; typedef pair<vector<subsubsection>, string> subsection; typedef pair<vector<subsection>, string> section; int main() { int n; cin >> n; vector<section> book; for(int i=0; i<n; i++){ string s, title; cin >> s >> title; if(s=="section"){ vector<subsection> temp; book.push_back({temp, title}); } else if(s=="subsection"){ vector<subsubsection> temp; book.back().first.push_back({temp, title}); } else{ book.back().first.back().first.push_back(title); } } for(int i=0; i<book.size(); i++){ cout << i+1 << " " << book[i].second << '\n'; for(int j=0; j<book[i].first.size(); j++){ cout << i+1 << "." << j+1 << " " << book[i].first[j].second << '\n'; for(int k=0; k<book[i].first[j].first.size(); k++){ cout << i+1 << "." << j+1 << "." << k+1 << ' ' << book[i].first[j].first[k] << '\n'; } } } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 300 KB | Output is correct |
6 | Correct | 0 ms | 296 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 300 KB | Output is correct |
6 | Correct | 0 ms | 296 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 300 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 0 ms | 212 KB | Output is correct |
16 | Correct | 1 ms | 300 KB | Output is correct |
17 | Correct | 0 ms | 212 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |