제출 #865908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
865908		phoenix0423	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	15 / 100	1 ms	460 KiB

joi2019_ho_t3

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 3000 + 5;
const int INF = 1e9;
const double eps = 1e-7;

struct info{
	int s, v;
	info(){}
	info(int _s, int _v) : s(_s), v(_v){}
	bool operator < (const info& other) const{
		return v < other.v || (v == other.v && s < other.s);
	}
};

int main(void){
	fastio;
	int n;
	cin>>n;
	string s;
	cin>>s;
	vector<int> pa, pb;
	for(int i = 0; i < n; i++){
		if(s[i] == 'R') pa.pb(i);
		else pb.pb(i);
	}
	if(n % 2){
		if(abs(int(pa.size() - pb.size())) > 1){
			cout<<-1<<"\n";
			return 0;
		}
		int x = 0, y = 0, ans = 0;
		for(int i = 0; i < n; i++){
			if(i % 2 == 0){
				if(pa.size() > pb.size()){
					ans += abs(i - pa[x]);
					x++;
				}
				else {
					ans += abs(i - pb[y]);
					y++;
				}
			}
			else{
				if(pa.size() < pb.size()){
					ans += abs(i - pa[x]);
					x++;
				}
				else {
					ans += abs(i - pb[y]);
					y++;
				}	
			}
		}
		cout<<ans / 2<<"\n";
	}
	else{
		if(pa.size() != pb.size()){
			cout<<-1<<"\n";
			return 0;
		}
		vector<int> ans(2);
		for(int i = 0; i < n; i++){
			ans[i % 2] += abs(pa[i / 2] - i);
			ans[1 - i % 2] += abs(pb[i / 2] - i);
		}
		cout<<min(ans[0], ans[1]) / 2<<"\n";
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25