제출 #1202321

#제출 시각아이디문제언어결과실행 시간메모리
1202321MighilonKaučuk (COCI21_kaucuk)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; #ifdef DEBUG #include "../Library/debug.h" #else #define dbg(x...) #endif typedef long long ll; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define F0R(i, a) for (int i = 0; i < (a); ++i) #define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i) #define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i) #define trav(a, x) for (auto& a : x) #define f first #define s second #define pb push_back #define sz(x) (int)(x).size() #define all(x) x.begin(), x.end() const char nl = '\n'; const int INF = 1e9; const int MOD = 1e9 + 7; void solve(){ int n; cin>>n; int c[3]={0,0,0}; F0R(i,n){ string a,b; cin>>a>>b; if(a=="section"){ cout<<++c[0]<<" "<<b<<nl; c[1]=c[2]=0; } else if(a=="subsection"){ cout<<c[0]<<"."<<++c[1]<<" "<<b<<nl; c[2]=0; } else{ cout<<c[0]<<"."<<c[1]<<"."<<++c[2]<<" "<<b<<nl; } } } int32_t main(){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int TC = 1; // cin >> TC; while(TC--){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...