oj.uz

Submission #497376

# Submission time Handle Problem Language Result Execution time Memory
497376 2021-12-23T04:03:08 Z armashka Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
15 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, ans = inf, color;
string s;
set <ll> a, b, c;
vector <ll> pos;

void fun() {
	while (pos.sz < n) {
		if (color == 1) {
			if (b.empty() && c.empty()) {
				return;
			}
			if (b.sz > c.sz) {
				pos.pb(*b.begin());
				b.erase(b.begin());
				color = 2;
			} else if (b.sz < c.sz) {
				pos.pb(*c.begin());
				c.erase(c.begin());
				color = 3;
			}  else {
				pos.pb(min(*c.begin(), *b.begin()));
				if (*c.begin() < *b.begin()) c.erase(c.begin()), color = 3;
				else b.erase(b.begin()), color = 2;	
			}
		} else if (color == 2) {
			if (a.empty() && c.empty()) {
				return;
			}
			if (a.sz > c.sz) {
				pos.pb(*a.begin());
				a.erase(a.begin());
				color = 1;
			} else if (a.sz < c.sz) {
				pos.pb(*c.begin());
				c.erase(c.begin());
				color = 3;
			} else {
				pos.pb(min(*a.begin(), *c.begin()));
				if (*a.begin() < *c.begin()) a.erase(a.begin()), color = 1;
				else c.erase(c.begin()), color = 3;	
			}
		} else if (color == 3) {
			if (b.empty() && a.empty()) {
				return;
			}
			if (b.sz > a.sz) {
				pos.pb(*b.begin());
				b.erase(b.begin());
				color = 2;
			} else if (a.sz > b.sz) {
				pos.pb(*a.begin());
				a.erase(a.begin());
				color = 1;
			} else {
				pos.pb(min(*a.begin(), *b.begin()));
				if (*a.begin() < *b.begin()) a.erase(a.begin()), color = 1;
				else b.erase(b.begin()), color = 2;	
			}
		}				
	}
	ll cnt = 0;
	for (int i = 0; i < pos.sz; ++ i) {
		for (int j = i + 1; j < pos.sz; ++ j) {
			if (pos[i] > pos[j]) ++ cnt;
		}
	}
	ans = min(ans, cnt);
}

void podschet() {
	for (int i = 1; i <= n; ++ i) {
		if (s[i] == 'R') a.insert(i);
		else if (s[i] == 'G') b.insert(i);
		else c.insert(i);
	}
}

const void solve(/*Armashka*/) {
	cin >> n >> s;
	s = " " + s;
	podschet();
	if (a.sz) {
		color = 1;
		pos.pb(*a.begin());
		a.erase(a.begin());
		fun();
	}	
	podschet(); pos.clear();
	if (b.sz) {
		color = 2;
		pos.pb(*b.begin());
		b.erase(b.begin());
		fun();
	}	
	podschet(); pos.clear();
	if (c.sz) {
		color = 3;
		pos.pb(*c.begin());
		c.erase(c.begin());
		fun();
	}
	if (ans == inf) cout << "-1\n";
	else cout << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {                                                
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Compilation message

joi2019_ho_t3.cpp: In function 'void fun()':
joi2019_ho_t3.cpp:37:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   37 |  while (pos.sz < n) {
      |         ~~~~~~~^~~
joi2019_ho_t3.cpp:92:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |  for (int i = 0; i < pos.sz; ++ i) {
      |                    ^
joi2019_ho_t3.cpp:93:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for (int j = i + 1; j < pos.sz; ++ j) {
      |                         ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 312 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 312 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 312 KB Output isn't correct
5 Halted 0 ms 0 KB -