oj.uz

Submission #239568

# Submission time Handle Problem Language Result Execution time Memory
239568 2020-06-16T12:01:09 Z b00n0rp Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 458 ms 780536 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
	fact[0] = 1;
	FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
	ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
	REPD(i,FACSZ-1){
		ifact[i] = mul(i+1,ifact[i+1],c);
	}
}
 
int ncr(int n,int r,int c = MOD){
	return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
	// (UNCOMMENT FOR CIN/COUT) \
	FAST_IO
	PRECISION(10)
 
	int t = 1;
	// (UNCOMMENT FOR MULTIPLE TEST CASES) \
	sfl(t);
	FOR(testcase,1,t+1){
		// (UNCOMMENT FOR CODEJAM) \
		printf("Case #%lld: ",testcase); 
		solvethetestcase();
	}
}   
 
int n;
int a[405];
int pref[405][3];
int dp[405][405][405][3];
vi gg[3];

void solvethetestcase(){
	sfl(n)
	FOR(i,1,n+1){
		char c;
		cin >> c;
		if(c == 'R') a[i] = 0;
		else if(c == 'G') a[i] = 1;
		else a[i] = 2;
		gg[a[i]].pb(i);
		REP(j,3){
			pref[i][j] = pref[i-1][j];
			if(j == a[i]) pref[i][j]++;
		}
	}
	REP(i,405) REP(j,405) REP(k,405) REP(l,3) dp[i][j][k][l] = INF; 
	FORD(i,n,1){ // [i..n] range
		REP(x,min(i,(int)gg[0].size()+1)){ // x characters of type 0 used
			REP(y,min(i,(int)gg[1].size()+1)){ // y characters of type 1 used
				int z = i-1-x-y; // z characters of type 2 used
				if(z > gg[2].size()) continue;
				if(z < 0) break;
				// trace(i,x,y);
				if(i == n){
					dp[i][x][y][0] = dp[i][x][y][1] = dp[i][x][y][2] = 0;
					if(x != gg[0].size()){
						dp[i][x][y][0] = INF;
					}
					if(y != gg[1].size()){
						dp[i][x][y][1] = INF;
					}
					if(z != gg[2].size()){
						dp[i][x][y][2] = INF;
					}
				}
				else{
    				if(x != gg[0].size()){
    				    int ind = gg[0][x];
    					int p0 = gg[0][x]+max(0,y-pref[ind][1])+max(0,z-pref[ind][2]);
    				// 	trace(x,p0);
    					remin(dp[i][x][y][1],p0-i+dp[i+1][x+1][y][0]);
    					remin(dp[i][x][y][2],p0-i+dp[i+1][x+1][y][0]);
    				}
    				if(y != gg[1].size()){
    				    int ind = gg[1][y];
    					int p1 = gg[1][y]+max(0,x-pref[ind][0])+max(0,z-pref[ind][2]);
    				// 	trace(y,p1);
    					remin(dp[i][x][y][0],p1-i+dp[i+1][x][y+1][1]);
    					remin(dp[i][x][y][2],p1-i+dp[i+1][x][y+1][1]);
    				}
    				if(z != gg[2].size()){
    				    int ind = gg[2][z];
    					int p2 = gg[2][z]+max(0,y-pref[ind][1])+max(0,x-pref[ind][0]);
    				// 	trace(z,p2);
    					remin(dp[i][x][y][1],p2-i+dp[i+1][x][y][2]);
    					remin(dp[i][x][y][0],p2-i+dp[i+1][x][y][2]);
    				}
				}
				if(x == 0 and i > 1) dp[i][x][y][0] = INF;
				if(y == 0 and i > 1) dp[i][x][y][1] = INF;
				if(z == 0 and i > 1) dp[i][x][y][2] = INF;
				// trace(dp[i][x][y][0]);
				// trace(dp[i][x][y][1]);
				// trace(dp[i][x][y][2]);
			}
		}
	}
	int ans = min(min(dp[1][0][0][0],dp[1][0][0][1]),dp[1][0][0][2]);
	if(ans < n*n) pfl(ans)
	else printf("-1\n");
}

Compilation message

joi2019_ho_t3.cpp:4:1: warning: multi-line comment [-Wcomment]
 //(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
 ^
joi2019_ho_t3.cpp:56:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
joi2019_ho_t3.cpp:212:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR CIN/COUT) \
  ^
joi2019_ho_t3.cpp:217:2: warning: multi-line comment [-Wcomment]
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ^
joi2019_ho_t3.cpp:220:3: warning: multi-line comment [-Wcomment]
   // (UNCOMMENT FOR CODEJAM) \
   ^
joi2019_ho_t3.cpp: In function 'void solvethetestcase()':
joi2019_ho_t3.cpp:95:31: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
 #define sfl(x) scanf("%lld",&x);
                             ~~^~~
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 #define sfs(x) scanf("%s",x);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
 #define sfs2(x,y) scanf("%s%s",x,y);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 // ----</SCANF>-----
 ~~~~~~~~~~~~~~~~~~~~~          
  
  ~                             
 // ----<PRINTF>-----
 ~~~~~~~~~~~~~~~~~~~~~          
 #define pfi(x) printf("%d\n",x);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define pfi2(x,y) printf("%d %d\n",x,y);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 #define pfl(x) printf("%lld\n",x);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define pfl2(x,y) printf("%lld %lld\n",x,y);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 #define pfs(x) printf("%s\n",x);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define pfs2(x,y) printf("%s %s\n",x,y);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 #define pwe(x) printf("%lld ",x); // print without end
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 // ----</PRINTF>----
 ~~~~~~~~~~~~~~~~~~~~~          
  
  ~                             
 #define FLSH fflush(stdout)
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~   
 #define fileIO(name) \
 ~~~~~~~~~~~~~~~~~~~~~~~        
     freopen(name".in", "r", stdin); \
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
     freopen(name".out", "w", stdout);
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define PRECISION(x) cout << fixed << setprecision(x); 
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 // ----------------</Defines and typedefs>----------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 // -------------------<Debugging stuff>-------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define TRACE
 ~~~~~~~~~~~~~~                 
  
  ~                             
 #ifdef TRACE
 ~~~~~~~~~~~~~                  
 #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template <typename Arg1>
 ~~~~~~~~~~~~~~~~~~~~~~~~~      
 void __f(const char* name, Arg1&& arg1){
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  cerr << name << " : " << arg1 << std::endl;
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 }
 ~~                             
 template <typename Arg1, typename... Args>
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 void __f(const char* names, Arg1&& arg1, Args&&... args){
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 }
 ~~                             
 #else
 ~~~~~~                         
 #define trace(...)
 ~~~~~~~~~~~~~~~~~~~            
 #endif
 ~~~~~~~                        
  
  ~                             
 // ------------------</Debugging stuff>-------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 // ------------------------<Consts>-----------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 const int MAXN = 1000005;
 ~~~~~~~~~~~~~~~~~~~~~~~~~~     
 const int SQRTN = 1003;
 ~~~~~~~~~~~~~~~~~~~~~~~~       
 const int LOGN = 22;
 ~~~~~~~~~~~~~~~~~~~~~          
 const double PI=acos(-1);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~     
  
  ~                             
 #ifdef int
 ~~~~~~~~~~~                    
 const int INF=1e16;
 ~~~~~~~~~~~~~~~~~~~~           
 #else
 ~~~~~~                         
 const int INF=1e9;
 ~~~~~~~~~~~~~~~~~~~            
 #endif
 ~~~~~~~                        
  
  ~                             
 const int MOD = 1000000007;
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~   
 const int FMOD = 998244353;
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~   
 const double eps = 1e-9;
 ~~~~~~~~~~~~~~~~~~~~~~~~~      
  
  ~                             
 // -----------------------</Consts>-----------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 // -------------------------<RNG>-------------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 #define SHUF(v) shuffle(all(v), RNG);
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 // Use mt19937_64 for 64 bit random numbers.
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 // ------------------------</RNG>-------------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 // ----------------------<MATH>---------------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 const int FACSZ = 1; // Make sure to change this
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 int fact[FACSZ],ifact[FACSZ];
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
  
  ~                             
 void precom(int c = MOD){
 ~~~~~~~~~~~~~~~~~~~~~~~~~~     
  fact[0] = 1;
  ~~~~~~~~~~~~~                 
  FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  REPD(i,FACSZ-1){
  ~~~~~~~~~~~~~~~~~             
   ifact[i] = mul(i+1,ifact[i+1],c);
   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  }
  ~~                            
 }
 ~~                             
  
  ~                             
 int ncr(int n,int r,int c = MOD){
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 } 
 ~~~                            
 // ----------------------</MATH>--------------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 // --------------------------------------------------</TEMPLATE>--------------------------------------------------
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  
  ~                             
 void solvethetestcase();
 ~~~~~~~~~~~~~~~~~~~~~~~~~      
  
  ~                             
 signed main(){
 ~~~~~~~~~~~~~~~                
  // (UNCOMMENT FOR CIN/COUT) \
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  FAST_IO
  ~~~~~~~~                      
  PRECISION(10)
  ~~~~~~~~~~~~~~                
  
  ~                             
  int t = 1;
  ~~~~~~~~~~~                   
  // (UNCOMMENT FOR MULTIPLE TEST CASES) \
  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  sfl(t);
  ~~~~~~~~                      
  FOR(testcase,1,t+1){
  ~~~~~~~~~~~~~~~~~~~~~         
   // (UNCOMMENT FOR CODEJAM) \
   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   printf("Case #%lld: ",testcase); 
   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   solvethetestcase();
   ~~~~~~~~~~~~~~~~~~~~         
  }
  ~~                            
 }   
 ~~~~~                          
  
  ~                             
 int n;
 ~~~~~~~                        
 int a[405];
 ~~~~~~~~~~~~                   
 int pref[405][3];
 ~~~~~~~~~~~~~~~~~~             
 int dp[405][405][405][3];
 ~~~~~~~~~~~~~~~~~~~~~~~~~~     
 vi gg[3];
 ~~~~~~~~~~                     
 
 ~                              
 void solvethetestcase(){
 ~~~~~~~~~~~~~~~~~~~~~~~~~      
  sfl(n)
  ~~~~~                         
joi2019_ho_t3.cpp:233:2: note: in expansion of macro 'sfl'
  sfl(n)
  ^~~
joi2019_ho_t3.cpp:251:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(z > gg[2].size()) continue;
        ~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:256:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(x != gg[0].size()){
         ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:259:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(y != gg[1].size()){
         ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:262:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(z != gg[2].size()){
         ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:267:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(x != gg[0].size()){
            ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:274:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(y != gg[1].size()){
            ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:281:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(z != gg[2].size()){
            ~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:112:33: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
 #define pfl(x) printf("%lld\n",x);
                                 ^
joi2019_ho_t3.cpp:299:16: note: in expansion of macro 'pfl'
  if(ans < n*n) pfl(ans)
                ^~~
joi2019_ho_t3.cpp:95:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
joi2019_ho_t3.cpp:233:2: note: in expansion of macro 'sfl'
  sfl(n)
  ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 780280 KB Output is correct
2 Correct 384 ms 780408 KB Output is correct
3 Correct 389 ms 780280 KB Output is correct
4 Correct 380 ms 780276 KB Output is correct
5 Correct 379 ms 780304 KB Output is correct
6 Correct 377 ms 780408 KB Output is correct
7 Correct 375 ms 780352 KB Output is correct
8 Correct 373 ms 780536 KB Output is correct
9 Correct 390 ms 780396 KB Output is correct
10 Correct 406 ms 780280 KB Output is correct
11 Correct 384 ms 780280 KB Output is correct
12 Correct 370 ms 780280 KB Output is correct
13 Correct 393 ms 780380 KB Output is correct
14 Correct 411 ms 780280 KB Output is correct
15 Correct 412 ms 780412 KB Output is correct
16 Correct 370 ms 780280 KB Output is correct
17 Correct 370 ms 780280 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 780280 KB Output is correct
2 Correct 384 ms 780408 KB Output is correct
3 Correct 389 ms 780280 KB Output is correct
4 Correct 380 ms 780276 KB Output is correct
5 Correct 379 ms 780304 KB Output is correct
6 Correct 377 ms 780408 KB Output is correct
7 Correct 375 ms 780352 KB Output is correct
8 Correct 373 ms 780536 KB Output is correct
9 Correct 390 ms 780396 KB Output is correct
10 Correct 406 ms 780280 KB Output is correct
11 Correct 384 ms 780280 KB Output is correct
12 Correct 370 ms 780280 KB Output is correct
13 Correct 393 ms 780380 KB Output is correct
14 Correct 411 ms 780280 KB Output is correct
15 Correct 412 ms 780412 KB Output is correct
16 Correct 370 ms 780280 KB Output is correct
17 Correct 370 ms 780280 KB Output is correct
18 Correct 408 ms 780408 KB Output is correct
19 Correct 418 ms 780488 KB Output is correct
20 Correct 414 ms 780408 KB Output is correct
21 Correct 381 ms 780280 KB Output is correct
22 Correct 378 ms 780280 KB Output is correct
23 Correct 377 ms 780408 KB Output is correct
24 Correct 382 ms 780280 KB Output is correct
25 Correct 407 ms 780280 KB Output is correct
26 Correct 403 ms 780408 KB Output is correct
27 Correct 367 ms 780280 KB Output is correct
28 Correct 404 ms 780356 KB Output is correct
29 Correct 409 ms 780280 KB Output is correct
30 Correct 415 ms 780408 KB Output is correct
31 Correct 388 ms 780280 KB Output is correct
32 Correct 414 ms 780280 KB Output is correct
33 Correct 373 ms 780280 KB Output is correct
34 Correct 377 ms 780280 KB Output is correct
35 Correct 373 ms 780292 KB Output is correct
36 Correct 406 ms 780408 KB Output is correct
37 Correct 390 ms 780408 KB Output is correct
38 Correct 416 ms 780280 KB Output is correct
39 Correct 371 ms 780284 KB Output is correct
40 Correct 375 ms 780280 KB Output is correct
41 Correct 410 ms 780280 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 780408 KB Output is correct
2 Correct 390 ms 780280 KB Output is correct
3 Correct 391 ms 780280 KB Output is correct
4 Correct 423 ms 780408 KB Output is correct
5 Correct 395 ms 780408 KB Output is correct
6 Correct 426 ms 780408 KB Output is correct
7 Correct 416 ms 780376 KB Output is correct
8 Correct 389 ms 780408 KB Output is correct
9 Correct 398 ms 780408 KB Output is correct
10 Correct 421 ms 780408 KB Output is correct
11 Correct 406 ms 780408 KB Output is correct
12 Correct 400 ms 780408 KB Output is correct
13 Correct 411 ms 780408 KB Output is correct
14 Correct 402 ms 780392 KB Output is correct
15 Correct 390 ms 780408 KB Output is correct
16 Correct 409 ms 780272 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 780280 KB Output is correct
2 Correct 384 ms 780408 KB Output is correct
3 Correct 389 ms 780280 KB Output is correct
4 Correct 380 ms 780276 KB Output is correct
5 Correct 379 ms 780304 KB Output is correct
6 Correct 377 ms 780408 KB Output is correct
7 Correct 375 ms 780352 KB Output is correct
8 Correct 373 ms 780536 KB Output is correct
9 Correct 390 ms 780396 KB Output is correct
10 Correct 406 ms 780280 KB Output is correct
11 Correct 384 ms 780280 KB Output is correct
12 Correct 370 ms 780280 KB Output is correct
13 Correct 393 ms 780380 KB Output is correct
14 Correct 411 ms 780280 KB Output is correct
15 Correct 412 ms 780412 KB Output is correct
16 Correct 370 ms 780280 KB Output is correct
17 Correct 370 ms 780280 KB Output is correct
18 Correct 408 ms 780408 KB Output is correct
19 Correct 418 ms 780488 KB Output is correct
20 Correct 414 ms 780408 KB Output is correct
21 Correct 381 ms 780280 KB Output is correct
22 Correct 378 ms 780280 KB Output is correct
23 Correct 377 ms 780408 KB Output is correct
24 Correct 382 ms 780280 KB Output is correct
25 Correct 407 ms 780280 KB Output is correct
26 Correct 403 ms 780408 KB Output is correct
27 Correct 367 ms 780280 KB Output is correct
28 Correct 404 ms 780356 KB Output is correct
29 Correct 409 ms 780280 KB Output is correct
30 Correct 415 ms 780408 KB Output is correct
31 Correct 388 ms 780280 KB Output is correct
32 Correct 414 ms 780280 KB Output is correct
33 Correct 373 ms 780280 KB Output is correct
34 Correct 377 ms 780280 KB Output is correct
35 Correct 373 ms 780292 KB Output is correct
36 Correct 406 ms 780408 KB Output is correct
37 Correct 390 ms 780408 KB Output is correct
38 Correct 416 ms 780280 KB Output is correct
39 Correct 371 ms 780284 KB Output is correct
40 Correct 375 ms 780280 KB Output is correct
41 Correct 410 ms 780280 KB Output is correct
42 Correct 388 ms 780408 KB Output is correct
43 Correct 390 ms 780280 KB Output is correct
44 Correct 391 ms 780280 KB Output is correct
45 Correct 423 ms 780408 KB Output is correct
46 Correct 395 ms 780408 KB Output is correct
47 Correct 426 ms 780408 KB Output is correct
48 Correct 416 ms 780376 KB Output is correct
49 Correct 389 ms 780408 KB Output is correct
50 Correct 398 ms 780408 KB Output is correct
51 Correct 421 ms 780408 KB Output is correct
52 Correct 406 ms 780408 KB Output is correct
53 Correct 400 ms 780408 KB Output is correct
54 Correct 411 ms 780408 KB Output is correct
55 Correct 402 ms 780392 KB Output is correct
56 Correct 390 ms 780408 KB Output is correct
57 Correct 409 ms 780272 KB Output is correct
58 Correct 415 ms 780280 KB Output is correct
59 Correct 433 ms 780280 KB Output is correct
60 Correct 431 ms 780412 KB Output is correct
61 Correct 458 ms 780280 KB Output is correct
62 Correct 405 ms 780408 KB Output is correct
63 Correct 401 ms 780280 KB Output is correct
64 Correct 435 ms 780536 KB Output is correct
65 Correct 434 ms 780408 KB Output is correct
66 Correct 417 ms 780384 KB Output is correct
67 Correct 420 ms 780256 KB Output is correct
68 Correct 414 ms 780408 KB Output is correct
69 Correct 419 ms 780280 KB Output is correct
70 Correct 426 ms 780412 KB Output is correct
71 Correct 419 ms 780280 KB Output is correct
72 Correct 388 ms 780384 KB Output is correct
73 Correct 371 ms 780340 KB Output is correct