답안 #83679 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83679	2018-11-09T18:47:46 Z	nikolapesic2802	Sticks (POI11_pat)	C++14	84 / 100	204 ms	33792 KB

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back

void fastscan(int &n)
{
    bool minus=false;
    n=0;
    register int c=getchar();
    if(c=='-')
    {
        minus=true;
        c=getchar();
    }
    while(c>='0'&&c<='9')
    {
        n*=10;
        n+=c-'0';
        c=getchar();
    }
    if(minus)
        n*=-1;
}
int main()
{
    int k;
    //scanf("%i",&k);
    fastscan(k);
    vector<vector<int> > sets(k);
    for(int i=0;i<k;i++)
    {
        sets[i].pb(INT_MAX);
        int n;
        //scanf("%i",&n);
        fastscan(n);
        for(int j=0;j<n;j++)
        {
            int a;
            //scanf("%i",&a);
            fastscan(a);
            sets[i].pb(a);
        }
        sort(sets[i].begin(),sets[i].end());
    }
    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;
                int l=0,r=sets[j].size()-1;
                while(l<r)
                {
                    int mid=(l+r)/2;
                    if(mid==0&&sets[j][mid]>=p)
                    {
                        l=mid;
                        break;
                    }
                    if(sets[j][mid]>=p&&sets[j][mid-1]<p){
                        l=mid;
                        break;
                    }
                    if(sets[j][mid]<p)
                    {
                        l=mid+1;
                    }
                    else
                    {
                        r=mid;
                    }
                }
                int v=sets[j][l];
                if(v<m1)
                {
                    m2=m1;
                    c2=c1;
                    m1=v;
                    c1=j;
                }
                else
                {
                    if(v<m2)
                    {
                        m2=v;
                        c2=j;
                    }
                }
                if(l==0)
                    continue;
                v=sets[j][l-1];
                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)
                {
                    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)
                {
                    printf("%i %i %i %i %i %i\n",i+1,p,ca1+1,ma1,ca2+1,ma2);
                    return 0;
                }
            }
        }
    }
    printf("NIE\n");
    return 0;
}

Compilation message

pat.cpp: In function 'int main()':
pat.cpp:129:27: warning: 'ca2' may be used uninitialized in this function [-Wmaybe-uninitialized]
                     printf("%i %i %i %i %i %i\n",i+1,p,ca1+1,ma1,ca2+1,ma2);
                     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pat.cpp:129:27: warning: 'ca1' may be used uninitialized in this function [-Wmaybe-uninitialized]
pat.cpp:121:27: warning: 'c2' may be used uninitialized in this function [-Wmaybe-uninitialized]
                     printf("%i %i %i %i %i %i\n",i+1,p,c1+1,m1,c2+1,m2);
                     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pat.cpp:121:27: warning: 'c1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	504 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	564 KB	Output is correct

Subtask #3
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	564 KB	Output is correct

Subtask #4
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	668 KB	Output is correct
2	Correct	2 ms	668 KB	Oczekiwano NIE

Subtask #5
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	668 KB	Oczekiwano NIE
2	Correct	8 ms	1012 KB	Output is correct

Subtask #6
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1012 KB	Oczekiwano NIE
2	Correct	13 ms	1392 KB	Output is correct

Subtask #7
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1392 KB	Oczekiwano NIE
2	Correct	20 ms	2520 KB	Output is correct

Subtask #8
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	2520 KB	Oczekiwano NIE
2	Correct	28 ms	4400 KB	Output is correct
3	Correct	50 ms	4960 KB	Oczekiwano NIE

Subtask #9
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	58 ms	5356 KB	Oczekiwano NIE
2	Correct	47 ms	8316 KB	Output is correct
3	Correct	86 ms	9208 KB	Oczekiwano NIE

Subtask #10
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	97 ms	15268 KB	Output is correct
2	Correct	74 ms	17652 KB	Output is correct
3	Correct	123 ms	19256 KB	Oczekiwano NIE

Subtask #11
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	93 ms	24952 KB	Output is correct
2	Correct	95 ms	27452 KB	Output is correct
3	Correct	184 ms	29676 KB	Oczekiwano NIE

Subtask #12
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	194 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #13
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	204 ms	33792 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-