oj.uz

답안 #922302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922302 2024-02-05T11:47:34 Z elotelo966 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
15 / 100
 21 ms 140632 KB 
    #include <bits/stdc++.h>
    using namespace std;
    #define int long long
    #define OYY LLONG_MAX
    #define mod 998244353
    #define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    #define mid (start+end)/2
    #define lim 65
    #define fi first
    #define se second
    int n;// 1 2 3
    int cev=LLONG_MAX;
    vector<int> v[4];
    int dp[lim][lim][lim][lim];
    bool stop=true;
    
    inline void dpp(int red,int gre,int yel,int sira,int renk,int tut,string st){
    	if(red==v[1].size() && gre==v[2].size() && yel==v[3].size()){
    		//return tut;
    		stop=true;
    		cev=min(cev,tut);
    		return ;
    	}
    	//cout<<red<<" "<<gre<<" "<<yel<<" "<<sira<<" "<<tut<<" "<<renk<<" "<<st<<endl;
    	//if(~dp[sira][red][gre][yel])return dp[sira][red][gre][yel];
    	int yum=LLONG_MAX;
    	if(renk!=1 && red<v[1].size()){
    		//cout<<"r"<<red<<" "<<gre<<" "<<yel<<" "<<sira<<" "<<tut<<" "<<abs(v[1][red]-sira)<<" "<<st+'R'<<endl;
    		//yum=min(yum,dpp(red+1,gre,yel,sira+1,1,tut+abs(v[1][red]-sira),st+'R'));
    		dpp(red+1,gre,yel,sira+1,1,tut+abs(v[1][red]-sira),st+'R');
    	}
    	if(renk!=2 && gre<v[2].size()){
    		//cout<<"g"<<red<<" "<<gre<<" "<<yel<<" "<<sira<<" "<<tut<<" "<<abs(v[2][gre]-sira)<<" "<<st+'G'<<endl;
    		//yum=min(yum,dpp(red,gre+1,yel,sira+1,2,tut+abs(v[2][gre]-sira),st+'G'));	
    		dpp(red,gre+1,yel,sira+1,2,tut+abs(v[2][gre]-sira),st+'G');
    	}
    	if(renk!=3 && yel<v[3].size()){
    		//cout<<"y"<<red<<" "<<gre<<" "<<yel<<" "<<sira<<" "<<tut<<" "<<abs(v[3][yel]-sira)<<" "<<st+'Y'<<endl;
    		//yum=min(yum,dpp(red,gre,yel+1,sira+1,3,tut+abs(v[3][yel]-sira),st+'Y'));
    		dpp(red,gre,yel+1,sira+1,3,tut+abs(v[3][yel]-sira),st+'Y');
    	}
    	//return dp[sira][red][gre][yel]=yum;
    }
     
    int32_t main(){
    	faster
    	memset(dp,-1,sizeof(dp));
    	cin>>n;
    	string s;cin>>s;
    	for(int i=0;i<n;i++){
    		if(s[i]=='R')v[1].push_back(i+1);
    		else if(s[i]=='G')v[2].push_back(i+1);
    		else v[3].push_back(i+1);
    	}
    	string h="";
    	int tt=(n+1)/2;
    	if(v[1].size()>tt || v[2].size()>tt || v[3].size()>tt || !stop){cout<<-1<<'\n';return 0;}
    	//cout<<dpp(0,0,0,1,0,0,h)<<'\n';
    	dpp(0,0,0,1,0,0,h);
    	if(cev==LLONG_MAX){
    		cev=-2;
    	}
    	cout<<cev/2<<'\n';
    	return 0;
    }

Compilation message

joi2019_ho_t3.cpp: In function 'void dpp(long long int, long long int, long long int, long long int, long long int, long long int, std::string)':
joi2019_ho_t3.cpp:18:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |      if(red==v[1].size() && gre==v[2].size() && yel==v[3].size()){
      |         ~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:18:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |      if(red==v[1].size() && gre==v[2].size() && yel==v[3].size()){
      |                             ~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:18:52: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |      if(red==v[1].size() && gre==v[2].size() && yel==v[3].size()){
      |                                                 ~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:27:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |      if(renk!=1 && red<v[1].size()){
      |                    ~~~^~~~~~~~~~~~
joi2019_ho_t3.cpp:32:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |      if(renk!=2 && gre<v[2].size()){
      |                    ~~~^~~~~~~~~~~~
joi2019_ho_t3.cpp:37:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |      if(renk!=3 && yel<v[3].size()){
      |                    ~~~^~~~~~~~~~~~
joi2019_ho_t3.cpp:26:10: warning: unused variable 'yum' [-Wunused-variable]
   26 |      int yum=LLONG_MAX;
      |          ^~~
joi2019_ho_t3.cpp: In function 'int32_t main()':
joi2019_ho_t3.cpp:57:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   57 |      if(v[1].size()>tt || v[2].size()>tt || v[3].size()>tt || !stop){cout<<-1<<'\n';return 0;}
      |         ~~~~~~~~~~~^~~
joi2019_ho_t3.cpp:57:38: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   57 |      if(v[1].size()>tt || v[2].size()>tt || v[3].size()>tt || !stop){cout<<-1<<'\n';return 0;}
      |                           ~~~~~~~~~~~^~~
joi2019_ho_t3.cpp:57:56: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   57 |      if(v[1].size()>tt || v[2].size()>tt || v[3].size()>tt || !stop){cout<<-1<<'\n';return 0;}
      |                                             ~~~~~~~~~~~^~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 140124 KB Output is correct
2 Correct 19 ms 140128 KB Output is correct
3 Correct 20 ms 140116 KB Output is correct
4 Correct 19 ms 140124 KB Output is correct
5 Correct 20 ms 140108 KB Output is correct
6 Correct 19 ms 140116 KB Output is correct
7 Correct 20 ms 140124 KB Output is correct
8 Correct 19 ms 140124 KB Output is correct
9 Correct 19 ms 140124 KB Output is correct
10 Correct 19 ms 140124 KB Output is correct
11 Incorrect 20 ms 139992 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 140124 KB Output is correct
2 Correct 19 ms 140128 KB Output is correct
3 Correct 20 ms 140116 KB Output is correct
4 Correct 19 ms 140124 KB Output is correct
5 Correct 20 ms 140108 KB Output is correct
6 Correct 19 ms 140116 KB Output is correct
7 Correct 20 ms 140124 KB Output is correct
8 Correct 19 ms 140124 KB Output is correct
9 Correct 19 ms 140124 KB Output is correct
10 Correct 19 ms 140124 KB Output is correct
11 Incorrect 20 ms 139992 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 140120 KB Output is correct
2 Correct 21 ms 140380 KB Output is correct
3 Correct 20 ms 140376 KB Output is correct
4 Correct 20 ms 140380 KB Output is correct
5 Correct 19 ms 140380 KB Output is correct
6 Correct 20 ms 140372 KB Output is correct
7 Correct 19 ms 140376 KB Output is correct
8 Correct 20 ms 140380 KB Output is correct
9 Correct 19 ms 140204 KB Output is correct
10 Correct 20 ms 140632 KB Output is correct
11 Correct 19 ms 140356 KB Output is correct
12 Correct 20 ms 140124 KB Output is correct
13 Correct 18 ms 140124 KB Output is correct
14 Correct 20 ms 140120 KB Output is correct
15 Correct 20 ms 140124 KB Output is correct
16 Correct 20 ms 140116 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 140124 KB Output is correct
2 Correct 19 ms 140128 KB Output is correct
3 Correct 20 ms 140116 KB Output is correct
4 Correct 19 ms 140124 KB Output is correct
5 Correct 20 ms 140108 KB Output is correct
6 Correct 19 ms 140116 KB Output is correct
7 Correct 20 ms 140124 KB Output is correct
8 Correct 19 ms 140124 KB Output is correct
9 Correct 19 ms 140124 KB Output is correct
10 Correct 19 ms 140124 KB Output is correct
11 Incorrect 20 ms 139992 KB Output isn't correct
12 Halted 0 ms 0 KB -