oj.uz

Submission #893466

# Submission time Handle Problem Language Result Execution time Memory
893466 2023-12-27T05:27:43 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
20 / 100
 2 ms 600 KB 
#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 3e5+5;
vector<char> t;
string s;
ll n;

ll calc(string t, string s) {
    ll ans = 0;
    for(ll i=1; i<=n; i++) {
        ll pos = -1;
        for(ll j=i; j<=n; j++) {
            if(s[j]==t[i]) {
                pos = j;
                break;
            }
        }
        ans += abs(pos-i);
        for(ll j=pos; j>i; j--) swap(s[j], s[j-1]);
    }
    return ans;
}

ll rec(ll last, ll r, ll g, ll y) {
    if(!r && !g && !y) {
        string t1;
        for(auto x: t) t1 += x;
        return calc(t1, s);
    }
    ll ans = inf;
    if(last!=1 && r) {
        t.pb('R');
        ans = min(ans, rec(1, r-1, g, y));
        t.pop_back();
    }
    if(last!=2 && g) {
        t.pb('G');
        ans = min(ans, rec(2, r, g-1, y));
        t.pop_back();
    }
    if(last!=3 && y) {
        t.pb('Y');
        ans = min(ans, rec(3, r, g, y-1));
        t.pop_back();
    }
    return ans;
}

void kigash() {
    cin>>n>>s;
    s = ' '+s;
    if(!count(all(s), 'Y')) {
        ll cntR = count(all(s), 'R');
        ll cntG = n-cntR;
        if(abs(cntR-cntG)>1) {
            cout<<"-1\n";
            return;
        }
        string t = " ";
        for(ll i=1; i<=n; i++) {
            if(i&1) t += 'R';
            else t += 'G';
        }
        string ss = s;
        ll mn = MX;
        if(count(all(t), 'R')==cntR && count(all(t), 'G')==cntG) mn = min(mn, calc(t, s));
        t = " ", s = ss;
        for(ll i=1; i<=n; i++) {
            if(i&1) t += 'G';
            else t += 'R';
        }
        if(count(all(t), 'R')==cntR && count(all(t), 'G')==cntG) mn = min(mn, calc(t, s));
        cout<<mn<<"\n";
    }
    else if(n<=15) {
        ll r = count(all(s), 'R');
        ll g = count(all(s), 'G');
        ll y = n-r-g;
        t.pb('#');
        ll ans = rec(0, r, g, y);
        if(ans>=inf) cout<<"-1\n";
        else cout<<ans<<"\n";
    }
    else {
        ll ans = 0;
        for(ll i=2; i<=n; i++) {
            if(s[i]!=s[i-1]) continue;
            if(i>=3 && s[i-3]!=s[i-1]) {
                ans++;
                swap(s[i-1], s[i-2]);
            }
            else {
                ll pos = -1;
                for(ll j=i+1; j<=n; j++) {
                    if(s[j]!=s[i]) {
                        pos = j;
                        break;
                    }
                }
                if(pos==-1) {
                    cout<<"-1\n";
                    return;
                }
                for(ll j=pos; j>i; j--) {
                    ans++;
                    swap(s[j], s[j-1]);
                }
            }
        }
        cout<<ans<<"\n";
    }
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

Compilation message

joi2019_ho_t3.cpp: In function 'void freopen(std::string)':
joi2019_ho_t3.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -