제출 #1333486

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1333486		ozner77	새로운 문제 (POI11_pat)	C++17	28 / 100	406 ms	28240 KiB

pat

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ll k;
    cin>>k;
    vector<vector<ll>> V;
    for(int i=0;i<k;i++){
        ll n;
        cin>>n;
        vector<ll> L;
        for(int j=0;j<n;j++){
            ll a;
            cin>>a;
            L.push_back(a);
        }
        V.push_back(L);
    }
    vector<pair<ll,ll>> L;
    ll color=1;
    for(auto x:V){
        for(auto y:x){
            L.push_back({y,color});
        }
        color++;
    }
    sort(L.begin(),L.end());
    for(int i=0;i<L.size()-2;i++){
        if(L[i].second!=L[i+1].second && L[i].second!=L[i+2].second && L[i+1].second!=L[i+2].second){
            if(L[i].first+L[i+1].first>L[i+2].first){
                cout<<L[i].second<<" "<<L[i].first<<" "<<L[i+1].second<<" "<<L[i+1].first<<" "<<L[i+2].second<<" "<<L[i+2].first<<"\n";
                return 0;
            }
        }
    }
    cout<<"NIE\n";
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 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