oj.uz

Submission #83678

# Submission time Handle Problem Language Result Execution time Memory
83678 2018-11-09T18:40:57 Z nikolapesic2802 Sticks (POI11_pat) C++14
68 / 100
 651 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<set<int> > sets(k);
    for(int i=0;i<k;i++)
    {
        sets[i].insert(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].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)
                {
                    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:108: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:108:27: warning: 'ca1' may be used uninitialized in this function [-Wmaybe-uninitialized]
pat.cpp:100: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:100:27: warning: 'c1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 508 KB Oczekiwano NIE

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Oczekiwano NIE
2 Correct 14 ms 2180 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2180 KB Oczekiwano NIE
2 Correct 27 ms 3220 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3220 KB Oczekiwano NIE
2 Correct 46 ms 6756 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6756 KB Oczekiwano NIE
2 Correct 84 ms 11012 KB Output is correct
3 Correct 89 ms 11012 KB Oczekiwano NIE

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 11012 KB Oczekiwano NIE
2 Correct 128 ms 19544 KB Output is correct
3 Correct 152 ms 19544 KB Oczekiwano NIE

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 316 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 #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 282 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 #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 651 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 518 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -