oj.uz

Submission #139718

# Submission time Handle Problem Language Result Execution time Memory
139718 2019-08-01T09:58:33 Z mlyean00 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
5 / 100
 500 ms 424 KB 
#include <bits/stdc++.h>
#ifdef DEBUG
#include "debug.hpp"
#else
#pragma GCC optimize("Ofast")
#define trace(...)
#include <bits/stdc++.h>
#define endl '\n'
#endif

using namespace std;

const string COL = "RGY";

int count_swaps(string s, string const& t) {
    int n = s.length();
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        int j;
        for (j = i; j < n; ++j) {
            if (s[j] == t[i]) break;
        }
        if (j == n) return INT_MAX;
        for (; j > i; --j) {
            ++ans;
            swap(s[j], s[j - 1]);
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    string s;
    cin >> n >> s;

    int ans = INT_MAX;

    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 1 << (n - 1); ++j) {
            string t;
            int prev_c = i;
            t.push_back(COL[prev_c]);
            for (int k = 0; k < n - 1; ++k) {
                int bit = (j >> k) & 1;
                prev_c = (prev_c + bit + 1) % 3;
                t.push_back(COL[prev_c]);
            }
            ans = min(count_swaps(s, t), ans);
        }
    }

    if (ans == INT_MAX) ans = -1;

    cout << ans << endl;

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 15 ms 376 KB Output is correct
6 Correct 18 ms 376 KB Output is correct
7 Correct 17 ms 376 KB Output is correct
8 Correct 17 ms 376 KB Output is correct
9 Correct 15 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 17 ms 376 KB Output is correct
12 Correct 20 ms 376 KB Output is correct
13 Correct 14 ms 376 KB Output is correct
14 Correct 11 ms 424 KB Output is correct
15 Correct 21 ms 376 KB Output is correct
16 Correct 12 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 15 ms 376 KB Output is correct
6 Correct 18 ms 376 KB Output is correct
7 Correct 17 ms 376 KB Output is correct
8 Correct 17 ms 376 KB Output is correct
9 Correct 15 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 17 ms 376 KB Output is correct
12 Correct 20 ms 376 KB Output is correct
13 Correct 14 ms 376 KB Output is correct
14 Correct 11 ms 424 KB Output is correct
15 Correct 21 ms 376 KB Output is correct
16 Correct 12 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Execution timed out 1064 ms 376 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 430 ms 380 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 15 ms 376 KB Output is correct
6 Correct 18 ms 376 KB Output is correct
7 Correct 17 ms 376 KB Output is correct
8 Correct 17 ms 376 KB Output is correct
9 Correct 15 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 17 ms 376 KB Output is correct
12 Correct 20 ms 376 KB Output is correct
13 Correct 14 ms 376 KB Output is correct
14 Correct 11 ms 424 KB Output is correct
15 Correct 21 ms 376 KB Output is correct
16 Correct 12 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Execution timed out 1064 ms 376 KB Time limit exceeded
19 Halted 0 ms 0 KB -