Submission #508694

#	Time	Username	Problem	Language	Result	Execution time	Memory
508694		inksamurai	Magnus (COCI18_magnus)	C++17	50 / 50	3 ms	460 KiB

magnus

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _34raRxL ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;

void print(){
	cout<<"\n";
}
template<class te,class ...ti>
void print(const te&v, const ti&...nv) { 
	cout<<v;
	if(sizeof...(nv)){
		cout<<" ";
		print(nv...);
	}
}

#define yare {cout<<"DA\n"; exit(0);}
#define nare {cout<<"NE\n"; exit(0);}

using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

signed main(){
_34raRxL;
	string s;
	cin>>s;
	const int m=4;
	string honi="HONI";
	vi _lst(m,-1);
	int ans=0;
	int n=sz(s);
	rep(i,n){
		crep(j,1,m){
			if(s[i]==honi[j]){
				if(_lst[j-1]!=-1){
					if(_lst[j]==-1) _lst[j]=i;
				}
			}
		}
		if(s[i]==honi[0]){
			if(_lst[0]==-1) _lst[0]=i;
		}
		if(_lst[m-1]!=-1){
			ans++;
			rep(j,m) _lst[j]=-1;
		}
	}
	print(ans,"\n");
//	
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5