oj.uz

Submission #98406

# Submission time Handle Problem Language Result Execution time Memory
98406 2019-02-22T21:36:54 Z MatheusLealV Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
0 / 100
 500 ms 763296 KB 
#include <bits/stdc++.h>
#define N 402
using namespace std;

int n, v[N], pos[3][N], sz[3], inf = 2000000000;

int dp[N][N][N][3], dij[N][N], diz[N][N], dji[N][N], dzi[N][N], djz[N][N], dzj[N][N];

int solve(int i, int j, int z, int lst)
{
	if(!i and !j and !z) return 0;

	if(lst <= 2 and dp[i][j][z][lst] != -1) return dp[i][j][z][lst];

	int A = inf, B = inf, C = inf, di = 0, dj = 0, dz = 0;

	if(i > 0 and lst != 0) A = solve(i - 1, j, z, 0) + abs(i + j + z - pos[0][i] + di + dij[i][j + 1] + diz[i][z + 1]);

	if(j > 0 and lst != 1) B = solve(i, j - 1, z, 1) + abs(i + j + z - pos[1][j] + dj + dji[i + 1][j] + djz[z + 1][j]);
	
	if(z > 0 and lst != 2) C = solve(i, j, z - 1, 2) + abs(i + j + z - pos[2][z] + dz + dzi[i + 1][z] + dzj[z][j + 1]);

	return dp[i][j][z][lst] = min({A, B, C});
}

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

	cin>>n;

	for(int i = 1; i <= n; i++)
	{
		char c;

		cin>>c;

		if(c == 'R') v[i] = 0;

		else if(c == 'Y') v[i] = 1;

		else v[i] = 2;

		++sz[v[i]];

		pos[v[i]][sz[v[i]]] = i;
	}

	for(int i = sz[0]; i >= 1; i--)
	{
		for(int a = sz[1]; a >= 1; a--)
		{
			if(pos[1][a] < pos[0][i]) dij[i][a] = dij[i][a + 1] + 1;

			else dij[i][a] = dij[i][a + 1];

			if(pos[0][i] < pos[1][a]) dji[i][a] = dji[i + 1][a] + 1;

			else dji[i][a] = dji[i + 1][a];
		}

		for(int a = sz[2]; a >= 1; a--)
		{
			if(pos[2][a] < pos[0][i]) diz[i][a] = diz[i][a + 1] + 1;

			else diz[i][a] = diz[i][a + 1];

			if(pos[0][i] < pos[2][a]) dzi[i][a] = dzi[i + 1][a] + 1;

			else dzi[i][a] = dzi[i + 1][a];
		}
	}

	for(int z = sz[2]; z >= 1; z--)
	{
		for(int j = sz[1]; j >= 1; j--)
		{
			if(pos[1][j] < pos[2][z]) dzj[z][j] = dzj[z][j + 1] + 1;

			else dzj[z][j] = dzj[z][j + 1];

			if(pos[2][z] < pos[1][j]) djz[z][j] = djz[z + 1][j] + 1;

			else djz[z][j] = djz[z + 1][j];
		}
	}

	memset(dp, -1, sizeof dp);

	int ans = solve(sz[0], sz[1], sz[2], 3);

	cout<<(ans >= inf ? -1 : ans)<<"\n";
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 594 ms 763068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Execution timed out 594 ms 763068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 610 ms 763296 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 594 ms 763068 KB Time limit exceeded
2 Halted 0 ms 0 KB -