oj.uz

Submission #95961

# Submission time Handle Problem Language Result Execution time Memory
95961 2019-02-04T17:49:37 Z MohamedAhmed0 Sticks (POI11_pat) C++14
28 / 100
 1000 ms 4600 KB 
#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 ;
}

Compilation message

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.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
7.0 / 7.0

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

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Oczekiwano NIE
2 Execution timed out 1071 ms 504 KB Time limit exceeded

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 376 KB Oczekiwano NIE
2 Execution timed out 1064 ms 504 KB Time limit exceeded

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 632 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 2440 KB Output is correct
2 Execution timed out 1071 ms 1628 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2588 KB Output is correct
2 Execution timed out 1080 ms 1784 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 4532 KB Output is correct
2 Execution timed out 1081 ms 2040 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 4600 KB Output is correct
2 Execution timed out 1079 ms 2296 KB Time limit exceeded
3 Halted 0 ms 0 KB -