Untitled
unknown
plain_text
3 years ago
1.5 kB
3
Indexable
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
int32_t main() {
int k;
cin >> k;
for (int i = 0; i < k; i++) {
int n;
cin >> n;
v.emplace_back();
for (int j = 0; j < n; j++) {
int x;
cin >> x;
v[i].push_back(x);
}
}
for (int i = 0; i < k; i++) {
for (int j = i + 1; j < k; j++) {
for (int l = j + 1; l < k; l++) {
for (auto a : v[i]) {
auto it2 = lower_bound(v[j].begin(), v[j].end(), a);
int b = 1e14;
if (it2 != v[j].end()) {
b = *it2;
}
if (it2-- != v[j].begin() && abs(b - a) > abs(*it2 - a)) {
b = *it2;
}
auto it = lower_bound(v[l].begin(), v[l].end(), max(a, b));
if (it != v[l].end() && a + b > *it) {
cout << i + 1 << ' ' << a << ' ' << j + 1 << ' ' << b << ' ' << l + 1 << ' ' << *it;
return 0;
}
if (it-- != v[l].begin() && min(a, b) + *it > max(a, b)) {
cout << i + 1 << ' ' << a << ' ' << j + 1 << ' ' << b << ' ' << l + 1 << ' ' << *it;
return 0;
}
}
}
}
}
cout << -1;
}
Editor is loading...