Submission #362519

# Submission time Handle Problem Language Result Execution time Memory
362519 2021-02-03T13:34:35 Z flappybird Gap (APIO16_gap) C++14
30 / 100
56 ms 2464 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 101010
#define INF 1000000000000000001
#define pb push_back
#define all(v) v.begin(), v.end()
long long findGap(int T, int N) {
	if (T == 1) {
		ll i;
		ll l, r;
		l = 0;
		r = INF;
		int cnt = 0;
		vector<ll> arr;
		while (l <= r && cnt + 1 <= ((N + 1) / 2)) {
			MinMax(l, r, &l, &r);
			if (l != -1) arr.pb(l);
			if (r != -1) arr.pb(r);
			l++;
			r--;
			cnt++;
		}
		sort(all(arr));
		ll ret = 0;
		for (i = 0; i < arr.size() - 1; i++) ret = max(ret, arr[i + 1] - arr[i]);
		return ret;
	}
	else {

	}
	return 0;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:27:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for (i = 0; i < arr.size() - 1; i++) ret = max(ret, arr[i + 1] - arr[i]);
      |               ~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 12 ms 876 KB Output is correct
17 Correct 13 ms 876 KB Output is correct
18 Correct 15 ms 1004 KB Output is correct
19 Correct 13 ms 876 KB Output is correct
20 Correct 11 ms 1004 KB Output is correct
21 Correct 49 ms 2276 KB Output is correct
22 Correct 50 ms 2208 KB Output is correct
23 Correct 50 ms 2272 KB Output is correct
24 Correct 49 ms 2276 KB Output is correct
25 Correct 50 ms 2276 KB Output is correct
26 Correct 51 ms 2276 KB Output is correct
27 Correct 50 ms 2276 KB Output is correct
28 Correct 51 ms 2464 KB Output is correct
29 Correct 56 ms 2276 KB Output is correct
30 Correct 42 ms 2388 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Incorrect 0 ms 364 KB Output isn't correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Incorrect 0 ms 364 KB Output isn't correct
6 Incorrect 1 ms 364 KB Output isn't correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Incorrect 1 ms 364 KB Output isn't correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Incorrect 0 ms 364 KB Output isn't correct
11 Incorrect 1 ms 364 KB Output isn't correct
12 Incorrect 1 ms 364 KB Output isn't correct
13 Incorrect 1 ms 364 KB Output isn't correct
14 Incorrect 1 ms 364 KB Output isn't correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Incorrect 6 ms 492 KB Output isn't correct
17 Incorrect 8 ms 492 KB Output isn't correct
18 Incorrect 6 ms 492 KB Output isn't correct
19 Incorrect 6 ms 492 KB Output isn't correct
20 Incorrect 4 ms 492 KB Output isn't correct
21 Incorrect 24 ms 1232 KB Output isn't correct
22 Incorrect 24 ms 1132 KB Output isn't correct
23 Incorrect 24 ms 1132 KB Output isn't correct
24 Incorrect 23 ms 1132 KB Output isn't correct
25 Incorrect 19 ms 1132 KB Output isn't correct
26 Incorrect 25 ms 1280 KB Output isn't correct
27 Incorrect 24 ms 1132 KB Output isn't correct
28 Incorrect 24 ms 1132 KB Output isn't correct
29 Incorrect 25 ms 1196 KB Output isn't correct
30 Incorrect 14 ms 1132 KB Output isn't correct
31 Incorrect 1 ms 364 KB Output isn't correct
32 Incorrect 0 ms 364 KB Output isn't correct