# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
781040 |
2023-07-12T16:18:43 Z |
cig32 |
Kaučuk (COCI21_kaucuk) |
C++17 |
|
1 ms |
304 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string prev = "no";
int s1 = 0, s2 = 0, s3 = 0;
while(n--) {
string a, b; cin >> a >> b;
if(a == prev) {
if(a == "section") s1++;
if(a == "subsection") s2++;
if(a == "subsubsection") s3++;
cout << s1;
if(s2) cout << "." << s2;
if(s3) cout << "." << s3;
cout << " " << b << "\n";
}
else {
if(a == "section") {
s2 = 0, s3 = 0;
s1++;
}
if(a == "subsection") {
s3 = 0;
s2++;
}
if(a == "subsubsection") {
s3++;
}
cout << s1;
if(s2) cout << "." << s2;
if(s3) cout << "." << s3;
cout << " " << b << "\n";
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
300 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
300 KB |
Output is correct |
2 |
Correct |
1 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
300 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
300 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
304 KB |
Output is correct |