# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
499463 |
2021-12-28T13:08:16 Z |
Alisaf9 |
Kaučuk (COCI21_kaucuk) |
C++14 |
|
12 ms |
15948 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x=0,c=0,d=0,u;
string s[500000];
cin>>n;
u=n+1;
for(int i=0;i<n;i++)
{
cin>>s[i]>>s[u];
if(s[i]=="section")
{
x++;
cout<<x<<" "<<s[u]<<endl;
}
else if(s[i]=="subsection")
{
c++;
cout<<x<<"."<<c<<" "<<s[u]<<endl;
}
else if(s[i]=="subsubsection")
{
d++;
cout<<x<<"."<<c<<"."<<d<<" "<<s[u]<<endl;
}
u++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
15948 KB |
Output is correct |
2 |
Correct |
9 ms |
15820 KB |
Output is correct |
3 |
Correct |
9 ms |
15820 KB |
Output is correct |
4 |
Correct |
9 ms |
15820 KB |
Output is correct |
5 |
Correct |
9 ms |
15820 KB |
Output is correct |
6 |
Correct |
9 ms |
15932 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
15948 KB |
Output is correct |
2 |
Correct |
9 ms |
15936 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
15948 KB |
Output is correct |
2 |
Correct |
9 ms |
15936 KB |
Output is correct |
3 |
Incorrect |
9 ms |
15820 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
15948 KB |
Output is correct |
2 |
Correct |
9 ms |
15820 KB |
Output is correct |
3 |
Correct |
9 ms |
15820 KB |
Output is correct |
4 |
Correct |
9 ms |
15820 KB |
Output is correct |
5 |
Correct |
9 ms |
15820 KB |
Output is correct |
6 |
Correct |
9 ms |
15932 KB |
Output is correct |
7 |
Correct |
12 ms |
15948 KB |
Output is correct |
8 |
Correct |
9 ms |
15936 KB |
Output is correct |
9 |
Incorrect |
9 ms |
15820 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |