제출 #95961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95961		MohamedAhmed0	Sticks (POI11_pat)	C++14	28 / 100	1082 ms	4600 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 ;
    scanf("%d" , &n) ;
    for(int i = 0 ; i < n ; ++i)
    {
        scanf("%d" , &sz[i]);
        for(int j = 0 ; j < sz[i] ; ++j)
            scanf("%d" , &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 printf("%d %d %d %d %d %d" , i+1 , a , j+1 , b , k+1 , c) , 0 ;
                        }
                    }
                }
            }
        }
    }
    return printf("NIE") , 0 ;
}

컴파일 시 표준 에러 (stderr) 메시지

pat.cpp: In function 'int main()':
pat.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d" , &n) ;
     ~~~~~^~~~~~~~~~~
pat.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d" , &sz[i]);
         ~~~~~^~~~~~~~~~~~~~~
pat.cpp:18:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d" , &arr[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~

• 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