제출 #1141307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141307		rlx0090	새로운 문제 (POI11_pat)	C++20	44 / 100	1096 ms	30332 KiB

pat

#include <iostream>
#include <vector>
#include <fstream>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <cfloat>
#include <random>
#include <complex>
#include<assert.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    int k;
    cin >> k;
    vector<pair<int, int> > g;
    for(int i = 0; i < k; ++i) {
        int n;
        cin >> n;
        set<int> q;
        int cnt = 0;
        for(int j = 0; j < n; ++j) {
            int x; cin >> x;
            if(q.count(x)) continue;
            q.insert(x);
            g.push_back({x, i + 1});
        }
    }
    sort(g.rbegin(), g.rend());
    
    for(int i = 0; i < g.size() - 2; ++i) {
        int j = i + 2;
        //cout << g[i].first << " " << g[i + 1].first << " " << g[j].first << endl;
        if(g[i + 1].first + g[j].first > g[i].first) {
            int c1 = g[i].second, c2 = g[i + 1].second, c3 = g[j].second;
            //cout << "c : " << c1 << " " << c2 << " " << c3 << endl;
            if(c1 != c2 && c1 != c3 && c2 != c3) {
                cout << c1 << ' ' << g[i].first << ' ' << c2 << ' ' << g[i + 1].first << ' ' << c3 << ' ' << g[j].first;
                exit(0);
            }
        } 
        while(j < g.size()) {
            //cout << g[i].first << " " << g[i + 1].first << " " << g[j + 1].first << endl;
            if(g[i + 1].first + g[j + 1].first > g[i].first) {
                int c1 = g[i].second, c2 = g[i + 1].second, c3 = g[j + 1].second;
                //cout << "c : " << c1 << " " << c2 << " " << c3 << endl;
                if(c1 != c2 && c1 != c3 && c2 != c3) {
                    cout << c1 << ' ' << g[i].first << ' ' << c2 << ' ' << g[i + 1].first << ' ' << c3 << ' ' << g[j + 1].first;
                    exit(0);
                }
            }
            else break;
            j++;
        }
               
    }
    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: 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