제출 #1135752

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135752		tvladm	새로운 문제 (POI11_pat)	C++20	100 / 100	154 ms	8624 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<pi> v;
    for (int i = 1; i <= k; ++i) {
        int n; cin >> n;
        for (int j = 0; j < n; ++j) {
            int x; cin >> x;
            v.push_back({x, i});
        }
    }
    sort(v.begin(), v.end());
    vector<int> mx(k + 1, -1e9);
    for (int i = 0; i < v.size(); ++i) {
        int ind1 = 0, ind2 = 0;
        for (int j = 1; j <= k; ++j) {
            if (j == v[i].second) continue;
            
            if (mx[j] >= mx[ind1]) {
                ind2 = ind1;
                ind1 = j;
            } else if (mx[j] > mx[ind2]) {
                ind2 = j;
            } 
        }
        if (mx[ind1] + mx[ind2] > v[i].F) {
            cout << ind1 << " " << mx[ind1] << " " << ind2 << " " << mx[ind2] << " " << v[i].S << " " << v[i].F << "\n";
            return 0;
        }
        mx[v[i].S] = v[i].F;
    }
    cout << "NIE\n";
}

• 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