oj.uz

답안 #670309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670309 2022-12-08T16:48:04 Z dozer Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
15 / 100
 500 ms 1040460 KB 
#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define endl "\n"
#define sp " "
#define N 405

int dp[N][N][N][4];
vector<int> r, g, y;
int n;

const int INF = 1e9 + 7;

int f(int i, int j, int k, int last)
{
	int t1 = INF, t2 = INF, t3 = INF;
	int pos = i + j + k + 1;
	if (pos > n) return 0;
	if (dp[i][j][k][last] != -1) return dp[i][j][k][last];
	if (i < r.size() && last != 0) t1 = f(i + 1, j, k, 0) + abs(r[i] - pos);
	if (j < g.size() && last != 1) t2 = f(i, j + 1, k, 1) + abs(g[j] - pos);
	if (k < y.size() && last != 2) t3 = f(i, j, k + 1, 2) + abs(y[k] - pos);
	int res = min(t1, t2);
	res = min(res, t3);
	return dp[i][j][k][last] = res;
}

int32_t main()
{
	fastio();

	memset(dp, -1, sizeof(dp));
	cin>>n;
	for (int i = 1; i <= n; i++)
	{
		char tmp;
		cin>>tmp;
		if (tmp == 'R') r.pb(i);
		else if (tmp == 'Y') y.pb(i);
		else g.pb(i);
	}

	int ans = f(0, 0, 0, 3);
	if (ans >= INF) cout<<-1<<endl;
	else cout<<ans / 2<<endl;

	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Compilation message

joi2019_ho_t3.cpp: In function 'int f(int, int, int, int)':
joi2019_ho_t3.cpp:25:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  if (i < r.size() && last != 0) t1 = f(i + 1, j, k, 0) + abs(r[i] - pos);
      |      ~~^~~~~~~~~~
joi2019_ho_t3.cpp:26:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  if (j < g.size() && last != 1) t2 = f(i, j + 1, k, 1) + abs(g[j] - pos);
      |      ~~^~~~~~~~~~
joi2019_ho_t3.cpp:27:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  if (k < y.size() && last != 2) t3 = f(i, j, k + 1, 2) + abs(y[k] - pos);
      |      ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 534 ms 1040308 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 534 ms 1040308 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 1040416 KB Output is correct
2 Correct 408 ms 1040396 KB Output is correct
3 Correct 464 ms 1040308 KB Output is correct
4 Correct 405 ms 1040324 KB Output is correct
5 Correct 422 ms 1040228 KB Output is correct
6 Correct 410 ms 1040348 KB Output is correct
7 Correct 390 ms 1040336 KB Output is correct
8 Correct 397 ms 1040344 KB Output is correct
9 Correct 388 ms 1040332 KB Output is correct
10 Correct 397 ms 1040332 KB Output is correct
11 Correct 386 ms 1040244 KB Output is correct
12 Correct 422 ms 1040272 KB Output is correct
13 Correct 394 ms 1040268 KB Output is correct
14 Correct 397 ms 1040312 KB Output is correct
15 Correct 408 ms 1040236 KB Output is correct
16 Correct 410 ms 1040460 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 534 ms 1040308 KB Time limit exceeded
2 Halted 0 ms 0 KB -