Submission #257143

#TimeUsernameProblemLanguageResultExecution timeMemory
257143islingrSticks (POI11_pat)C++17
100 / 100
225 ms4656 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (auto i = (a); i < (b); ++i) #define all(x) begin(x), end(x) const int K = 1 << 6; vector<int> s[K]; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int k; cin >> k; rep(i, 0, k) { int n; cin >> n; s[i].resize(n); for (auto &x : s[i]) cin >> x; sort(all(s[i])); } rep(ca, 0, k) { for (int a : s[ca]) { int b = -1, cb = -1, c = -1, cc = -1; rep(i, 0, k) { if (i == ca) continue; auto it = upper_bound(all(s[i]), a); if (it-- == begin(s[i])) continue; if (b <= *it) { c = b; cc = cb; b = *it; cb = i; } else if (c < *it) c = *it, cc = i; } if (c < 0) continue; if (b + c > a) return cout << ++ca << ' ' << a << ' ' << ++cb << ' ' << b << ' ' << ++cc << ' ' << c, 0; } } cout << "NIE"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...