oj.uz

Submission #927544

# Submission time Handle Problem Language Result Execution time Memory
927544 2024-02-15T03:26:02 Z Gromp15 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
0 / 100
 500 ms 757556 KB 
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
const int INF = 1e9;
void test_case() {
	int n; string s;
	cin >> n >> s;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		a[i] = (s[i] == 'R' ? 0 : s[i] == 'G' ? 1 : 2);
	}
	ar<int, 3> on{};
	int where[3][n+1];
	memset(where, -1, sizeof(where));
	for (int i = 0; i < n; i++) {
		where[a[i]][on[a[i]]++] = i;
	}
	int dp[n+1][n+1][n+1][3];
	fill(&dp[0][0][0][0], &dp[0][0][0][0] + 3*(n+1)*(n+1)*(n+1), INF);
	memset(dp[0][0][0], 0, sizeof(dp[0][0][0]));
	for (int s = 0; s < n; s++) {
		for (int i = 0; i <= s; i++) {
			for (int j = 0; i+j <= s; j++) {
				ar<int, 3> cur{i, j, s-i-j};
				for (int k = 0; k < 3; k++) {
					for (int nw = 0; nw < 3; nw++) if (nw != k) {
						int pos = where[nw][cur[nw]];
						if (~pos) {
							ckmin(dp[i+(nw==0)][j+(nw==1)][s-i-j+(nw==2)][nw], dp[i][j][s-i-j][k] + abs(pos - s));
						}
					}
				}
			}
		}
	}
	int ans = INF;
	for (int i = 0; i <= n; i++) for (int j = 0; i+j <= n; j++) {
		for (int k = 0; k < 3; k++) {
			ckmin(ans, dp[i][j][n-i-j][k]);
		}
	}
	cout << (ans == INF ? -1 : ans / 2) << '\n';

}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 456 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 456 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 1016 ms 757556 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 456 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -