| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 651054 | ktkerem | Kaučuk (COCI21_kaucuk) | C++17 | 1 ms | 320 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
/**/
//typedef int ll;
typedef long long ll;
typedef unsigned long long ull;
/*typedef __int128 vll;
typedef unsigned __int128 uvll;*/
#define llll std::pair<ll , ll>
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e15+7; 
const ll ous = 2e5 + 7;
const ll dx[4] = {-1 , 0 , 1 , 0} , dy[4] = {0,1,0,-1};
std::vector<std::pair<ll , std::string>> ar;
ll n;
void solve(){
    std::cin >> n;
    ar.resize(n);
    for(ll i = 0;n>i;i++){
        std::string h;std::cin >> h;
        if(h == "section"){
            std::cin >> h;
            ar[i].fi = 1;
            ar[i].sec = h;
        }
        else if(h == "subsection"){
            std::cin >> h;
            ar[i].fi = 2;
            ar[i].sec = h;
        }
        else{
            std::cin >> h;
            ar[i].fi = 3;
            ar[i].sec = h;
        }
    }
    ll f = 0 , s = 0 , t = 0;
    for(ll i = 0;n>i;i++){
        if(ar[i].fi == 1){
            f++;s=0;t=0;
        }
        else if(ar[i].fi == 2){
            s++;t=0;
        }
        else{
            t++;
        }
        std::cout << f;
        if(s != 0){
            std::cout << "." << s;
        }
        if(t != 0){
            std::cout << "." << t;
        }
        std::cout << " ";
        std::cout << ar[i].sec << "\n";
    }
    return;/**/
}
signed main(){
    std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);
    ll t=1;
    //std::cin >> t;
    ll o = 1;
    while(t--){ 
        //cout << "Case " << o++ << ":\n";
        solve();
    }
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
