oj.uz

Submission #818989

# Submission time Handle Problem Language Result Execution time Memory
818989 2023-08-10T07:32:56 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
15 / 100
 1 ms 324 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define el cout<<endl;
#define fr(n,m) for(int i=n;i<m;i++)
#define frj(n,m) for(int j=n;j<m;j++)
#define frl(n,m) for(int l=n;l<m;l++)
#define frd(n,m) for(int d=n;d<m;d++)
#define ff for(int i=0;i<n;i++)
#define mii map<int,int>
#define mci map<char,int>
#define vi vector<int>
#define vc vector<char>
#define mivi map<int,vi>
#define pb push_back
#define ext {cout<<-1;return;}
#define inf 1e18
#define sz size()
#define fi first
#define se second
const int mod = 1e9 + 7;
// const int mod=998
int i = 0, j = 0, k = 0, l = 0, h = 0, w = 0, a = 0, b = 0, c = 0, d = 0, n = 0, m = 0;
int num = 0, ans = 0, sum = 0, mi = inf, ma = 0;
string s, p, st;
const int N = 1e3 + 5;
void solve() {
	cin >> n >> s;
	vi v(n);
	mii mp;
	ff{
		if (s[i] == s[0]) {
			mp[0]++;
		}
		else mp[1]++;
	}
	a = n / 2; b = n - a;
	// cout << mp[0] << " " << mp[1];
	if (mp.sz == 2) {
		if ((mp[0] != a && mp[1] != b) && (mp[1] != a && mp[0] != b)) ext;
		if (a == b) {
			int x = 0, num = 0;
			ff{
				if (s[i] == s[0]) {
					num += abs(x);
					x--;
				}
				else{
					x++;
				}
			}
			mi = num;
			x = 0, num = 0;
			ff{
				if (s[i] != s[0]) {
					num += abs(x);
					x--;
				}
				else{
					x++;
				}
			}
			mi = min(mi, num);
			cout << mi;
		}
		else if (mp[1] > mp[0]) {
			int x = 0, num = 0;
			ff{
				if (s[i] != s[0]) {
					num += abs(x);
					x--;
				}
				else{
					x++;
				}
			}
			cout << num;
		}
		else {
			int x = 0, num = 0;
			ff{
				if (s[i] == s[0]) {
					num += abs(x);
					x--;
				}
				else{
					x++;
				}
			}
			cout << num;
		}
	}
	// else {

	// }
}
signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	// cin >> T;
	while (T--) {
		cout << fixed << setprecision(12); solve();
		el;
	} return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 320 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -