Submission #891520

#	Time	Username	Problem	Language	Result	Execution time	Memory
891520		Mr_Ph	Kaučuk (COCI21_kaucuk)	C++17	50 / 50	1 ms	456 KiB

Main

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const int mod=(int)1e9+7;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
void preprocess() {}
void solve()
{
    int a=0,b=0,c=0;
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        string x,y;
        cin>>x>>y;
        if(x=="section")
        {
            a++,b=0,c=0;
        }
        else if(x=="subsection")
        b++,c=0;
        else c++;
            cout<<a;
            if(b)
            {
                cout<<'.'<<b;
                if(c)cout<<'.'<<c;
            }
            cout<<" "<<y<<endl;
    }
}
signed main()
{
    // freopen("div7.in","r",stdin);
    //freopen("div7.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
  //  cin>>t;
    while(t--)
        solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 20 / 20