cses

commit b4d79d74477b977fdc5ce0f274d8f9fdb401e3e8
parent 86c9082fc9aad1a92be153466ba1e10bf26880a6
Author: superpozycja <anna@superpozycja.net>
Date:   Fri,  1 Nov 2024 23:11:28 +0100

solve sum of three values

Diffstat:
A
sorting_and_searching/sum_of_three_values.cpp
 | 
70
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

1 file changed, 70 insertions(+), 0 deletions(-)
diff --git a/sorting_and_searching/sum_of_three_values.cpp b/sorting_and_searching/sum_of_three_values.cpp
@@ -0,0 +1,70 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ui = unsigned int;
+using l = long;
+using ul = unsigned long;
+using ll = long long;
+using ull = unsigned long long;
+
+using vi = vector<int>;
+using vui = vector<ui>;
+using vl = vector<l>;
+using vul = vector<ul>;
+using vll = vector<ll>;
+using vull = vector<ull>;
+
+void solve()
+{
+	int n, x;
+	cin >> n >> x;
+	int t[n];
+	int og[n];
+	for (int i = 0; i < n; i++) {
+		cin >> t[i];
+		og[i] = t[i];
+	}
+
+	sort(t, t + n);
+
+	for (int z = 0; z < n-2; z++) {
+		int i = z + 1, j = n - 1, tmp = t[z];
+		while (i < j) {
+			if (t[i] + t[j] + tmp > x) {
+				j--;
+			} else if (t[i] + t[j] + tmp < x) {
+				i++;
+			} else {
+				int fi = 0, fj = 0;
+				int fz = 0;
+				for (int x = 0; x < n; x++) {
+					if (og[x] == t[z] && !fz) {
+						cout << x + 1 << " ";
+						fz = 1;
+						continue;
+					}
+					if (og[x] == t[i] && !fi) {
+						cout << x + 1 << " ";
+						fi = 1;
+						continue;
+					}
+					if (og[x] == t[j] && !fj) {
+						cout << x + 1 << " ";
+						fj = 1;
+					}
+				}
+				cout << "\n";
+				return;
+			}
+		}
+	}
+	cout << "IMPOSSIBLE\n";
+}
+
+int main()
+{
+	ios::sync_with_stdio(0);
+	cin.tie(0);
+	solve();
+}