Submission #95959

#	Time	Username	Problem	Language	Result	Execution time	Memory
95959		MohamedAhmed0	Sticks (POI11_pat)	C++14	28 / 100	1079 ms	14304 KiB

pat

#include <bits/stdc++.h>

using namespace std;

const int MAXK = 55 ;
const int MAXN = 1e6+10 ;
int arr[MAXK][MAXN] , sz[MAXK];
int k ;

int main()
{
    int n ;
    cin>>n ;
    for(int i = 0 ; i < n ; ++i)
    {
        cin>>sz[i] ;
        for(int j = 0 ; j < sz[i] ; ++j)
            cin>>arr[i][j] ;
    }
    for(int i = 0 ; i < n ; ++i)
    {
        for(int i2 = 0 ; i2 < sz[i] ; ++i2)
        {
            int a = arr[i][i2] ;
            for(int j = i+1 ; j < n ; ++j)
            {
                for(int j2 = 0 ; j2 < sz[j] ; ++j2)
                {
                    int b = arr[j][j2] ;
                    for(int k = j+1 ; k < n ; ++k)
                    {
                        for(int k2 = 0 ; k2 < sz[k] ; ++k2)
                        {
                            int c = arr[k][k2] ;
                            if(a < b+c && b < a+c && c < a+b)
                                return cout<<i+1<<" "<<a<<" "<<j+1<<" "<<b<<" "<<k+1<<" "<<c<<"\n" , 0 ;
                        }
                    }
                }
            }
        }
    }
    return cout<<"NIE\n" , 0 ;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 0 / 8