oj.uz

Submission #762044

# Submission time Handle Problem Language Result Execution time Memory
762044 2023-06-20T16:29:22 Z sysia Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
0 / 100
 1 ms 320 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

int change(char c){
    if (c == 'R') return 0;
    if (c == 'G') return 1;
    return 2;
}

void solve(){
    int n; cin >> n;
    string s; cin >> s;
    s = "$" + s;
    vector<int>cnt(3);
    for (int i = 1; i<=n; i++) cnt[change(s[i])]++;
    auto check = [&](vector<int>now, int ile){
        for (auto x: now){
            if (x > (ile+1)/2){
                return false;
            }
        }
        return true;
    };
    if (!check(cnt, n)){
        cout << "-1\n";
        return;
    }
    int ans = 0;
    for (int i = 1; i<=n; i++){
        debug(i, s);
        auto tcnt = cnt;
        tcnt[change(s[i])]--;
        if ((i > 1 && s[i] == s[i-1]) || !check(tcnt, n-i)){
            debug(2137);
            //musimy zmienic i-ta litere
            for (int j = i+1; j<=n; j++){
                if (s[j] == s[i]) continue;
                auto ncnt = cnt;
                // ncnt[change(s[i])]++;
                ncnt[change(s[j])]--;
                if (check(ncnt, n-i)){
                    debug(i, j);
                    string t;
                    for (int rep = 0; rep<i; rep++) t += s[rep];
                    t += s[j];
                    ans += (j-i);
                    for (int rep = i; rep <= n; rep++){
                        if (rep == j) continue;
                        t += s[rep];
                    }
                    swap(s, t);
                    break;
                }
            }
        }
        cnt[change(s[i])]--;
    }
    cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
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 1 ms 212 KB Output is correct
4 Incorrect 1 ms 320 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -