제출 #257143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257143		islingr	새로운 문제 (POI11_pat)	C++17	100 / 100	225 ms	4656 KiB

pat

#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";
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 8 / 8
• Subtask 6: 8 / 8
• Subtask 7: 8 / 8
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 8 / 8
• Subtask 11: 8 / 8
• Subtask 12: 8 / 8
• Subtask 13: 8 / 8