Submission #1135535

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135535		snpmrnhlol	Sticks (POI11_pat)	C++20	100 / 100	306 ms	8240 KiB

pat

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6;
pair<int, int> v[N];
pair<int, int> mx[3];
int cnt = 0;
int main(){
    int k;
    bool ans = 0;
    cin>>k;
    for(int i = 0;i < k;i++){
        int _;
        cin>>_;
        for(int j = 0;j < _;j++){
            int a;
            cin>>a;
            v[cnt++] = {a, i + 1};
        }
    }
    sort(v, v + cnt);
    assert(cnt <= N);
    mx[0] = mx[1] = mx[2] = {-1, -1};
    for(int i = 0;i < cnt;i++){
        bool ok = 0;
        for(int j = 2;j >= 0;j--){
            if(mx[j].second == v[i].second){
                mx[j] = v[i];
                ok = 1;
                break;
            }
        }
        sort(mx, mx + 3);
        if(!ok){
            mx[0] = mx[1];
            mx[1] = mx[2];
            mx[2] = v[i];
        }
        ///most
        if(mx[0].second != -1 && mx[1].second != -1 && mx[2].second != -1 && mx[0].first + mx[1].first > mx[2].first){
            for(int k = 0;k < 3;k++){
                cout<<mx[k].second<<' '<<mx[k].first<<' ';
            }
            cout<<'\n';
            ans = 1;
            break;
        }
    }
    if(!ans){
        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