oj.uz

Submission #1050445

# Submission time Handle Problem Language Result Execution time Memory
1050445 2024-08-09T09:40:25 Z MrAndria Gap (APIO16_gap) C++14
0 / 100
 2000 ms 2900 KB 
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>

#include "gap.h"

// static void my_assert(int k){ if (!k) exit(1); }

// static int subtask_num, N;
// static long long A[100001];
// static long long call_count;
using namespace std;
#define ff first;
#define ss second
#define pb push_back
//#define int long long
long long a[200005],tl,tr,l,r,mx;





// void MinMax(long long s, long long t, long long *mn, long long *mx)
// {
// 	int lo = 1, hi = N, left = N+1, right = 0;
// 	my_assert(s <= t && mn != NULL && mx != NULL);
// 	while (lo <= hi){
// 		int mid = (lo+hi)>>1;
// 		if (A[mid] >= s) hi = mid - 1, left = mid;
// 		else lo = mid + 1;
// 	}
// 	lo = 1, hi = N;
// 	while (lo <= hi){
// 		int mid = (lo+hi)>>1;
// 		if (A[mid] <= t) lo = mid + 1, right = mid;
// 		else hi = mid - 1;
// 	}
// 	if (left > right) *mn = *mx = -1;
// 	else{
// 		*mn = A[left];
// 		*mx = A[right];
// 	}
// 	if (subtask_num == 1) call_count++;
// 	else if (subtask_num == 2) call_count += right-left+2;
// }
long long findGap(int sub,int n){
    long long l,r,last,mi,mx,sum=0,last1;
    MinMax(1,1e18,&l,&r);
    long long k=(r-l+n-2)/(n-1);
    last=l;
    for(int i=l;i+k<=r;i+=k){
        last1=i;
        MinMax(i,i+k,&mi,&mx);
        if(mi!=-1 and mx!=-1){
            sum=max(sum,mx-mi);
            last=mx;
        }

        i++;
    }
    MinMax(last1,r,&mi,&mx);
    if(mi!=-1 and mx!=-1){
        sum=max(sum,mx-last);
    }
    return sum;
}
// int main()
// {
//     cin>>N;
// 	for (int i=1;i<=N;i++) cin>>A[i];
// 	printf("%lld\n", findGap(subtask_num, N));
// 	printf("%lld\n", call_count);
// }

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:61:11: warning: 'last1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |     MinMax(last1,r,&mi,&mx);
      |     ~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 344 KB Time limit exceeded
2 Execution timed out 3055 ms 2392 KB Time limit exceeded
3 Execution timed out 3067 ms 2392 KB Time limit exceeded
4 Execution timed out 3067 ms 2388 KB Time limit exceeded
5 Incorrect 0 ms 2392 KB Output isn't correct
6 Execution timed out 3070 ms 2392 KB Time limit exceeded
7 Execution timed out 3052 ms 2392 KB Time limit exceeded
8 Execution timed out 3077 ms 2392 KB Time limit exceeded
9 Execution timed out 3063 ms 2392 KB Time limit exceeded
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Execution timed out 3033 ms 2392 KB Time limit exceeded
12 Execution timed out 3039 ms 2392 KB Time limit exceeded
13 Execution timed out 3033 ms 2392 KB Time limit exceeded
14 Execution timed out 3057 ms 2392 KB Time limit exceeded
15 Execution timed out 3075 ms 2392 KB Time limit exceeded
16 Execution timed out 3058 ms 2392 KB Time limit exceeded
17 Execution timed out 3074 ms 2392 KB Time limit exceeded
18 Execution timed out 3078 ms 2392 KB Time limit exceeded
19 Execution timed out 3033 ms 2392 KB Time limit exceeded
20 Incorrect 4 ms 2392 KB Output isn't correct
21 Execution timed out 3084 ms 2648 KB Time limit exceeded
22 Execution timed out 3062 ms 2648 KB Time limit exceeded
23 Execution timed out 3037 ms 2648 KB Time limit exceeded
24 Execution timed out 3045 ms 2648 KB Time limit exceeded
25 Execution timed out 3068 ms 2648 KB Time limit exceeded
26 Execution timed out 3014 ms 2648 KB Time limit exceeded
27 Execution timed out 3065 ms 2648 KB Time limit exceeded
28 Execution timed out 3035 ms 2680 KB Time limit exceeded
29 Execution timed out 3040 ms 2900 KB Time limit exceeded
30 Incorrect 19 ms 2648 KB Output isn't correct
31 Execution timed out 3091 ms 2392 KB Time limit exceeded
32 Execution timed out 3024 ms 2392 KB Time limit exceeded

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3058 ms 2392 KB Time limit exceeded
2 Execution timed out 3045 ms 2392 KB Time limit exceeded
3 Execution timed out 3060 ms 2392 KB Time limit exceeded
4 Execution timed out 3079 ms 2392 KB Time limit exceeded
5 Partially correct 1 ms 2392 KB Partially correct
6 Execution timed out 3097 ms 2392 KB Time limit exceeded
7 Execution timed out 3074 ms 2392 KB Time limit exceeded
8 Execution timed out 3040 ms 2392 KB Time limit exceeded
9 Execution timed out 3052 ms 2392 KB Time limit exceeded
10 Incorrect 0 ms 2392 KB Output isn't correct
11 Execution timed out 3093 ms 2392 KB Time limit exceeded
12 Execution timed out 3063 ms 2392 KB Time limit exceeded
13 Execution timed out 3067 ms 2392 KB Time limit exceeded
14 Execution timed out 3041 ms 2392 KB Time limit exceeded
15 Execution timed out 3090 ms 2392 KB Time limit exceeded
16 Execution timed out 3081 ms 2392 KB Time limit exceeded
17 Execution timed out 3089 ms 2392 KB Time limit exceeded
18 Execution timed out 3077 ms 2480 KB Time limit exceeded
19 Execution timed out 3034 ms 2392 KB Time limit exceeded
20 Incorrect 7 ms 2392 KB Output isn't correct
21 Execution timed out 3074 ms 2480 KB Time limit exceeded
22 Execution timed out 3047 ms 2648 KB Time limit exceeded
23 Execution timed out 3062 ms 2648 KB Time limit exceeded
24 Execution timed out 3076 ms 2648 KB Time limit exceeded
25 Execution timed out 3069 ms 2648 KB Time limit exceeded
26 Execution timed out 3055 ms 2648 KB Time limit exceeded
27 Execution timed out 3062 ms 2616 KB Time limit exceeded
28 Execution timed out 3024 ms 2648 KB Time limit exceeded
29 Execution timed out 3067 ms 2532 KB Time limit exceeded
30 Incorrect 17 ms 2648 KB Output isn't correct
31 Execution timed out 3076 ms 2392 KB Time limit exceeded
32 Execution timed out 3058 ms 2392 KB Time limit exceeded