Submission #862535

# Submission time Handle Problem Language Result Execution time Memory
862535 2023-10-18T13:02:16 Z Cyber_Wolf Kaučuk (COCI21_kaucuk) C++17
50 / 50
1 ms 348 KB
// Problem: E - Sequence Decomposing
// Contest: AtCoder - AtCoder Beginner Contest 134
// URL: https://atcoder.jp/contests/abc134/tasks/abc134_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;

#define lg long long 

int main()
{
	lg n;
	cin >> n;
	lg lev = 0;
	vector<lg> a(3);
	while(n--)
	{
		string s, t;
		cin >> s >> t;
		if(s == "section")
		{
			while(lev)
			{
				a[lev] = 0;
				lev--;
			}
			a[lev]++;
			cout << a[lev] << ' ' << t << '\n';
		}
		else if(s == "subsection")
		{
			while(lev > 1)
			{
				a[lev] = 0;
				lev--;
			}
			lev = 1;
			a[lev]++;
			cout << a[0] << '.' << a[1] << ' ' << t << '\n';
		}
		else{
			lev = 2;
			a[2]++;
			cout << a[0] << '.' << a[1] << '.' << a[2] << ' ' << t << '\n';
		}
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct