Submission #320085

#TimeUsernameProblemLanguageResultExecution timeMemory
320085YJUJOIOJI (JOI14_joioji)C++14
0 / 100
1 ms364 KiB
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops,no-stack-protector") using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pll; const ll MOD=1e9+7; const ll MOD2=998244353; const ll N=2e5+5; const ld pi=3.14159265359; const ll INF=(1LL<<60); #define SQ(i) ((i)*(i)) #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define pb push_back #define mp make_pair #define X first #define Y second #define setp setprecision #define lwb lower_bound #define SZ(_a) (ll)_a.size() ll n,cnt[3]; char c; int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>n; REP(i,n){ cin>>c; if(c=='J')++cnt[0]; if(c=='O')++cnt[1]; if(c=='I')++cnt[2]; } cout<<max(0LL,3*(min(min(cnt[0],cnt[1]),cnt[2])-1))<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...