답안 #909986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
909986	2024-01-17T17:31:23 Z	AlphaMale06	스탬프 수집 (JOI16_ho_t2)	C++14	0 / 100	1 ms	608 KB

2016_ho_t2

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define int long long

const int N = 100002;

int pref[N][3];

void solve(){
	int n;
	cin >> n;
	string s;
	cin >> s;
	int a[n];
	for(int i=0; i< n; i++){
		if(s[i]=='J')a[i]=0;
		else if(s[i]=='O')a[i]=1;
		else a[i]=2;
	}
	for(int i=1; i<=n; i++){
		for(int j=0; j< 3; j++){
			pref[i][j]=pref[i-1][j];
		}
		pref[i][a[i-1]]++;
	}
	int ans=0;
	int mx=0;
	for(int i=1; i<=n; i++){
		if(a[i-1]==1){
			ans+=pref[i][0]*(pref[n][2]-pref[i][2]);
			mx=max(mx, pref[i][0]*(pref[n][2]-pref[i][2]));
		}
	}
	int add1=0;
	int add2=0;
	for(int i=n; i>=1; i--){
		if(a[i-1]==1){
			add1+=pref[n][2]-pref[i][2];
		}
	}
	for(int i=1; i<=n; i++){
		if(a[i-1]==1)add2+=pref[i][0];
	}
	cout << ans+max({mx, add1, add2}) << '\n';
}


signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

Subtask #1

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	464 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	608 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Incorrect	1 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #2

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	464 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	608 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Incorrect	1 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	464 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	608 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Incorrect	1 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-