oj.uz

답안 #1050470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050470 2024-08-09T09:57:11 Z MrAndria Gap (APIO16_gap) C++14
87.1761 / 100
 38 ms 4432 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






// 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){
    if(sub==2){
        long long l,r,last,mi,mx,sum,last1,k;
        MinMax(1,1e18,&l,&r);
        k=sum=(r-l+n-2)/(n-1);
        last=l;
        last1=l;
        for(long long i=l;i+k<r;i+=k){
            last1=i;
            MinMax(i,i+k,&mi,&mx);
            if(mi!=-1 and mx!=-1){
                sum=max(sum,mi-last);
                last=mx;
            }
            i++;
        }
        MinMax(last1,r,&mi,&mx);
        if(mi!=-1 and mx!=-1){
            sum=max(sum,mi-last);
        }
        return sum; 
    }else{
        long long a[200005],tl,tr,l,r,mx;
        mx=0;
        l=1;
        r=n;
        tl=0;
        tr=1e18;
        while(l<=r){
            MinMax(tl,tr,&a[l],&a[r]);
            tl=a[l]+1;
            tr=a[r]-1;
            l++;
            r--;
        }
        for(int i=2;i<=n;i++){
            mx=max(mx,a[i]-a[i-1]);
        }
        return mx;
    }
}
// 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);
// }

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 3928 KB Output is correct
3 Correct 1 ms 3928 KB Output is correct
4 Correct 1 ms 3928 KB Output is correct
5 Correct 1 ms 3928 KB Output is correct
6 Correct 1 ms 3928 KB Output is correct
7 Correct 1 ms 3928 KB Output is correct
8 Correct 1 ms 3928 KB Output is correct
9 Correct 1 ms 3956 KB Output is correct
10 Correct 1 ms 3928 KB Output is correct
11 Correct 1 ms 3928 KB Output is correct
12 Correct 1 ms 3928 KB Output is correct
13 Correct 1 ms 3928 KB Output is correct
14 Correct 1 ms 3928 KB Output is correct
15 Correct 1 ms 3928 KB Output is correct
16 Correct 6 ms 3928 KB Output is correct
17 Correct 6 ms 3928 KB Output is correct
18 Correct 6 ms 3928 KB Output is correct
19 Correct 6 ms 4156 KB Output is correct
20 Correct 5 ms 4156 KB Output is correct
21 Correct 22 ms 4384 KB Output is correct
22 Correct 30 ms 4184 KB Output is correct
23 Correct 22 ms 4184 KB Output is correct
24 Correct 21 ms 4324 KB Output is correct
25 Correct 19 ms 4184 KB Output is correct
26 Correct 25 ms 4184 KB Output is correct
27 Correct 30 ms 4176 KB Output is correct
28 Correct 21 ms 4184 KB Output is correct
29 Correct 21 ms 4184 KB Output is correct
30 Correct 24 ms 4184 KB Output is correct
31 Correct 1 ms 3928 KB Output is correct
32 Correct 1 ms 3928 KB Output is correct

Subtask #2
57.1760653723 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3928 KB Output is correct
2 Partially correct 2 ms 3928 KB Partially correct
3 Partially correct 1 ms 3928 KB Partially correct
4 Partially correct 1 ms 3928 KB Partially correct
5 Partially correct 1 ms 3856 KB Partially correct
6 Correct 1 ms 3928 KB Output is correct
7 Partially correct 1 ms 3928 KB Partially correct
8 Correct 1 ms 3928 KB Output is correct
9 Partially correct 1 ms 3928 KB Partially correct
10 Correct 1 ms 3928 KB Output is correct
11 Correct 1 ms 3928 KB Output is correct
12 Correct 1 ms 3928 KB Output is correct
13 Partially correct 1 ms 3928 KB Partially correct
14 Correct 1 ms 3928 KB Output is correct
15 Partially correct 1 ms 4060 KB Partially correct
16 Correct 9 ms 3928 KB Output is correct
17 Correct 8 ms 4156 KB Output is correct
18 Partially correct 7 ms 3964 KB Partially correct
19 Partially correct 7 ms 4020 KB Partially correct
20 Correct 6 ms 3928 KB Output is correct
21 Correct 37 ms 4180 KB Output is correct
22 Correct 29 ms 4184 KB Output is correct
23 Correct 29 ms 4184 KB Output is correct
24 Correct 30 ms 4184 KB Output is correct
25 Partially correct 28 ms 4432 KB Partially correct
26 Partially correct 30 ms 4184 KB Partially correct
27 Partially correct 38 ms 4204 KB Partially correct
28 Correct 30 ms 4184 KB Output is correct
29 Partially correct 30 ms 4184 KB Partially correct
30 Correct 24 ms 4184 KB Output is correct
31 Correct 2 ms 3928 KB Output is correct
32 Partially correct 2 ms 3928 KB Partially correct