답안 #976586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976586 2024-05-06T19:04:24 Z Isam Gap (APIO16_gap) C++17
30 / 100
42 ms 3868 KB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

long long findGap(int T, int N){
	
	long long mn, mx, ans = -((long long)1E18 + 7);
	
	vector<long long> a(N+1, 0ll);
	
	MinMax(0ll, (long long)1E18, &mn, &mx);
	
	a[1] = mn, a[N] = mx;
	
	if(T == 1 || N <= 10){
	
		for(register int i = 2; i <= N/2 + (N & 1); ++i){
		
			long long l = a[i-1], r = a[N - (i-1) + 1];
		
			MinMax(l+1, r-1, &mn, &mx); // called by reference
	
			a[i] = mn, a[N - i + 1] = mx;
		
		}
		
		for(register int i = 2; i <= N; ++i) ans = max(ans, a[i] - a[i-1]);
		
		return ans;
		
	}
	
	long long blo = (mx - mn + N - 2) / (N - 1);
 	
 	int pmn{mn}, pmx{mx};
 	
	for(long long j = a[1]; j <= a[N]; j += blo){
		
 		MinMax(j + 1, j + blo, &mn, &mx);
 		
 		if(mn == -1) continue;
 		
 		ans = max(ans, mn - pmx);
 		
 		pmx = mx, pmn = mn;
 		
 		
	}
 	
 	return ans;
 	
 	
 	
 	
 	
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:17:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   17 |   for(register int i = 2; i <= N/2 + (N & 1); ++i){
      |                    ^
gap.cpp:27:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   27 |   for(register int i = 2; i <= N; ++i) ans = max(ans, a[i] - a[i-1]);
      |                    ^
gap.cpp:35:11: warning: narrowing conversion of 'mn' from 'long long int' to 'int' [-Wnarrowing]
   35 |   int pmn{mn}, pmx{mx};
      |           ^~
gap.cpp:35:20: warning: narrowing conversion of 'mx' from 'long long int' to 'int' [-Wnarrowing]
   35 |   int pmn{mn}, pmx{mx};
      |                    ^~
gap.cpp:35:7: warning: variable 'pmn' set but not used [-Wunused-but-set-variable]
   35 |   int pmn{mn}, pmx{mx};
      |       ^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2752 KB Output is correct
17 Correct 8 ms 2588 KB Output is correct
18 Correct 8 ms 2584 KB Output is correct
19 Correct 8 ms 2752 KB Output is correct
20 Correct 7 ms 2568 KB Output is correct
21 Correct 29 ms 3620 KB Output is correct
22 Correct 30 ms 3556 KB Output is correct
23 Correct 30 ms 3624 KB Output is correct
24 Correct 30 ms 3868 KB Output is correct
25 Correct 26 ms 3620 KB Output is correct
26 Correct 30 ms 3700 KB Output is correct
27 Correct 29 ms 3620 KB Output is correct
28 Correct 30 ms 3628 KB Output is correct
29 Correct 31 ms 3628 KB Output is correct
30 Correct 25 ms 3620 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 0 ms 2392 KB Output isn't correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Correct 1 ms 2392 KB Output is correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Incorrect 0 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 1 ms 2392 KB Output isn't correct
10 Correct 1 ms 2456 KB Output is correct
11 Incorrect 1 ms 2392 KB Output isn't correct
12 Incorrect 1 ms 2388 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 10 ms 2792 KB Output isn't correct
17 Incorrect 12 ms 2580 KB Output isn't correct
18 Incorrect 10 ms 2588 KB Output isn't correct
19 Incorrect 12 ms 2984 KB Output isn't correct
20 Correct 5 ms 2564 KB Output is correct
21 Incorrect 41 ms 3616 KB Output isn't correct
22 Incorrect 41 ms 3624 KB Output isn't correct
23 Incorrect 41 ms 3624 KB Output isn't correct
24 Incorrect 42 ms 3628 KB Output isn't correct
25 Incorrect 38 ms 3620 KB Output isn't correct
26 Incorrect 41 ms 3724 KB Output isn't correct
27 Incorrect 41 ms 3628 KB Output isn't correct
28 Incorrect 42 ms 3624 KB Output isn't correct
29 Incorrect 41 ms 3620 KB Output isn't correct
30 Correct 23 ms 3616 KB Output is correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 1 ms 2392 KB Output isn't correct