제출 #1135743

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135743		tvladm	새로운 문제 (POI11_pat)	C++20	21 / 100	114 ms	4184 KiB

pat

#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; }
template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; }

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    
    int k; cin >> k;
    vector<vector<int>> v(k);
    for (int i = 0; i < k; ++i) {
        int n; cin >> n;
        v[i].resize(n);
        for (auto &x : v[i]) cin >> x;
        sort(v[i].begin(), v[i].end());
    }
    for (int i = 0; i < k; ++i) {
        for (int j = i + 1; j < k; ++j) {
            int a = v[i].back();
            int b = v[j].back();
            for (int p = 0; p < k; ++p) {
                if (p == i || p == j) continue;
                
                for (auto x : v[p]) {
                    if (x >= b && a + b > x) {
                        cout << i+1 << " " << a << " " << j+1 << " " << b << " " << p+1 << " " << x << "\n";
                        return 0;
                    }
                }
            }
        }
    }
    cout << "NIE";
}

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