More DMOJ files

Author: IvanIsCoding

DMOJ/apio10p1.cpp

@@ -0,0 +1,73 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+using namespace std;
+typedef long long ll;
+vector<ll> M,B;
+int pointer;
+bool bad(int l1,int l2,int l3)
+{
+	/*
+	intersection(l1,l2) has x-coordinate (b1-b2)/(m2-m1)
+	intersection(l1,l3) has x-coordinate (b1-b3)/(m3-m1)
+	set the former greater than the latter, and cross-multiply to
+	eliminate division
+	*/
+	return (B[l3]-B[l1])*(M[l1]-M[l2])<(B[l2]-B[l1])*(M[l1]-M[l3]);
+}
+//Adds a new line (with lowest slope) to the structure
+void add(long long m,long long b)
+{
+	//First, let's add it to the end
+	m *= -1;
+	b *= -1;
+	M.push_back(m);
+	B.push_back(b);
+	//If the penultimate is now made irrelevant between the antepenultimate
+	//and the ultimate, remove it. Repeat as many times as necessary
+	while (M.size()>=3&&bad(M.size()-3,M.size()-2,M.size()-1))
+	{
+		M.erase(M.end()-2);
+		B.erase(B.end()-2);
+	}
+}
+//Returns the minimum y-coordinate of any intersection between a given vertical
+//line and the lower envelope
+long long query(long long x)
+{
+	//If we removed what was the best line for the previous query, then the
+	//newly inserted line is now the best for that query
+	if (pointer>=M.size())
+		pointer=M.size()-1;
+	//Any better line must be to the right, since query values are
+	//non-decreasing
+	while (pointer<M.size()-1&&
+	  M[pointer+1]*x+B[pointer+1]<M[pointer]*x+B[pointer])
+		pointer++;
+	return -(M[pointer]*x+B[pointer]);
+}
+int main(){
+	int TC = 1;
+	while(TC--){
+		M.clear();
+		B.clear();
+		pointer = 0;
+		int n;
+		scanf("%d",&n);
+		ll a,b,c;
+		scanf("%lld %lld %lld",&a,&b,&c);
+		add(0LL,0LL);
+		ll davez, soma = 0;
+		for(int i=1;i<n;i++){
+			scanf("%lld",&davez);
+			soma += davez;
+			ll best = query(soma) + a*soma*soma + b*soma + c;
+			add(-2*a*soma,best + a*soma*soma - b*soma);
+		}
+		scanf("%lld",&davez);
+		soma += davez;
+		ll best = query(soma) + a*soma*soma + b*soma + c;
+		printf("%lld\n",best);
+	}
+	return 0;
+}

DMOJ/apio12p1.cpp

@@ -0,0 +1,116 @@
+#include <bits/stdc++.h>
+using namespace std;
+const long long MAXN = 100010;
+typedef pair<long long,long long> ii;
+typedef struct node* pnode;
+struct node{
+	pnode l,r;
+	ii key;
+	long long size,prior;
+	long long soma;
+	node(ii key) : l(NULL),r(NULL),key(key),size(1),prior(rand()),soma((long long)key.first){}
+};
+inline long long sz(pnode t){
+	if(t == NULL) return 0;
+	return t->size;
+}
+inline long long sm(pnode t){
+	if(t == NULL) return 0LL;
+	return t->soma;
+}
+void upd(pnode t){
+	if(t == NULL) return;
+	t->size =  sz(t->l) + 1 + sz(t->r);
+	t->soma = (long long)t->key.first + sm(t->l) + sm(t->r);
+}
+void split(pnode t,ii key,pnode &l,pnode &r){
+	if(t == NULL){
+		l = r = NULL;
+	}
+	else{
+		if(key < t->key){
+			split(t->l,key,l,t->l);
+			r = t;
+		}
+		else{
+			split(t->r,key,t->r,r);
+			l = t;
+		}
+	}
+	upd(t);
+}
+void merge(pnode &t,pnode l,pnode r){
+	if(l == NULL){t = r;}
+	else if(r == NULL){t = l;}
+	else if(l->prior > r->prior){
+		merge(l->r,l->r,r);
+		t = l;
+	}
+	else{
+		merge(r->l,l,r->l);
+		t = r;
+	}
+	upd(t);
+}
+void insert(pnode &t,ii key){
+	pnode L,R;
+	pnode aux = new node(key);
+	split(t,ii(key.first - 1,MAXN),L,R);
+	merge(t,L,aux);
+	merge(t,t,R);
+}
+long long count(pnode t,long long budget){
+	if(t == NULL) return 0;
+	long long agora = (long long)t->key.first + sm(t->l);
+	if(budget == agora) return sz(t->l) + 1;
+	if(budget <= agora) return count(t->l,budget);
+	return sz(t->l) + 1 + count(t->r,budget - agora);
+}
+vector<long long> grafo[MAXN];
+vector<long long> *conjunto[MAXN];
+long long peso[MAXN],lideranca[MAXN],n,m,tam[MAXN];
+pnode raiz[MAXN];
+long long resp;
+void dfs(long long x){
+	tam[x] = 1;
+	long long big = -1,mx = -1;
+	for(long long v : grafo[x]){
+		dfs(v);
+		tam[x] += tam[v];
+		if(tam[v] > mx){
+			mx = tam[v];
+			big = v;
+		}
+	}
+	if(big == -1){
+		conjunto[x] = new vector<long long> ();
+		(*conjunto[x]).push_back(x);
+		raiz[x] = new node(ii(peso[x],x));
+	}
+	else{
+		raiz[x] = raiz[big];
+		conjunto[x] = conjunto[big];
+		(*conjunto[x]).push_back(x);
+		insert(raiz[x],ii(peso[x],x));
+	}
+	for(long long v : grafo[x]){
+		if(v == big) continue;
+		for(long long u : (*conjunto[v])){
+			(*conjunto[x]).push_back(u);
+			insert(raiz[x],ii(peso[u],u));
+		}
+	}
+	resp = max(resp, 1LL*lideranca[x]*count(raiz[x],(long long)m) );
+}
+int main(){
+	cin.tie(0);ios_base::sync_with_stdio(0);
+	cin >> n >> m;
+	for(long long i=1;i<=n;i++){
+		long long j;
+		cin >> j >> peso[i] >> lideranca[i];
+		grafo[j].push_back(i);
+	}
+	dfs(1);
+	cout << resp << endl;
+	return 0;
+}

DMOJ/bfs17p1.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
+	multiset<string> resp;
+	int n;
+	cin >> n;
+	string s;
+	while(n--){
+		cin >> s;
+		if(s.size() <= 10) resp.insert(s);
+	}
+	cout << resp.size() << endl;
+	return 0;
+}

DMOJ/bfs17p2.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+using namespace std;
+int qtd[6],last,n;
+vector<int> perm;
+int check(){
+	int total = 0;
+	last = -1;
+	while(true){
+		int available = 0;
+		//for(int i = 0;i<6;i++) cout << qtd[i] << endl;
+		for(int i = 5;i>=0;i--){
+			if(i != last) available += qtd[i];
+		}
+		if(available == 0) break;
+		for(int i = 5;i>=0;i--){
+			if(i == last) continue;
+			if(qtd[i] == 0) continue;
+			total++;
+			last = i;
+			qtd[i]--;
+			break;
+		}
+	}
+	return total;
+}
+int main(){
+	cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
+	cin >> n;
+	for(int i = 1;i<=n;i++){
+		string s;
+		cin >> s;
+		if(s == "red") qtd[0]++;
+		if(s == "orange") qtd[1]++;
+		if(s == "yellow") qtd[2]++;
+		if(s == "green") qtd[3]++;
+		if(s == "blue") qtd[4]++;
+		if(s == "black") qtd[5]++;
+	}
+	sort(qtd,qtd+6);
+	cout << check() << endl;
+	return 0;
+}

DMOJ/bfs17p3.cpp

@@ -0,0 +1,85 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef pair<int,int> ii;
+const int MAXN = 3010;
+int n,m,X1[MAXN],Y1[MAXN],R1[MAXN],X2[MAXN],Y2[MAXN],R2[MAXN],ini1,ini2,max1,max2,obj1,obj2,min1,min2;
+int processado1[MAXN],processado2[MAXN];
+int sq(int x){return x*x;}
+int euclid(int x,int y){return sq(x) + sq(y);}
+int main(){
+	scanf("%d %d",&n,&m);
+	min1 = 2*MAXN;
+	min2 = 2*MAXN;
+	for(int i = 1;i<=n;i++){
+		scanf("%d %d %d",&X1[i],&Y1[i],&R1[i]);
+		if(Y1[i] > max1){
+			max1 = Y1[i];
+			ini1=  i;
+		}
+		if(R1[i] == 9001){
+			obj1 = i;
+		}
+	}
+	for(int i = 1;i<=m;i++){
+		scanf("%d %d %d",&X2[i],&Y2[i],&R2[i]);
+		if(Y2[i] > max2){
+			max2 = Y2[i];
+			ini2=  i;
+		}
+		if(R2[i] == 9001){
+			obj2 = i;
+		}
+	}
+	queue<ii> bfs1;
+	bfs1.push(ii(0,ini1));
+	while(!bfs1.empty()){
+		int v = bfs1.front().second;
+		int perc = bfs1.front().first;
+		bfs1.pop();
+		if(processado1[v] == 1) continue;
+		processado1[v] = 1;
+		if(v == obj1){
+			min1 = perc;
+			break;
+		}
+		for(int u = 1;u<=n;u++){
+			if(processado1[u] != 0) continue;
+			int vaivai = euclid(X1[v] - X1[u],Y1[v] - Y1[u]);
+			if(vaivai <= R1[v]*R1[v]){
+				processado1[u] = 2;
+				bfs1.push(ii(perc+1,u));
+			}
+		}
+	}
+	queue<ii> bfs2;
+	bfs2.push(ii(0,ini2));
+	while(!bfs2.empty()){
+		int v = bfs2.front().second;
+		int perc = bfs2.front().first;
+		bfs2.pop();
+		if(processado2[v] == 1) continue;
+		processado2[v] = 1;
+		if(v == obj2){
+			min2 = perc;
+			break;
+		}
+		for(int u = 1;u<=m;u++){
+			if(processado2[u] != 0) continue;
+			int vaivai = euclid(X2[v] - X2[u],Y2[v] - Y2[u]);
+			if(vaivai <= R2[v]*R2[v]){
+				processado2[u] = 2;
+				bfs2.push(ii(perc+1,u));
+			}
+		}
+	}
+	if(min1 < min2){
+		printf("We are the champions!\n");
+	}
+	else if(min1 == min2){
+		printf("SUDDEN DEATH\n");
+	}
+	else{
+		printf(":'(\n");
+	}
+	return 0;
+}

DMOJ/bts17p1.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int flag = 0;
+	string s;
+	while(cin >> s){
+		if('A' <= s[0] && s[0] <= 'Z' && flag) cout << ". ";
+		else if(flag){
+			cout << " ";
+		}
+		else{
+			flag = 1;
+		}
+		cout << s;
+	}
+	cout << "." << endl;
+	return 0;
+}

DMOJ/bts17p2.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	double resp = 1.0;
+	int n;
+	scanf("%d",&n);
+	while(n--){
+		int e,g;
+		scanf("%d %d",&e,&g);
+		double fator = (g - e)/double(g);
+		resp *= fator;
+	}
+	printf("%.6lf\n",resp);
+	return 0;
+}