제출 #1333480

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1333480		candi_ositos	새로운 문제 (POI11_pat)	C++20	100 / 100	461 ms	12168 KiB

pat

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, m;
    cin>>n;
    vector <pair <int, int> > fp;
    vector <vector <int> > a(n);
    for(int i=0; i<n; ++i){
        int aux;
        cin>>aux;
        a[i].resize(aux);
        for(int j=0; j<aux; ++j){
            cin>>a[i][j];
            fp.push_back({a[i][j], i});
        }
        sort(a[i].begin(), a[i].end());
    }
    m=fp.size();
    sort(fp.begin(), fp.end());
    while(m>2){
        if(fp[m-1].second==fp[m-2].second){
            fp.pop_back();
            --m;
            continue;
        }
        if(fp[m-3].first<=fp[m-1].first-fp[m-2].first){
            fp.pop_back();
            --m;
            continue;
        }
        for(int i=0; i<n; ++i){
            if(i==fp[m-1].second || i==fp[m-2].second){
                continue;
            }
            int li=0, ri=a[i].size()-1;
            while(li<ri){
                int aux=(li+ri)/2;
                if(a[i][aux]<=fp[m-1].first-fp[m-2].first){
                    li=aux+1;
                    continue;
                }
                ri=aux;
            }
            if(a[i][li]>fp[m-1].first-fp[m-2].first && a[i][li]<fp[m-1].first+fp[m-2].first){
                cout<<i+1<<" "<<a[i][li]<<" "<<fp[m-2].second+1<<" "<<fp[m-2].first<<" "<<fp[m-1].second+1<<" "<<fp[m-1].first<<"\n";
                return 0;
            }
        }
        --m;
        fp.pop_back();
    }
    cout<<"NIE\n";
    return 0;
}

• 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