Skip to content

Instantly share code, notes, and snippets.

View MagallanesFito's full-sized avatar

Adolfo Fragoso Magallanes MagallanesFito

View GitHub Profile
@MagallanesFito
MagallanesFito / La combi de César.cpp
Created March 3, 2016 03:48
Solución preselectivo IOI
#include <iostream>
#include <cmath>
#define MAX_N 505
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int N;
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
bool visitado[MAX_N][MAX_N];
int Mapa[MAX_N][MAX_N];
@MagallanesFito
MagallanesFito / Super-Agente.cpp
Created March 3, 2016 03:55
Super-Agente OMI 2012
#include <iostream>
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
#define MAX_N 2005
using namespace std;
typedef struct coord{
short x;
short y;
}Coord;
@MagallanesFito
MagallanesFito / Proyectiles.cpp
Created September 30, 2016 06:13
Proyectiles: Curso Profesores Intermedio OMI
#include <iostream>
#include <algorithm>
using namespace std;
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
#define MAX_NAVES 100002
#define MAX_K 1002
typedef unsigned long int UL;
struct punto{
UL x;
@MagallanesFito
MagallanesFito / Bombas y detonadores.cpp
Created September 30, 2016 06:14
Bombas y detonadores: Curso Intermedio profesores OMI
#include <iostream>
using namespace std;
#define MAX_LETRAS 26
int MapaMexicanos[MAX_LETRAS];
int MapaColombianos[MAX_LETRAS];
int Costos[MAX_LETRAS];
string letras = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int getNumLetra(char a){
@MagallanesFito
MagallanesFito / Direc.cpp
Last active October 3, 2016 01:06
Direc Curso profesores Intermedio OMI
#include <iostream>
using namespace std;
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
#define MAX_ROWS 1001
int M[MAX_ROWS][MAX_ROWS];
int T[MAX_ROWS][MAX_ROWS];
int suma(int a,int b,int q,int r){
@MagallanesFito
MagallanesFito / Cena.cpp
Created October 3, 2016 01:02
Cena | Curso Intermedio Profesores OMI 2016
#include <iostream>
#define MAX_N 30002
using namespace std;
int N[MAX_N];
int main(){
int n;
cin>>n;
int cont = 0;
for(int i=0;i<n;i++){
@MagallanesFito
MagallanesFito / Nebulosas.cpp
Created October 4, 2016 05:57
Nebulosas | Curso Avanzado Profesores OMI 2016
#include <iostream>
#include <algorithm>
#include <queue>
#define MAX_ROWS 502
#define MAX_ADY 4
#define INF 1
using namespace std;
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
@MagallanesFito
MagallanesFito / Noticias.cpp
Created October 6, 2016 07:07
Noticias | Curso Avanzado Profesores OMI 2016
#include <iostream>
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
#define MAX_NODOS 1000002
int Parent[MAX_NODOS];
int PersonasConocidas[MAX_NODOS];
using namespace std;
int Find(int x){
if(Parent[x] ==x) return x;
@MagallanesFito
MagallanesFito / Pulseras.cpp
Last active November 1, 2016 07:19
Solución a pulseras omegaUP
#include <iostream>
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD 1000000007
using namespace std;
typedef long long ULL;
ULL formas(ULL N){
ULL Bant = 2;
ULL Bpost = 3;
ULL Nant = 1;
@MagallanesFito
MagallanesFito / Leonidas vs xerxes.cpp
Created January 10, 2017 02:23
Hacker Earth: Spartans: Leonidas VS Xerxes
/**
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick-binary-indexed-trees/practice-problems/algorithm/spartans-leonidas-vs-xerxes-monk/
*/
#include <iostream>
#define MAX_N 100002
#define op_io ios_base::sync_with_stdio(0);cin.tie(0);
int Soldiers[MAX_N];
int segTree[3*MAX_N];
using namespace std;