Submission #96053

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
96053	2019-02-05T13:40:26 Z	MohamedAhmed0	Sticks (POI11_pat)	C++14	100 / 100	467 ms	4628 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 readInt () {
	bool minus = false;
	int result = 0;
	char ch;
	ch = getchar();
	while (true) {
		if (ch == '-') break;
		if (ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if (ch == '-') minus = true; else result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	if (minus)
		return -result;
	else
		return result;
}
 
bool is_triangle(long long x , long long y , long long z)
{
    return (x < y+z && y < x + z && z < x+y) ;
}
 
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] ;
        sort(arr[i] , arr[i] + sz[i]) ;
    }
    for(int i = 0 ; i < n ; ++i)
    {
        for(int i2 = 0 ; i2 < sz[i] ; ++i2)
        {
            long long a = arr[i][i2] ;
            long long l = -1e12 , m = 1e12 , cl = -1 , cm = -1;
            for(int j = 0 ; j < n ; ++j)
            {
                if(i == j)
                    continue;
                int high = lower_bound(arr[j] , arr[j] + sz[j] , a) - arr[j] ;
                int low = high-1 ;
                if(high != sz[j])
                {
                    if(is_triangle(a*1ll , l*1ll ,  arr[j][high] * 1ll) && cl != -1)
                        return cout<<i+1<<" "<<a<<" "<<cl+1<<" "<<l<<" "<<j+1<<" "<<arr[j][high]<<"\n" , 0 ;
                }
                if(arr[j][high] == a)
                    low = high ;
                if(low >= 0)
                {
                    if(is_triangle(a * 1ll , m  * 1ll , arr[j][low] * 1ll) && cm != -1)
                        return cout<<i+1<<" "<<a<<" "<<cm+1<<" "<<m<<" "<<j+1<<" "<<arr[j][low]<<"\n" , 0 ;
                }
                if(high != sz[j])
                {
                    if(arr[j][high] * 1ll >= a && arr[j][high] * 1ll < m)
                        cm = j , m = arr[j][high] ;
                }
                if(low >= 0)
                {
                    if(arr[j][low] * 1ll <= a && arr[j][low] * 1ll > l)
                        cl = j , l = arr[j][low] ;
                }
            }
        }
    }
    return cout<<"NIE\n" , 0 ;
}

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 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
8.0 / 8.0

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

Subtask #6
8.0 / 8.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	504 KB	Oczekiwano NIE
2	Correct	88 ms	1036 KB	Output is correct
3	Correct	59 ms	760 KB	Oczekiwano NIE

Subtask #9
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	46 ms	632 KB	Oczekiwano NIE
2	Correct	138 ms	1504 KB	Output is correct
3	Correct	92 ms	1040 KB	Oczekiwano NIE

Subtask #10
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	238 ms	2424 KB	Output is correct
2	Correct	167 ms	1656 KB	Output is correct
3	Correct	151 ms	1272 KB	Oczekiwano NIE

Subtask #11
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	231 ms	2552 KB	Output is correct
2	Correct	211 ms	1912 KB	Output is correct
3	Correct	188 ms	1760 KB	Oczekiwano NIE

Subtask #12
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	466 ms	4628 KB	Output is correct
2	Correct	214 ms	2000 KB	Output is correct
3	Correct	256 ms	2168 KB	Oczekiwano NIE

Subtask #13
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	467 ms	4592 KB	Output is correct
2	Correct	351 ms	2296 KB	Output is correct
3	Correct	345 ms	2652 KB	Oczekiwano NIE

Submission #96053

Compilation message