Submission #82277

# Submission time Handle Problem Language Result Execution time Memory
82277 2018-10-29T17:34:37 Z Bodo171 Gap (APIO16_gap) C++14
100 / 100
83 ms 2192 KB
#include "gap.h"
#include <iostream>
#include <climits>
using namespace std;
const int nmax=100005;
long long v[nmax];
long long mx,st,dr,act,inf,sup,i;
int n;
long long findGap(int T, int N)
{
    n=N;
    if(T==1)
    {
        mx=0;
        v[0]=-1;v[n+1]=1LL*1e18;
        v[n+1]++;//don't mess with 1e18
        for(i=1;i<=n/2;i++)
        {
            MinMax(v[i-1]+1,v[n-i+2]-1,&v[i],&v[n-i+1]);
        }
        if((n&1))
        {
            MinMax(v[n/2]+1,v[n/2+2]-1,&v[(n+1)/2],&sup);
        }
        for(i=1;i<n;i++)
            mx=1LL*max(mx,1LL*v[i+1]-v[i]);
        return mx;
    }
    act=-1;
    long long mare=1LL*1e18;
    MinMax(0,mare,&inf,&sup);
    long long nn=n,ans=0;
    long long def=1LL*(sup-inf)/(nn-1);
    if((sup-inf)%(nn-1))
        def+=1LL;
    act=1LL*inf;ans=1LL*def;
    long long dr_vechi=inf;
    for(long long i=1;i<=n-1&&act;i++)
    {
            MinMax(act+1LL*(i-1)*def+1,act+1LL*i*def,&st,&dr);
            if(dr!=-1)
            {
                ans=1LL*max(1LL*st-dr_vechi,ans);
                dr_vechi=dr;
            }
    }//am schimbat ca poate nu e eval bun
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 476 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 2 ms 720 KB Output is correct
9 Correct 2 ms 720 KB Output is correct
10 Correct 2 ms 720 KB Output is correct
11 Correct 3 ms 720 KB Output is correct
12 Correct 3 ms 720 KB Output is correct
13 Correct 3 ms 720 KB Output is correct
14 Correct 3 ms 720 KB Output is correct
15 Correct 2 ms 720 KB Output is correct
16 Correct 15 ms 1020 KB Output is correct
17 Correct 15 ms 1020 KB Output is correct
18 Correct 15 ms 1020 KB Output is correct
19 Correct 23 ms 1020 KB Output is correct
20 Correct 12 ms 1020 KB Output is correct
21 Correct 60 ms 2092 KB Output is correct
22 Correct 55 ms 2124 KB Output is correct
23 Correct 54 ms 2172 KB Output is correct
24 Correct 55 ms 2172 KB Output is correct
25 Correct 49 ms 2192 KB Output is correct
26 Correct 55 ms 2192 KB Output is correct
27 Correct 61 ms 2192 KB Output is correct
28 Correct 54 ms 2192 KB Output is correct
29 Correct 54 ms 2192 KB Output is correct
30 Correct 41 ms 2192 KB Output is correct
31 Correct 2 ms 2192 KB Output is correct
32 Correct 2 ms 2192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2192 KB Output is correct
2 Correct 2 ms 2192 KB Output is correct
3 Correct 2 ms 2192 KB Output is correct
4 Correct 2 ms 2192 KB Output is correct
5 Correct 2 ms 2192 KB Output is correct
6 Correct 2 ms 2192 KB Output is correct
7 Correct 2 ms 2192 KB Output is correct
8 Correct 2 ms 2192 KB Output is correct
9 Correct 2 ms 2192 KB Output is correct
10 Correct 2 ms 2192 KB Output is correct
11 Correct 4 ms 2192 KB Output is correct
12 Correct 3 ms 2192 KB Output is correct
13 Correct 3 ms 2192 KB Output is correct
14 Correct 3 ms 2192 KB Output is correct
15 Correct 3 ms 2192 KB Output is correct
16 Correct 19 ms 2192 KB Output is correct
17 Correct 19 ms 2192 KB Output is correct
18 Correct 19 ms 2192 KB Output is correct
19 Correct 21 ms 2192 KB Output is correct
20 Correct 10 ms 2192 KB Output is correct
21 Correct 73 ms 2192 KB Output is correct
22 Correct 74 ms 2192 KB Output is correct
23 Correct 83 ms 2192 KB Output is correct
24 Correct 73 ms 2192 KB Output is correct
25 Correct 68 ms 2192 KB Output is correct
26 Correct 73 ms 2192 KB Output is correct
27 Correct 73 ms 2192 KB Output is correct
28 Correct 72 ms 2192 KB Output is correct
29 Correct 73 ms 2192 KB Output is correct
30 Correct 39 ms 2192 KB Output is correct
31 Correct 2 ms 2192 KB Output is correct
32 Correct 2 ms 2192 KB Output is correct