Submission #1134084

#	Time	Username	Problem	Language	Result	Execution time	Memory
1134084		alexdd	Sticks (POI11_pat)	C++20	100 / 100	347 ms	4252 KiB

pat

#include<bits/stdc++.h>
using namespace std;
int k;
vector<int> v[55];
signed main()
{
    cin>>k;
    for(int i=0;i<k;i++)
    {
        int nr;
        cin>>nr;
        v[i].resize(nr);
        for(int j=0;j<nr;j++)
            cin>>v[i][j];
        sort(v[i].begin(),v[i].end());
    }
    for(int i=0;i<k;i++)
    {
        for(int u=0;u<v[i].size();u++)
        {
            int a = v[i][u];
            vector<pair<int,int>> aux;
            for(int j=0;j<k;j++)
            {
                if(i==j)
                    continue;
                if(v[j][0] > a)
                    continue;
                int poz = lower_bound(v[j].begin(),v[j].end(),a) - v[j].begin() - 1;
                int b = v[j][poz];
                assert(b<a);
                for(int s=0;s<k;s++)
                {
                    if(s==i || s==j)
                        continue;
                    int cv = upper_bound(v[s].begin(),v[s].end(),a-b) - v[s].begin();
                    if(cv<v[s].size() && v[s][cv]<a+b)
                    {
                        cout<<i+1<<" "<<a<<" "<<j+1<<" "<<b<<" "<<s+1<<" "<<v[s][cv];
                        return 0;
                    }
                }
            }
        }
    }
    cout<<"NIE";
    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