oj.uz

답안 #782178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782178 2023-07-13T16:05:16 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 337 ms 781668 KB 
#include<bits/stdc++.h>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
//#define endl "\n"
#define ll long long
#define pb push_back
#define N 405
int n;
vector<int> red,green,yellow;
int tut[3][3][N][N];
int dp[N][N][N][3];
int hesap(int r,int g,int y,int son,int sira){
	if(sira>=n)return 0;
	if(dp[r][g][y][son]!=-1)return dp[r][g][y][son];
	int cev=1000000000;
	if((son!=0||r+g+y==0)&&r<red.size()){
		cev=min(cev,hesap(r+1,g,y,0,sira+1)+red[r]+((g>0)?tut[0][1][r][g-1]:0) +((y>0)?tut[0][2][r][y-1]:0)-sira);
	}
	if(son!=1&&g<green.size()){
		cev=min(cev,hesap(r,g+1,y,1,sira+1)+green[g]+((r>0)?tut[1][0][g][r-1]:0 )+((y>0)?tut[1][2][g][y-1]:0)-sira);
	}
	if(son!=2&&y<yellow.size()){
		cev=min(cev,hesap(r,g,y+1,2,sira+1)+yellow[y]+((r>0)?tut[2][0][y][r-1]:0) +((g>0)?tut[2][1][y][g-1]:0)-sira);
	}
	//cout<<cev<<" "<<r<<" "<<g<<" "<<y<<" "<<son<<" "<<sira<<endl;
	return dp[r][g][y][son]=cev;
}

int arr[N];
int main(){
	lalala;
	memset(dp,-1,sizeof(dp));
	cin>>n;
	string str;cin>>str;
	for(int i=0;i<n;i++){
		if(str[i]=='G')green.pb(i);
		if(str[i]=='R')red.pb(i);
		if(str[i]=='Y')yellow.pb(i);
	}
	for(int i=0;i<red.size();i++){
		int kac=0;
		for(int j=0;j<green.size();j++){
			if(red[i]<green[j])	kac++;
			
			tut[0][1][i][j]=kac;
		}
	}
	for(int i=0;i<red.size();i++){
		int kac=0;
		for(int j=0;j<yellow.size();j++){
			if(red[i]<yellow[j]) kac++;

			tut[0][2][i][j]=kac;
		}
	}
	for(int i=0;i<green.size();i++){
		int kac=0;
		for(int j=0;j<red.size();j++){
			if(green[i]<red[j]) kac++;
			
			tut[1][0][i][j]=kac;
		}
	}
	for(int i=0;i<green.size();i++){
		int kac=0;
		for(int j=0;j<yellow.size();j++){
			if(green[i]<yellow[j]) kac++;
			
			tut[1][2][i][j]=kac;
		}
	}
	for(int i=0;i<yellow.size();i++){
		int kac=0;
		for(int j=0;j<red.size();j++){
			if(yellow[i]<red[j]) kac++;
			tut[2][0][i][j]=kac;
			
		}
	}
	for(int i=0;i<yellow.size();i++){
		int kac=0;
		for(int j=0;j<green.size();j++){
			if(yellow[i]<green[j]) kac++;
			tut[2][1][i][j]=kac;
			
		}
	}
	int a=hesap(0,0,0,0,0);
	if(a>=1000000000)a=-1;
	cout<<a<<endl;

}

Compilation message

joi2019_ho_t3.cpp: In function 'int hesap(int, int, int, int, int)':
joi2019_ho_t3.cpp:16:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  if((son!=0||r+g+y==0)&&r<red.size()){
      |                         ~^~~~~~~~~~~
joi2019_ho_t3.cpp:19:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  if(son!=1&&g<green.size()){
      |             ~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:22:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  if(son!=2&&y<yellow.size()){
      |             ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:40:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for(int i=0;i<red.size();i++){
      |              ~^~~~~~~~~~~
joi2019_ho_t3.cpp:42:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for(int j=0;j<green.size();j++){
      |               ~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i=0;i<red.size();i++){
      |              ~^~~~~~~~~~~
joi2019_ho_t3.cpp:50:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for(int j=0;j<yellow.size();j++){
      |               ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:56:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |  for(int i=0;i<green.size();i++){
      |              ~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:58:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int j=0;j<red.size();j++){
      |               ~^~~~~~~~~~~
joi2019_ho_t3.cpp:64:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for(int i=0;i<green.size();i++){
      |              ~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:66:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   for(int j=0;j<yellow.size();j++){
      |               ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:72:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |  for(int i=0;i<yellow.size();i++){
      |              ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:74:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int j=0;j<red.size();j++){
      |               ~^~~~~~~~~~~
joi2019_ho_t3.cpp:80:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for(int i=0;i<yellow.size();i++){
      |              ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:82:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |   for(int j=0;j<green.size();j++){
      |               ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 780212 KB Output is correct
2 Correct 244 ms 780252 KB Output is correct
3 Correct 245 ms 780212 KB Output is correct
4 Correct 247 ms 780292 KB Output is correct
5 Correct 245 ms 780332 KB Output is correct
6 Correct 247 ms 780292 KB Output is correct
7 Correct 246 ms 780328 KB Output is correct
8 Correct 243 ms 780324 KB Output is correct
9 Correct 248 ms 780364 KB Output is correct
10 Correct 249 ms 780264 KB Output is correct
11 Correct 247 ms 780356 KB Output is correct
12 Correct 250 ms 780304 KB Output is correct
13 Correct 243 ms 780364 KB Output is correct
14 Correct 244 ms 780372 KB Output is correct
15 Correct 264 ms 780364 KB Output is correct
16 Correct 248 ms 780364 KB Output is correct
17 Correct 250 ms 780236 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 780212 KB Output is correct
2 Correct 244 ms 780252 KB Output is correct
3 Correct 245 ms 780212 KB Output is correct
4 Correct 247 ms 780292 KB Output is correct
5 Correct 245 ms 780332 KB Output is correct
6 Correct 247 ms 780292 KB Output is correct
7 Correct 246 ms 780328 KB Output is correct
8 Correct 243 ms 780324 KB Output is correct
9 Correct 248 ms 780364 KB Output is correct
10 Correct 249 ms 780264 KB Output is correct
11 Correct 247 ms 780356 KB Output is correct
12 Correct 250 ms 780304 KB Output is correct
13 Correct 243 ms 780364 KB Output is correct
14 Correct 244 ms 780372 KB Output is correct
15 Correct 264 ms 780364 KB Output is correct
16 Correct 248 ms 780364 KB Output is correct
17 Correct 250 ms 780236 KB Output is correct
18 Correct 252 ms 780508 KB Output is correct
19 Correct 246 ms 780420 KB Output is correct
20 Correct 245 ms 780524 KB Output is correct
21 Correct 264 ms 780464 KB Output is correct
22 Correct 262 ms 780472 KB Output is correct
23 Correct 260 ms 780532 KB Output is correct
24 Correct 248 ms 780484 KB Output is correct
25 Correct 254 ms 780520 KB Output is correct
26 Correct 257 ms 780452 KB Output is correct
27 Correct 246 ms 780508 KB Output is correct
28 Correct 245 ms 780436 KB Output is correct
29 Correct 251 ms 780568 KB Output is correct
30 Correct 249 ms 780512 KB Output is correct
31 Correct 247 ms 780444 KB Output is correct
32 Correct 272 ms 780472 KB Output is correct
33 Correct 252 ms 780508 KB Output is correct
34 Correct 253 ms 780412 KB Output is correct
35 Correct 248 ms 780428 KB Output is correct
36 Correct 251 ms 780512 KB Output is correct
37 Correct 258 ms 780560 KB Output is correct
38 Correct 250 ms 780424 KB Output is correct
39 Correct 247 ms 780516 KB Output is correct
40 Correct 255 ms 780372 KB Output is correct
41 Correct 261 ms 780484 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 780252 KB Output is correct
2 Correct 261 ms 781132 KB Output is correct
3 Correct 246 ms 780900 KB Output is correct
4 Correct 247 ms 780944 KB Output is correct
5 Correct 256 ms 780996 KB Output is correct
6 Correct 250 ms 780960 KB Output is correct
7 Correct 248 ms 780996 KB Output is correct
8 Correct 249 ms 780940 KB Output is correct
9 Correct 246 ms 780960 KB Output is correct
10 Correct 257 ms 781004 KB Output is correct
11 Correct 246 ms 780896 KB Output is correct
12 Correct 322 ms 780656 KB Output is correct
13 Correct 256 ms 780876 KB Output is correct
14 Correct 252 ms 780876 KB Output is correct
15 Correct 250 ms 780888 KB Output is correct
16 Correct 247 ms 780876 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 780212 KB Output is correct
2 Correct 244 ms 780252 KB Output is correct
3 Correct 245 ms 780212 KB Output is correct
4 Correct 247 ms 780292 KB Output is correct
5 Correct 245 ms 780332 KB Output is correct
6 Correct 247 ms 780292 KB Output is correct
7 Correct 246 ms 780328 KB Output is correct
8 Correct 243 ms 780324 KB Output is correct
9 Correct 248 ms 780364 KB Output is correct
10 Correct 249 ms 780264 KB Output is correct
11 Correct 247 ms 780356 KB Output is correct
12 Correct 250 ms 780304 KB Output is correct
13 Correct 243 ms 780364 KB Output is correct
14 Correct 244 ms 780372 KB Output is correct
15 Correct 264 ms 780364 KB Output is correct
16 Correct 248 ms 780364 KB Output is correct
17 Correct 250 ms 780236 KB Output is correct
18 Correct 252 ms 780508 KB Output is correct
19 Correct 246 ms 780420 KB Output is correct
20 Correct 245 ms 780524 KB Output is correct
21 Correct 264 ms 780464 KB Output is correct
22 Correct 262 ms 780472 KB Output is correct
23 Correct 260 ms 780532 KB Output is correct
24 Correct 248 ms 780484 KB Output is correct
25 Correct 254 ms 780520 KB Output is correct
26 Correct 257 ms 780452 KB Output is correct
27 Correct 246 ms 780508 KB Output is correct
28 Correct 245 ms 780436 KB Output is correct
29 Correct 251 ms 780568 KB Output is correct
30 Correct 249 ms 780512 KB Output is correct
31 Correct 247 ms 780444 KB Output is correct
32 Correct 272 ms 780472 KB Output is correct
33 Correct 252 ms 780508 KB Output is correct
34 Correct 253 ms 780412 KB Output is correct
35 Correct 248 ms 780428 KB Output is correct
36 Correct 251 ms 780512 KB Output is correct
37 Correct 258 ms 780560 KB Output is correct
38 Correct 250 ms 780424 KB Output is correct
39 Correct 247 ms 780516 KB Output is correct
40 Correct 255 ms 780372 KB Output is correct
41 Correct 261 ms 780484 KB Output is correct
42 Correct 251 ms 780252 KB Output is correct
43 Correct 261 ms 781132 KB Output is correct
44 Correct 246 ms 780900 KB Output is correct
45 Correct 247 ms 780944 KB Output is correct
46 Correct 256 ms 780996 KB Output is correct
47 Correct 250 ms 780960 KB Output is correct
48 Correct 248 ms 780996 KB Output is correct
49 Correct 249 ms 780940 KB Output is correct
50 Correct 246 ms 780960 KB Output is correct
51 Correct 257 ms 781004 KB Output is correct
52 Correct 246 ms 780896 KB Output is correct
53 Correct 322 ms 780656 KB Output is correct
54 Correct 256 ms 780876 KB Output is correct
55 Correct 252 ms 780876 KB Output is correct
56 Correct 250 ms 780888 KB Output is correct
57 Correct 247 ms 780876 KB Output is correct
58 Correct 323 ms 781640 KB Output is correct
59 Correct 328 ms 781624 KB Output is correct
60 Correct 320 ms 781580 KB Output is correct
61 Correct 337 ms 781596 KB Output is correct
62 Correct 250 ms 781532 KB Output is correct
63 Correct 250 ms 781588 KB Output is correct
64 Correct 265 ms 781644 KB Output is correct
65 Correct 280 ms 781540 KB Output is correct
66 Correct 332 ms 781652 KB Output is correct
67 Correct 320 ms 781624 KB Output is correct
68 Correct 326 ms 781536 KB Output is correct
69 Correct 325 ms 781516 KB Output is correct
70 Correct 328 ms 781644 KB Output is correct
71 Correct 331 ms 781668 KB Output is correct
72 Correct 253 ms 781560 KB Output is correct
73 Correct 257 ms 781504 KB Output is correct