이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'
#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define ub upper_bound
#define lb lower_bound
#define rep(x,s,e) for (auto x=(s)-((s)>(e));x!=(e)-((s)>(e));(s)<(e)?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()
mt19937 rng(177013);
int main(){
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(false);
int n;
cin>>n;
int a=0,b=0,c=0;
rep(x,0,n){
string s,t;
cin>>s>>t;
if (s=="section"){
a++,b=c=0;
cout<<a<<" "<<t<<endl;
}
else if (s=="subsection"){
b++,c=0;
cout<<a<<"."<<b<<" "<<t<<endl;
}
else{
c++;
cout<<a<<"."<<b<<"."<<c<<" "<<t<<endl;
}
}
}
# | 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... |