Submission #21915

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
21915	2017-04-27T11:14:53 Z	sampriti	Gap (APIO16_gap)	C++14	59.0376 / 100	96 ms	7456 KB

gap

#include "gap.h"

#include <climits>
#include <vector>

using namespace std;

long long findGap(int T, int N) {
  long long L, R;
  MinMax(0, LLONG_MAX, &L, &R);
  long long diff = (R - L - 1)/(N - 1);

  vector<pair<long long, long long> > cands;
  cands.push_back({L, L});
  for(long long x = L + 1; x <= R - 1; x += diff) {
    long long qL, qR;
    MinMax(x, min(x + diff - 1, R - 1), &qL, &qR);
    if(qL != -1) cands.push_back({qL, qR});
  }
  cands.push_back({R, R});

  long long ans = 0;
  for(int i = 1; i < cands.size(); i++) {
    ans = max(ans, cands[i].first - cands[i - 1].second);
  }
  return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < cands.size(); i++) {
                    ^

Subtask #1

0 / 30.0

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

Subtask #2

59.037623636 / 70.0

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