oj.uz

Submission #167877

# Submission time Handle Problem Language Result Execution time Memory
167877 2019-12-10T16:54:56 Z stefdasca Gap (APIO16_gap) C++14
100 / 100
 67 ms 3832 KB 
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;

long long v[100002];

/*

int N;

long long A[100002];
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
	int lo = 1, hi = N, left = N+1, right = 0;
	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];
	}
}
*/

long long findGap(int T, int N)
{
    long long ans = 0;
    long long st = 0;
    long long dr = 1;
    for(int i = 1; i <= 18; ++i)
        dr = dr * 10LL;
    if(T == 1)
    {
        int a = 1;
        int b = N;
        while(a <= b)
        {
            long long st2;
            long long dr2;
            if(a == 1)
                MinMax(st, dr, &st2, &dr2);
            else
                MinMax(st+1, dr-1, &st2, &dr2);
            v[a] = st2;
            v[b] = dr2;
            ++a;
            --b;
            st = st2;
            dr = dr2;
        }
        for(int i = 1; i < N; ++i)
            ans = max(ans, v[i+1] - v[i]);
    }
    else
    {
        long long st2;
        long long dr2;
        MinMax(st, dr, &st2, &dr2);
        st = st2;
        dr = dr2;
        long long max_val = dr;
        ans = (dr - st) / (N - 1);
        int ic = 0;
        while(st <= max_val)
        {
            dr = min(max_val, st + ans);
            if(max_val - st <= ans)
                break;
            long long sst = st + 1;
            while(1)
            {
                long long st2;
                long long dr2;
                ++ic;
               // cout << sst << " " << dr << '\n';
                MinMax(sst, dr, &st2, &dr2);
                if(dr2 == -1)
                {
                    sst = dr + 1;
                    dr = min(max_val, dr + ans);
                }
                else
                {
                    ans = max(ans, st2 - st);
                    st = dr2;
                    break;
                }
            }
        }
      //  cout << ic << '\n';
    }
    return ans;
}
/*
int main()
{
    cin >> N;
    for(int i = 1; i <= N; ++i)
        cin >> A[i];
    cout << findGap(2, N);
    return 0;
}
*/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 15 ms 1272 KB Output is correct
17 Correct 15 ms 1272 KB Output is correct
18 Correct 15 ms 1272 KB Output is correct
19 Correct 15 ms 1272 KB Output is correct
20 Correct 11 ms 888 KB Output is correct
21 Correct 55 ms 3324 KB Output is correct
22 Correct 55 ms 3704 KB Output is correct
23 Correct 55 ms 3708 KB Output is correct
24 Correct 55 ms 3704 KB Output is correct
25 Correct 48 ms 3192 KB Output is correct
26 Correct 55 ms 3704 KB Output is correct
27 Correct 55 ms 3832 KB Output is correct
28 Correct 55 ms 3704 KB Output is correct
29 Correct 55 ms 3704 KB Output is correct
30 Correct 41 ms 2500 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 11 ms 1016 KB Output is correct
17 Correct 11 ms 1016 KB Output is correct
18 Correct 11 ms 1016 KB Output is correct
19 Correct 11 ms 1012 KB Output is correct
20 Correct 7 ms 632 KB Output is correct
21 Correct 36 ms 3068 KB Output is correct
22 Correct 37 ms 2936 KB Output is correct
23 Correct 36 ms 2964 KB Output is correct
24 Correct 36 ms 3064 KB Output is correct
25 Correct 67 ms 2296 KB Output is correct
26 Correct 37 ms 3064 KB Output is correct
27 Correct 37 ms 2936 KB Output is correct
28 Correct 47 ms 2936 KB Output is correct
29 Correct 36 ms 2936 KB Output is correct
30 Correct 27 ms 1784 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct