Problemas de Codility | Isaac Lozano Osorio

CODILITY_A-T3CHFEST_2019 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CODILITY_A-T3CHFEST_2019

#include <bits/stdc++.h>
using namespace std;

int gcd(int a, int b) {
 while (b > 0)
 {
 int temp = b;
 b = a % b;
 a = temp;
 }
 return a;
}

int solution(int N,int M)
{
 return N/gcd(N, M);
}
int main()
{
 int M = 20;
 for(int i=1; i<M;i++)
 for(int j=1; j<M;j++)
 printf("%d\n",solution(i,j));
 return 0;
}

CODILITY_B-T3CHFEST_2019 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CODILITY_B-T3CHFEST_2019

#include <bits/stdc++.h>
using namespace std;

int solution(vector<int> &H)
{
 int res = 0;
 stack<int> sol;
 for (unsigned int i=0; i<H.size();i++)
 {
 while(!sol.empty() && sol.top() > H[i])
 {
 sol.pop();
 }
 if(!sol.empty() && sol.top() == H[i])
 {
 continue;
 }
 sol.push(H[i]);
 res+=1;
 }
 return res;
}
int main()
{
 for(int i=0; i<20;i++)
 {
 vector<int> V = {i,i+1,i+2,i+3,i+4,i+5,i+6,i+7,i+8};
 printf("%d\n",solution(V));
 }
 return 0;
}

CODILITY_C-T3CHFEST_2019 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CODILITY_C-T3CHFEST_2019

#include<bits/stdc++.h>
using namespace std;

void printN(int i,vector<int> &A)
{
 if((unsigned)i==A.size()-1)
 {
 cout<<"Octal: ";
 for(int i=A.size()-1; i>=0;i--) cout<<A[i];
 cout<<'\n';
 }
 if(A[i]==0) cout<<"000";
 else if(A[i]==1) cout<<"001";
 else if(A[i]==2) cout<<"010";
 else if(A[i]==3) cout<<"011";
 else if(A[i]==4) cout<<"100";
 else if(A[i]==5) cout<<"101";
 else if(A[i]==6) cout<<"110";
 else if(A[i]==7) cout<<"111";
 else{ cout<<"\nInvalid octal digit "<<A[i]; return ;}
}
int solution(vector<int> &A) {
 int res = 0;
 for(int i=A.size()-1; i>=0;i--)
 {
 printN(i,A);
 if(A[i]==0) continue;
 else if(A[i]==1) res++;
 else if(A[i]==2) res++;
 else if(A[i]==3) res+=2;
 else if(A[i]==4) res++;
 else if(A[i]==5) res+=2;
 else if(A[i]==6) res+=2;
 else if(A[i]==7) res+=3;
 }
 return res;
}
int main()
{
 vector<int> arr;
 int n = 0;
 for(int i=0; i<n;i++)
 for(int j=0; j<8;j++)
 {
 if(j==0) arr.push_back(j);
 else arr[i]=j;
 printf("\n%d\n",solution(arr));
 }
 arr = {1,5,6};
 printf("\n%d\n",solution(arr));
 arr = {6,5,1};
 printf("\n%d\n",solution(arr));
 return 0;
}

CODILITY_D-T3CHFEST_2019 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CODILITY_D-T3CHFEST_2019

#include <bits/stdc++.h>
using namespace std;

int solution(vector<int> &A)
{
 bool possibleTrip[31]; memset(possibleTrip,false,sizeof(possibleTrip));
 for (auto dayWithTrip : A) possibleTrip[dayWithTrip] = true;
 int minCostPerDay[31];
 minCostPerDay[0] = 0;
 for (int d = 1; d <= 30; d++) {
 if (!possibleTrip[d]) {
 minCostPerDay[d] = minCostPerDay[d-1];
 continue;
 }
 int minCost = minCostPerDay[d-1] + 2; // Possibility #1: one-day pass on day d
 minCost = min(minCost, minCostPerDay[max(0, d-7)] + 7); // Possibility #2: seven-day pass ending on or after day d
 minCost = min(minCost, 25); // Possibility #3: 30-day pass for the whole period
 minCostPerDay[d] = minCost;
 }
 return minCostPerDay[30];
}

int main()
{
 vector<int> A; //Caso base
 int res = solution(A);
 printf("%d\n",res);
 A = {1, 2, 4, 5,7, 29,30}; //Caso de prueba
 res = solution(A);
 printf("%d\n",res);
 A = {1,2,3,4,5,6,8}; //Caso random
 res = solution(A);
 printf("%d\n",res);
 A = {1,2,3,4,5,6,7}; //Caso random
 res = solution(A);
 printf("%d\n",res);
 A = {1,2,3,4,5,6}; //Caso random
 res = solution(A);
 printf("%d\n",res);
 A = {1,2,3,4,5,6,7,9}; //Caso random
 res = solution(A);
 printf("%d\n",res);
 for(int i=1; i<30;i++)
 {
 A = {i};
 int res = solution(A);
 printf("%d\n",res);
 printf("Valores: %d\n",i);
 for(int i1=i+1; i1<30;i1++)
 {
 A = {i,i1};
 int res = solution(A);
 printf("%d\n",res);
 printf("Valores: %d, %d\n",i,i1);
 for(int i2=i1+1; i2<30;i2++)
 {
 A = {i,i1,i2};
 int res = solution(A);
 printf("%d\n",res);
 printf("Valores: %d, %d, %d\n",i,i1,i2);

 for(int i3=i2+1; i3<30;i3++)
 {
 A = {i,i1,i2,i3};
 int res = solution(A);
 printf("%d\n",res);
 printf("Valores: %d, %d, %d, %d\n",i,i1,i2,i3);
 }
 }
 }
 }
 return 0;
}

CODILITY_F-T3CHFEST_2019 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CODILITY_F-T3CHFEST_2019

#include <bits/stdc++.h>
using namespace std;

struct state{
 int x,y,x1,y1,s;
 bool operator<(const state &other)const{ return
 s < other.s; }
};
int sx[]={1,-1,0,0}; //4 directions
int sy[]={0,0,1,-1};
int aux[305][305];
bool visited[305][305];

void preProcess(vector<vector<bool>> &mat)
{
 int M = mat.size();
 int N = mat[0].size();
 for (int i=0; i<N; i++)
 aux[0][i] = mat[0][i];
 for (int i=1; i<M; i++)
 for (int j=0; j<N; j++)
 aux[i][j] = mat[i][j] + aux[i-1][j];
 for (int i=0; i<M; i++)
 for (int j=1; j<N; j++)
 aux[i][j] += aux[i][j-1];
}

int sumQuery(int tli, int tlj, int rbi, int rbj)
{
 int res = aux[rbi][rbj];
 if (tli > 0) res = res - aux[tli-1][rbj];
 if (tlj > 0) res = res - aux[rbi][tlj-1];
 if (tli > 0 && tlj > 0) res = res + aux[tli-1][tlj-1];
 return res;
}
void check(vector<vector<bool>> &A)
{
 int M = A.size();
 int N = A[0].size();
 for (int i=0; i<M; i++)
 {
 for (int j=0; j<N; j++)
 printf("%d ",aux[i][j]);
 printf("\n");
 }
}

int solution(vector<vector<bool> > &A)
{
 preProcess(A); //Preprocesar en matriz auxiliar el calculo para tener en O(1) si cabe o no
 //check(A);
 int N = A.size(),M=A[0].size();
 if(!A[0][0]) return 0;
 int x = 1;
 while(x<N && x<M && sumQuery(0,0,x,x)==((x+1)*(x+1))) x++;
 priority_queue<state> Q; Q.push({0,0,x-1,x-1,x});
 memset(visited,false,sizeof(visited));
 int res = 0;
 while(!Q.empty())
 {
 state cur = Q.top(); Q.pop();
 if(cur.x1==N-1 && cur.y1 == M-1) res = max(cur.s,res);
 else
 {
 for(int i=0; i<4;i++)
 {
 int I=sx[i]+cur.x;
 int J=sy[i]+cur.y;
 int I1=sx[i]+cur.x1;
 int J1=sy[i]+cur.y1;
 if(I>=0 && I1<N && J>=0 && J1<M && !visited[I][J]){
 if(cur.s<=res) return res;
 if(sumQuery(I,J,I1,J1)==(cur.s*cur.s))
 {
 visited[I][J]=true;
 Q.push({I,J,I1,J1,cur.s});
 }
 else{
 int n = cur.s;
 while(n>0 && sumQuery(I,J,I1,J1)!=(n*n)) {
 n--; I1--; J1--;
 }
 if(n>0)
 {
 visited[I][J]=true;
 Q.push({I,J,I1,J1,n});
 }
 }
 }
 }
 }
 }
 return res;
}

int main()
{ // 0 1 2 3
 vector<vector<bool>> matrix = {{1,1,1,0}, //0
 {1,1,1,0}, //1
 {1,1,1,0}, //2
 {1,1,1,1}, //3
 {0,1,1,1}, //4
 {1,0,1,1}}; //5
 printf("%d\n",solution(matrix)); //2
 matrix = {{1,1,0,0},
 {1,0,0,0},
 {0,1,0,1}};
 printf("%d\n",solution(matrix)); //0
 matrix = {{1}};
 printf("%d\n",solution(matrix)); //1
 matrix = {{1,1,1,0},
 {1,1,1,0},
 {1,1,1,0},
 {1,1,0,1},
 {0,1,1,1},
 {1,0,1,1}};
 printf("%d\n",solution(matrix)); //1
 matrix = {{1,1,1,0},
 {1,1,1,0},
 {1,1,1,0},
 {1,1,0,1},
 {0,1,0,1},
 {1,0,0,1}};
 printf("%d\n",solution(matrix)); //0
 matrix = {{0}};
 printf("%d\n",solution(matrix)); //0
 matrix = {{1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {1,1,1,1}};
 printf("%d\n",solution(matrix)); //4
 matrix = {{1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {1,1,1,0}};
 printf("%d\n",solution(matrix)); //0
 matrix = {{1,1,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {0,1,1,1},
 {0,1,1,1},
 {0,1,1,1}};
 printf("%d\n",solution(matrix)); //3
 matrix = {{1,0,1,1},
 {1,1,1,1},
 {1,1,1,1},
 {0,1,1,1},
 {0,1,1,1},
 {0,1,1,1}};
 printf("%d\n",solution(matrix)); //1
 matrix ={{1,1,1,1,0},
 {1,1,1,1,1},
 {0,1,1,1,0},
 {0,1,1,1,1},
 {0,1,1,0,1},
 {0,1,1,0,0},
 {0,1,1,1,1},
 {0,1,1,1,1}};
 printf("%d\n",solution(matrix)); //2
 matrix = {{0},{1}};
 printf("%d\n",solution(matrix)); //0
 matrix = {{1,1},
 {1,1}};
 printf("%d\n",solution(matrix)); //2

 /*
 2
 0
 1
 1
 0
 0
 4
 0
 3
 1
 2
 0
 2
 */
 return 0;
}

CodilityT3chfest1 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CodilityT3chfest1

#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
using namespace std;

int solution(vector<int> &A)
{
int ma=0,mi=INF,res=0,sum=0,first=0,flag;
for(unsigned int i=0; i<A.size();i++){
 if(first==0) { flag=A[0]%2; first=1;}
 else if(flag==0 && A[i]%2!=0) return -1;
 else if(flag==1 && A[i]%2==0) return -1;
 ma=max(ma,A[i]); mi=min(mi,A[i]); sum+=A[i];}
if(ma==mi) return 0;
int sum2=sum/A.size();
if(sum2!=(double)sum/A.size()) sum2++;
res=max(abs(sum2-mi),abs(sum2-ma));
return res;
}
int main()
{
 vector<int> A = {11,3,7,1};
 cout<<solution(A)<<endl;
 A = {2,12,8,6};
 cout<<solution(A)<<endl;
 A = {0,1};
 cout<<solution(A)<<endl;
 A = {11,5,7,1};
 cout<<solution(A)<<endl;
 A = {12,5,1,8};
 cout<<solution(A)<<endl;
 A = {8,5,3,2};
 cout<<solution(A)<<endl;
 A = {1,1,2,2};
 cout<<solution(A)<<endl;
 A = {1,1,1,1};
 cout<<solution(A)<<endl;
 A = {1};
 cout<<solution(A)<<endl;
 return 0;
}

CodilityT3chfest2 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CodilityT3chfest2

#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
using namespace std;

string fi="",se="";
int diff(string C,string T)
{
 int arr[130];
 memset(arr,0,sizeof(arr));
 int res = 0;
 for(unsigned int i=0; i<C.length();i++) arr[(int)C[i]]++;
 for(unsigned int i=0; i<T.length();i++) arr[(int)T[i]]--;
 for(unsigned int i=0; i<C.length();i++) if(arr[(int)C[i]]!=0) res++;
 return res;
}
int orden(string C,string T)
{
 int arr[130];
 memset(arr,0,sizeof(arr));
 int res = 0;
 int ml = min(C.length(),T.length());
 for(int i=0; i<ml;i++) if(arr[(int)C[i]]!=arr[(int)T[i]]) res++;
 return res+abs(C.length()-T.length());
}
int pueden(string C,string T)
{
 int arr[130];
 memset(arr,0,sizeof(arr));
 int res = 0;
 int ml = max(C.length(),T.length());
 for(unsigned int i=0; i<C.length();i++) arr[(int)C[i]]++;
 for(unsigned int i=0; i<T.length();i++) arr[(int)T[i]]--;
 for(int i=0; i<ml;i++) if(arr[(int)C[i]]!=0) res++;
 return res;
}
void cambiar(string C,string T)
{
 int flag = 0;
 for(unsigned int i=0; i<C.length();i++)
 {
 if(C[i]!=T[i]&&flag==0) { fi=C[i]; flag=1;}
 if(C[i]!=T[i]&&flag==1) se=C[i];
 }
}
char insertar(string &C,string &T)
{
 int arr[130];
 memset(arr,0,sizeof(arr));
 for(unsigned int i=0; i<C.length();i++) arr[(int)C[i]]++;
 for(unsigned int i=0; i<T.length();i++) arr[(int)T[i]]--;
 for(unsigned int i=0; i<C.length();i++) if(arr[(int)C[i]]!=0) return C[i];
 return C[0];
}
string solution(string &S,string &T)
{
 int Cl = S.length();
 int Tl = T.length();
 if(S==T) return "NOTHING";
 else if(abs(Cl-Tl)>1) return "IMPOSSIBLE"; //tienen mas de dos de longitud
 else if((pueden(S,T)>1 && Cl!=Tl) || (pueden(S,T)>2 && Cl==Tl) || orden(S,T)>1) return "IMPOSSIBLE"; //se diferencian en ms de dos
 else{
 if(Cl>Tl) {string re = "DELETE ";
 re+=insertar(S,T);
 return re; }
 else if(Cl<Tl){ string re = "INSERT ";
 re+=insertar(T,S);
 return re;
 }
 else {
 if(diff(S,T)!=0) return "IMPOSSIBLE";
 cambiar(S,T);
 string aux = "SWAP "+fi+" "+se;
 return aux;
 }
 }
}
int main()
{
 string a = "nice";
 string b = "niece";
 cout<<solution(a,b)<<'\n';
 a="form"; b="from";
 cout<<solution(a,b)<<'\n';
 a="o"; b="odd";
 cout<<solution(a,b)<<'\n';
 a="prueba"; b="prueba";
 cout<<solution(a,b)<<'\n';
 a="pruebha"; b="prueba";
 cout<<solution(a,b)<<'\n';
 a="asdf"; b="oian";
 cout<<solution(a,b)<<'\n';
 a="ask"; b="an";
 cout<<solution(a,b)<<'\n';
 a="a"; b="ab";
 cout<<solution(a,b)<<'\n';
 a="a"; b="";
 cout<<solution(a,b)<<'\n';
 a="ab"; b="b";
 cout<<solution(a,b)<<'\n';
 a=""; b="";
 cout<<solution(a,b)<<'\n';
 a=""; b="a";
 cout<<solution(a,b)<<'\n';
 a="as"; b="an";
 cout<<solution(a,b)<<'\n';
 a="as"; b="sa";
 cout<<solution(a,b)<<'\n';
 return 0;
}

CodilityT3chfest3 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CodilityT3chfest3

#include <bits/stdc++.h>
#define INF 5000000000
using namespace std;

int solution(int K,vector<int> &A)
{
 if(A.size()<2) return 0;
 sort(A.begin(),A.end());
 int i=0,j=A.size()-1,res=0;
 sort(A.begin(),A.end());
 while(i<=j)
 {
 int aux = A[i]+A[j];
 if(aux==K)
 {
 res++;
 if(i!=j) res++;
 i++;
 }
 else if(aux<K) i++;
 else j--;
 }
 return res;
}
int main()
{
 int k=6;
 vector<int> A = {1,8,-3,0,1,3,-2,4,5};
 cout<<solution(k,A)<<endl;
}

CodilityT3chfest4 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CodilityT3chfest4

#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
using namespace std;

int solution(vector<int> &A)
{
 vector<int> aux = A;
 vector<int> aux2;
 int res = 0,sum=0,re=0;
 sort(aux.begin(),aux.end());
 for(unsigned int i=0; i<aux.size();i++) {sum+=aux[i]; aux2.push_back(sum);}
 for(unsigned int i=0; i<A.size();i++)
 {
 if(aux[i]==A[i]) res++;
 else {
 if(i!=0) re=aux2[i-1];
 int current = A[i];
 while(current!=aux2[i]-re && i<A.size() )
 {
 i++;
 current+=A[i];
 }
 res++;
 }
 }
return res;
}
int main()
{
 //6 2 6 1 1 1 4 4 1 4 2
 vector<int> A = {1,5,4,9,8,7,12,13,14}; //6
 cout<<solution(A)<<endl;
 A = {2,12,8,6}; //2
 cout<<solution(A)<<endl;
 A = {1,6,5,4,9,8,7,10,11,12}; //6
 cout<<solution(A)<<endl;
 A = {11,5,7,1}; //1
 cout<<solution(A)<<endl;
 A = {12,5,1,8}; //1
 cout<<solution(A)<<endl;
 A = {8,5,3,2}; //1
 cout<<solution(A)<<endl;
 A = {1,1,2,2}; //4
 cout<<solution(A)<<endl;
 A = {1,1,1,1}; //4
 cout<<solution(A)<<endl;
 A = {1}; //1
 cout<<solution(A)<<endl;
 A = {2,1,5,6,7}; //2
 cout<<solution(A)<<endl;
 A = {3,1,2,7,6,5};//2
 cout<<solution(A)<<endl;
 return 0;
}

CodilityT3chfest5 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CodilityT3chfest5

#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
using namespace std;

int Index(vector<int> &v, int l, int r, int key) {
 while (r-l > 1) {
 int m = l + (r-l)/2;
 if (v[m] >= key) r = m;
 else l = m;
 }
 return r;
}
int solution(vector<int> &A) {
 if (A.size() == 0) return 0;
 vector<int> tail(A.size(), 0);
 int res = 1;
 tail[0] = A[0];
 for (unsigned int i = 1; i < A.size(); i++) {
 if (A[i] < tail[0]) tail[0] = A[i];
 else if (A[i] > tail[res-1]) tail[res++] = A[i];
 else tail[Index(tail, -1, res-1, A[i])] = A[i];
 }
 return A.size()-res;
}

int main()
{
 vector<int> arr = {1, 9, 3, 10, 4, 20, 2};
 cout << solution(arr)<<endl;
 arr = {1,2,3,1,1,5};
 cout <<solution(arr)<<endl;
 arr = {1};
 cout << solution(arr)<<endl;
 arr = {1,2,3,4,2};
 cout << solution(arr)<<endl;
 return 0;
}

CodilityT3chfest6 — Codility

Mon, 01 Jan 0001 00:00:00 +0000

Solución — CodilityT3chfest6

#include <bits/stdc++.h>
#define INF 5000000000
using namespace std;

int bit(vector<int> A,double radio)
{
 int ret = 0;
 for(unsigned int i=0; i<A.size();i++)
 {
 double pow1 = pow(radio,i*1.0);
 int j = (int)(A[i]*pow1);
 ret+=j;
 }
 return ret;
}
vector<int> itb(int value,double radix)
{
 vector<int> lst;
 while (value!=0) {
 int div = (int)ceil(value/radix);
 int remainder = value % (int)radix;
 value=div;
 lst.push_back(abs(remainder));
 }
 return lst;
}
vector<int> solution(vector<int> &A) {
 if(A.size()==0) { A.push_back(0); return A;}
 if(A.size()==1 && A[0]==0) return A;
 double radio = -2.0;
 int val = bit(A,radio);
 return itb(-val,radio);
}
int main()
{
 vector<int> A = {1,0,0,1,1};
 A=solution(A);
 for(unsigned int i=0; i<A.size();i++) cout<<A[i]<<" ";
 cout<<endl;
 A = {};
 A=solution(A);
 for(unsigned int i=0; i<A.size();i++) cout<<A[i]<<" ";
 cout<<endl;
 A = {1,0,0,1,1,1};
 A=solution(A);
 for(unsigned int i=0; i<A.size();i++) cout<<A[i]<<" ";
 cout<<endl;
 A = {1};
 A=solution(A);
 for(unsigned int i=0; i<A.size();i++) cout<<A[i]<<" ";
 cout<<endl;
 A = {0};
 A=solution(A);
 for(unsigned int i=0; i<A.size();i++) cout<<A[i]<<" ";
 cout<<endl;
}