Submission #21892

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
21892	2017-04-26T16:45:02 Z	mohammad_kilani	Gap (APIO16_gap)	C++14	18.6188 / 100	76 ms	5144 KB

gap

#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

map<long long,bool> vis;
vector<long long> v;

long long findGap(int T, int N)
{
    long long ans = 0 ;
    long long s,e;
    MinMax(0,1e18,&s,&e);
    long long step = (e-s)/(N-1);
    ans = step;
    long long mn,mx;
    for(long long i = s+step;i<e;){
        MinMax(s,i,&mn,&mx);
        if (mx != s){
            s = mx;
            i = s+step;
        }
        else{
            MinMax(i,e,&mn,&mx);
            ans = max(ans,(mn-s));
            step = ans;
            i = mn+step;
        }
    }
    return ans;
}

Subtask #1

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	5144 KB	Output is correct
2	Incorrect	0 ms	5144 KB	Output isn't correct
3	Incorrect	0 ms	5144 KB	Output isn't correct
4	Incorrect	0 ms	5144 KB	Output isn't correct
5	Incorrect	0 ms	5144 KB	Output isn't correct
6	Correct	0 ms	5144 KB	Output is correct
7	Correct	0 ms	5144 KB	Output is correct
8	Correct	0 ms	5144 KB	Output is correct
9	Correct	0 ms	5144 KB	Output is correct
10	Correct	0 ms	5144 KB	Output is correct
11	Correct	0 ms	5144 KB	Output is correct
12	Correct	0 ms	5144 KB	Output is correct
13	Correct	0 ms	5144 KB	Output is correct
14	Correct	0 ms	5144 KB	Output is correct
15	Incorrect	0 ms	5144 KB	Output isn't correct
16	Correct	6 ms	5144 KB	Output is correct
17	Correct	9 ms	5144 KB	Output is correct
18	Correct	9 ms	5144 KB	Output is correct
19	Correct	6 ms	5144 KB	Output is correct
20	Correct	3 ms	5144 KB	Output is correct
21	Correct	36 ms	5144 KB	Output is correct
22	Correct	36 ms	5144 KB	Output is correct
23	Correct	33 ms	5144 KB	Output is correct
24	Correct	36 ms	5144 KB	Output is correct
25	Incorrect	76 ms	5144 KB	Output isn't correct
26	Correct	33 ms	5144 KB	Output is correct
27	Correct	36 ms	5144 KB	Output is correct
28	Correct	36 ms	5144 KB	Output is correct
29	Correct	33 ms	5144 KB	Output is correct
30	Correct	9 ms	5144 KB	Output is correct
31	Correct	0 ms	5144 KB	Output is correct
32	Correct	0 ms	5144 KB	Output is correct

Subtask #2

18.6187536013 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	5144 KB	Output is correct
2	Partially correct	0 ms	5144 KB	Partially correct
3	Partially correct	0 ms	5144 KB	Partially correct
4	Partially correct	0 ms	5144 KB	Partially correct
5	Partially correct	0 ms	5144 KB	Partially correct
6	Partially correct	0 ms	5144 KB	Partially correct
7	Partially correct	0 ms	5144 KB	Partially correct
8	Partially correct	0 ms	5144 KB	Partially correct
9	Partially correct	0 ms	5144 KB	Partially correct
10	Correct	0 ms	5144 KB	Output is correct
11	Partially correct	0 ms	5144 KB	Partially correct
12	Partially correct	0 ms	5144 KB	Partially correct
13	Partially correct	0 ms	5144 KB	Partially correct
14	Partially correct	0 ms	5144 KB	Partially correct
15	Partially correct	0 ms	5144 KB	Partially correct
16	Partially correct	9 ms	5144 KB	Partially correct
17	Partially correct	3 ms	5144 KB	Partially correct
18	Partially correct	9 ms	5144 KB	Partially correct
19	Partially correct	9 ms	5144 KB	Partially correct
20	Correct	3 ms	5144 KB	Output is correct
21	Partially correct	29 ms	5144 KB	Partially correct
22	Partially correct	33 ms	5144 KB	Partially correct
23	Partially correct	29 ms	5144 KB	Partially correct
24	Partially correct	36 ms	5144 KB	Partially correct
25	Partially correct	66 ms	5144 KB	Partially correct
26	Partially correct	33 ms	5144 KB	Partially correct
27	Partially correct	26 ms	5144 KB	Partially correct
28	Partially correct	26 ms	5144 KB	Partially correct
29	Partially correct	29 ms	5144 KB	Partially correct
30	Correct	13 ms	5144 KB	Output is correct
31	Correct	0 ms	5144 KB	Output is correct
32	Correct	0 ms	5144 KB	Output is correct