Submission #83677

#	Time	Username	Problem	Language	Result	Execution time	Memory
83677		nikolapesic2802	Sticks (POI11_pat)	C++14	68 / 100	723 ms	33792 KiB

pat

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back

void fastscan(int &number)
{
    bool negative = false;
    register int c;

    number = 0;
    c = getchar();
    if (c=='-')
    {
        negative = true;
        c = getchar();
    }
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
    if (negative)
        number *= -1;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int k;
    //scanf("%i",&k);
    cin >> k;
    //fastscan(k);
    vector<set<int> > sets(k);
    for(int i=0;i<k;i++)
    {
        sets[i].insert(INT_MAX);
        int n;
        //scanf("%i",&n);
        //fastscan(n);
        cin >> n;
        for(int j=0;j<n;j++)
        {
            int a;
            //scanf("%i",&a);
            //fastscan(a);
            cin >> a;
            sets[i].insert(a);
        }
    }
    for(int i=0;i<k;i++)
    {
        for(auto p:sets[i])
        {
            if(p==INT_MAX)
                continue;
            int m1=INT_MAX,m2=INT_MAX,c1,c2;
            int ma1=-1,ma2=-1,ca1,ca2;
            for(int j=0;j<k;j++)
            {
                if(i==j)
                    continue;
                set<int>::iterator it=sets[j].lower_bound(p);
                int v=*it;
                if(v<m1)
                {
                    m2=m1;
                    c2=c1;
                    m1=v;
                    c1=j;
                }
                else
                {
                    if(v<m2)
                    {
                        m2=v;
                        c2=j;
                    }
                }
                if(it==sets[j].begin())
                    continue;
                it--;
                v=*it;
                if(v>ma1)
                {
                    ma2=ma1;
                    ca2=ca1;
                    ma1=v;
                    ca1=j;
                }
                else
                {
                    if(v>ma2)
                    {
                        ma2=v;
                        ca2=j;
                    }
                }
            }
            if(m1!=INT_MAX&&m2!=INT_MAX)
            {
                if(p+m1>m2)
                {
                    cout <<i+1<< " "<<p<< " "<<c1+1<< " "<<m1<< " "<<c2+1<< " "<<m2<< "\n";
                    //printf("%i %i %i %i %i %i\n",i+1,p,c1+1,m1,c2+1,m2);
                    return 0;
                }
            }
            if(ma1!=-1&&ma2!=-1)
            {
                if(ma1+ma2>p)
                {
                    cout <<i+1<< " "<<p<< " "<<ca1+1<< " "<<ma1<< " "<<ca2+1<< " "<<ma2<< "\n";
                    //printf("%i %i %i %i %i %i\n",i+1,p,ca1+1,ma1,ca2+1,ma2);
                    return 0;
                }
            }
        }
    }
    cout << "NIE" << "\n";
    return 0;
}

Compilation message (stderr)

pat.cpp: In function 'int main()':
pat.cpp:112:80: warning: 'ca2' may be used uninitialized in this function [-Wmaybe-uninitialized]
                     cout <<i+1<< " "<<p<< " "<<ca1+1<< " "<<ma1<< " "<<ca2+1<< " "<<ma2<< "\n";
                                                                                ^~~
pat.cpp:112:56: warning: 'ca1' may be used uninitialized in this function [-Wmaybe-uninitialized]
                     cout <<i+1<< " "<<p<< " "<<ca1+1<< " "<<ma1<< " "<<ca2+1<< " "<<ma2<< "\n";
                                                        ^~~
pat.cpp:103:77: warning: 'c2' may be used uninitialized in this function [-Wmaybe-uninitialized]
                     cout <<i+1<< " "<<p<< " "<<c1+1<< " "<<m1<< " "<<c2+1<< " "<<m2<< "\n";
                                                                             ^~~
pat.cpp:103:55: warning: 'c1' may be used uninitialized in this function [-Wmaybe-uninitialized]
                     cout <<i+1<< " "<<p<< " "<<c1+1<< " "<<m1<< " "<<c2+1<< " "<<m2<< "\n";
                                                       ^~~

• 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: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 0 / 8