hacker cup

Author: seunghyukcho

SCPC/2019/qual2/E.cpp

@@ -1,5 +1,7 @@
 #include <iostream>
 #include <algorithm>
+#include <vector>
+#include <map>
 #include <cmath>
 
 using namespace std;
@@ -8,20 +10,66 @@ typedef long long ll;
 
 struct Point
 {
-	int idx, x, y;
+	int x, y;
 } P[500002];
 
+bool compx(Point& p1, Point& p2)
+{
+	return p1.x < p2.x;
+}
+
+bool compy(Point& p1, Point& p2)
+{
+	return p1.y < p2.y;
+}
+
 bool comp(Point& p1, Point& p2)
 {
 	return p1.y == p2.y ? p1.x > p2.x : p1.y > p2.y;
 }
 
+int T, N, M;
+int data[]
+map<int, int> x_val, y_val;
+
 ll min(ll a, ll b)
 {
 	return a < b ? a : b;
 }
 
-int T, N, M;
+Point query2(int pos, int y1, int y2, int start = 1, int end = N, int v = 1)
+{
+
+}
+
+Point query1(int x1, int y1, int x2, int y2, int start = 1, int end = N, int v = 1)
+{
+	if(x1 <= start && x2 <= end)
+		return query2(v, y1, y2);
+	if(x2 < start || end < x1)
+		return { -1, -1 };
+
+	int mid = (x1 + x2) / 2;
+
+	Point p1 = query1(x1, y1, x2, y2, start, mid, 2 * v), p2 = query1(x1, y1, x2, y2, mid + 1, end, 2 * v + 1);
+
+	if(p1.x == -1)
+		return p2;
+	else if(p2.x == -1)
+		return p1;
+	else
+	{
+		int xx1 = x_val[p1.x], yy1 = y_val[p1.y];
+		int xx2 = x_val[p2.x], yy2 = y_val[p2.y];
+		int dis1 = max(abs(xx1 - x1), abs(yy1 - y1)), dis2 = max(abs(xx2 - x1), abs(yy2 - y1));
+
+		if(dis1 < dis2)
+			return p2;
+		else 
+			return p1;
+	}
+}
+
 
 int main()
 {
@@ -32,30 +80,30 @@ int main()
 	for(int t = 1; t <= T; t++)
 	{
 		ll ans = 0;
+		x_val.clear(), y_val.clear();
+
 		cout << "Case #" << t << '\n';
 		cin >> M >> N;
 
 		for (int i = 0; i < N; i++)
-		{
 			cin >> P[i].x >> P[i].y;
-		}
-
-		sort(P, P + N, comp);
 
+		sort(P, P + N, compx);
 		for(int i = 0; i < N; i++)
 		{
-			ll result = min(abs(M - P[i].x), abs(M - P[i].y));
-
-			for(int j = 0; j < i; j++)
-			{
-				if(P[j].x <= P[i].x || P[j].y == P[i].y)
-					continue;
-				result = min(result, max(abs(P[j].x - P[i].x), abs(P[j].y - P[i].y)));
-			}
+			if(!x_val.find(P[i].x)) x_val[P[i].x] = i + 1;
+			P[i].x = x_val[P[i].x];
+		}
 
-			ans += result;
+		sort(P, P + N, compy);
+		for(int i = 0; i < N; i++)
+		{
+			if(!y_val.find(P[i].y)) y_val[P[i].y] = i + 1;
+			P[i].y = y_val[P[i].y];
 		}
 
+		sort(P, P + N, comp);
+
 		cout << ans << '\n';
 	}
 }

facebook/2019/Round 1/A.cpp

@@ -0,0 +1,75 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <climits>
+
+using namespace std;
+
+typedef long long ll;
+
+struct C
+{
+	int x, y, z;
+};
+
+vector<C> constraints;
+int T, N, M;
+ll cache[52][52];
+
+int main()
+{
+	ios::sync_with_stdio(false);
+	cin.tie(NULL);
+	srand(time(NULL));
+
+	cin >> T;
+	for(int t = 1; t <= T; t++)
+	{
+		cin >> N >> M;
+		cout << "Case #" << t << ": ";
+		constraints.clear();
+		for(int i = 1; i <= N; i++)
+			for(int j = 1; j <= N; j++)
+			{
+				cache[i][j] = (i == j ? 0 : LLONG_MAX);
+			}
+		
+		for(int i = 0; i < M; i++)
+		{
+			int x, y, z;
+			cin >> x >> y >> z;
+
+			constraints.push_back({x, y, z});
+			cache[x][y] = cache[y][x] = z;
+		}
+
+		for(int k = 1; k <= N; k++)
+			for(int i = 1; i <= N; i++)
+				for(int j = 1; j <= N; j++)
+				{
+					if(cache[i][k] == LLONG_MAX || cache[k][j] == LLONG_MAX)
+						continue;
+					cache[i][j] = min(cache[i][j], cache[i][k] + cache[k][j]);
+				}
+				
+
+		bool ans = true;
+		for(C p : constraints)
+		{
+			if(cache[p.x][p.y] != p.z)
+			{
+				ans = false;
+				break;
+			}
+		}
+
+		if(ans)
+		{
+			cout << M << '\n';
+			for(C p : constraints)
+				cout << p.x << ' ' << p.y << ' ' << p.z << '\n';
+		}
+		else
+			cout << "Impossible\n";
+	}
+}

facebook/2019/Round 1/B.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <algorithm>
+#include <string>
+#include <climits>
+#include <cstdlib>
+
+#define MOD 1000000007;
+
+using namespace std;
+
+typedef long long ll;
+
+int T, N, K, ssum[1000002];
+string s;
+
+ll pow(int n)
+{
+	if(n == 0) return 1;
+	if(n == 1) return 2;
+
+	ll ret = pow(n / 2);
+	ret = ret * ret % MOD;
+
+	if(n % 2 == 1)
+		ret = ret * 2 % MOD;
+	return ret;
+}
+
+int main()
+{
+	ios::sync_with_stdio(false);
+	cin.tie(NULL);
+
+	cin >> T;
+	for(int t = 1; t <= T; t++)
+	{
+		ll ans = 0, mn = 0;
+		cout << "Case #" << t << ": ";
+		cin >> N >> K >> s;
+
+		reverse(s.begin(), s.end());
+		
+		for(int i = 1; i <= N; i++)
+		{
+			ssum[i] = ssum[i - 1] + (s[i - 1] == 'B' ? 1 : -1);
+			
+			if(ssum[i] - mn > K)
+			{
+				ans = (ans + pow(N - i + 1)) % MOD;
+				ssum[i] -= 2;
+			}
+
+			if(ssum[i] < mn)
+				mn = ssum[i];
+		}
+
+		cout << ans << '\n';
+	}
+}