oj.uz

답안 #236682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236682 2020-06-02T19:50:33 Z _7_7_ Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 815740 KB 
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 411;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
	
int n, cnt[N][3], dp[N][N][N][3], c[3];
vi pos[3];
string s;


inline int get (int l, int r, int i) {
	if (l > r)
		return 0;
	return cnt[r][i] - cnt[l - 1][i];
}


main () {
	cin >> n >> s;
	s = "#" + s;
	
	memset(dp, -1, sizeof(dp));

	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < 3; ++j)
			cnt[i][j] = cnt[i - 1][j];
		if (s[i] == 'R') {
			++cnt[i][0]; 
			pos[0].pb(i);
		} else if (s[i] == 'Y') {
			++cnt[i][1]; 
			pos[1].pb(i);
		} else {
			++cnt[i][2]; 
			pos[2].pb(i);
		}
	}

	int cnt0 = cnt[n][0], cnt1 = cnt[n][1], cnt2 = cnt[n][2];
	for (int i = 0; i <= cnt0; ++i)
		for (int j = 0; j <= cnt1; ++j)
			for (int x = 0; x <= cnt2; ++x)
				for (int lst = 0; lst < 3; ++lst)
					dp[i][j][x][lst] = inf;

	for (int lst = 0; lst < 3; ++lst)
		dp[0][0][0][lst] = 0;

	for (c[0] = 0; c[0] <= cnt0; ++c[0])
		for (c[1] = 0; c[1] <= cnt1; ++c[1])
			for (c[2] = 0; c[2] <= cnt2; ++c[2]) 
				for (int lst = 0; lst < 3; ++lst) {
					if (!c[lst])
						continue;
					int cost = 0;
					for (int lst1 = 0; lst1 < 3; ++lst1)
						if (lst1 != lst && c[lst1])
							cost += get(pos[lst][c[lst] - 1], pos[lst1][c[lst1] - 1], lst1);

//					cerr << c[0] << ' ' << c[1] << ' ' << c[2] << ' ' << cost << endl;
					for (int lst1 = 0; lst1 < 3; ++lst1)
						if (lst != lst1)
							dp[c[0]][c[1]][c[2]][lst] = min(dp[c[0]][c[1]][c[2]][lst], dp[c[0] - (!lst)][c[1] - (lst == 1)][c[2] - (lst == 2)][lst1] + cost);
				}

	int ans = min({dp[cnt0][cnt1][cnt2][0], dp[cnt0][cnt1][cnt2][1], dp[cnt0][cnt1][cnt2][2]});
	if (ans == inf)
		ans = -1;
	cout << ans << endl;
}

Compilation message

joi2019_ho_t3.cpp:52:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 485 ms 815552 KB Output is correct
2 Correct 418 ms 815528 KB Output is correct
3 Correct 404 ms 815484 KB Output is correct
4 Correct 407 ms 815736 KB Output is correct
5 Correct 411 ms 815480 KB Output is correct
6 Correct 418 ms 815632 KB Output is correct
7 Correct 409 ms 815672 KB Output is correct
8 Correct 400 ms 815480 KB Output is correct
9 Correct 421 ms 815608 KB Output is correct
10 Correct 415 ms 815552 KB Output is correct
11 Correct 410 ms 815608 KB Output is correct
12 Correct 438 ms 815528 KB Output is correct
13 Correct 402 ms 815488 KB Output is correct
14 Correct 436 ms 815608 KB Output is correct
15 Correct 415 ms 815608 KB Output is correct
16 Correct 407 ms 815608 KB Output is correct
17 Correct 401 ms 815492 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 485 ms 815552 KB Output is correct
2 Correct 418 ms 815528 KB Output is correct
3 Correct 404 ms 815484 KB Output is correct
4 Correct 407 ms 815736 KB Output is correct
5 Correct 411 ms 815480 KB Output is correct
6 Correct 418 ms 815632 KB Output is correct
7 Correct 409 ms 815672 KB Output is correct
8 Correct 400 ms 815480 KB Output is correct
9 Correct 421 ms 815608 KB Output is correct
10 Correct 415 ms 815552 KB Output is correct
11 Correct 410 ms 815608 KB Output is correct
12 Correct 438 ms 815528 KB Output is correct
13 Correct 402 ms 815488 KB Output is correct
14 Correct 436 ms 815608 KB Output is correct
15 Correct 415 ms 815608 KB Output is correct
16 Correct 407 ms 815608 KB Output is correct
17 Correct 401 ms 815492 KB Output is correct
18 Correct 407 ms 815608 KB Output is correct
19 Correct 405 ms 815480 KB Output is correct
20 Correct 401 ms 815480 KB Output is correct
21 Correct 408 ms 815608 KB Output is correct
22 Correct 445 ms 815444 KB Output is correct
23 Correct 420 ms 815484 KB Output is correct
24 Correct 398 ms 815608 KB Output is correct
25 Correct 400 ms 815640 KB Output is correct
26 Correct 404 ms 815480 KB Output is correct
27 Correct 406 ms 815480 KB Output is correct
28 Correct 402 ms 815536 KB Output is correct
29 Correct 406 ms 815608 KB Output is correct
30 Correct 406 ms 815480 KB Output is correct
31 Correct 406 ms 815560 KB Output is correct
32 Correct 400 ms 815480 KB Output is correct
33 Correct 405 ms 815480 KB Output is correct
34 Correct 408 ms 815480 KB Output is correct
35 Correct 409 ms 815444 KB Output is correct
36 Correct 416 ms 815480 KB Output is correct
37 Correct 409 ms 815608 KB Output is correct
38 Correct 411 ms 815480 KB Output is correct
39 Correct 408 ms 815480 KB Output is correct
40 Correct 410 ms 815608 KB Output is correct
41 Correct 403 ms 815572 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 404 ms 815740 KB Output is correct
2 Correct 408 ms 815540 KB Output is correct
3 Correct 409 ms 815480 KB Output is correct
4 Correct 407 ms 815608 KB Output is correct
5 Correct 409 ms 815480 KB Output is correct
6 Correct 403 ms 815484 KB Output is correct
7 Correct 424 ms 815608 KB Output is correct
8 Correct 401 ms 815548 KB Output is correct
9 Correct 410 ms 815736 KB Output is correct
10 Correct 401 ms 815480 KB Output is correct
11 Correct 412 ms 815480 KB Output is correct
12 Correct 402 ms 815480 KB Output is correct
13 Correct 405 ms 815480 KB Output is correct
14 Correct 409 ms 815480 KB Output is correct
15 Correct 410 ms 815480 KB Output is correct
16 Correct 406 ms 815480 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 485 ms 815552 KB Output is correct
2 Correct 418 ms 815528 KB Output is correct
3 Correct 404 ms 815484 KB Output is correct
4 Correct 407 ms 815736 KB Output is correct
5 Correct 411 ms 815480 KB Output is correct
6 Correct 418 ms 815632 KB Output is correct
7 Correct 409 ms 815672 KB Output is correct
8 Correct 400 ms 815480 KB Output is correct
9 Correct 421 ms 815608 KB Output is correct
10 Correct 415 ms 815552 KB Output is correct
11 Correct 410 ms 815608 KB Output is correct
12 Correct 438 ms 815528 KB Output is correct
13 Correct 402 ms 815488 KB Output is correct
14 Correct 436 ms 815608 KB Output is correct
15 Correct 415 ms 815608 KB Output is correct
16 Correct 407 ms 815608 KB Output is correct
17 Correct 401 ms 815492 KB Output is correct
18 Correct 407 ms 815608 KB Output is correct
19 Correct 405 ms 815480 KB Output is correct
20 Correct 401 ms 815480 KB Output is correct
21 Correct 408 ms 815608 KB Output is correct
22 Correct 445 ms 815444 KB Output is correct
23 Correct 420 ms 815484 KB Output is correct
24 Correct 398 ms 815608 KB Output is correct
25 Correct 400 ms 815640 KB Output is correct
26 Correct 404 ms 815480 KB Output is correct
27 Correct 406 ms 815480 KB Output is correct
28 Correct 402 ms 815536 KB Output is correct
29 Correct 406 ms 815608 KB Output is correct
30 Correct 406 ms 815480 KB Output is correct
31 Correct 406 ms 815560 KB Output is correct
32 Correct 400 ms 815480 KB Output is correct
33 Correct 405 ms 815480 KB Output is correct
34 Correct 408 ms 815480 KB Output is correct
35 Correct 409 ms 815444 KB Output is correct
36 Correct 416 ms 815480 KB Output is correct
37 Correct 409 ms 815608 KB Output is correct
38 Correct 411 ms 815480 KB Output is correct
39 Correct 408 ms 815480 KB Output is correct
40 Correct 410 ms 815608 KB Output is correct
41 Correct 403 ms 815572 KB Output is correct
42 Correct 404 ms 815740 KB Output is correct
43 Correct 408 ms 815540 KB Output is correct
44 Correct 409 ms 815480 KB Output is correct
45 Correct 407 ms 815608 KB Output is correct
46 Correct 409 ms 815480 KB Output is correct
47 Correct 403 ms 815484 KB Output is correct
48 Correct 424 ms 815608 KB Output is correct
49 Correct 401 ms 815548 KB Output is correct
50 Correct 410 ms 815736 KB Output is correct
51 Correct 401 ms 815480 KB Output is correct
52 Correct 412 ms 815480 KB Output is correct
53 Correct 402 ms 815480 KB Output is correct
54 Correct 405 ms 815480 KB Output is correct
55 Correct 409 ms 815480 KB Output is correct
56 Correct 410 ms 815480 KB Output is correct
57 Correct 406 ms 815480 KB Output is correct
58 Execution timed out 509 ms 815480 KB Time limit exceeded
59 Halted 0 ms 0 KB -