답안 #1096917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096917 2024-10-05T12:44:30 Z Newtonabc Gap (APIO16_gap) C++14
30 / 100
34 ms 1996 KB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long arr[N];
long long findGap(int T, int N)
{
	if(T==1){
		long long ans=LLONG_MIN;
		int lind=1,rind=N;
		long long l=0,r=1e18,mn,mx;
		while(lind<=rind){
			MinMax(l,r,&mn,&mx);
			if(mn==-1) break;
			arr[lind]=mn,arr[rind]=mx;
			lind++,rind--;
			l=mn+1,r=mx-1;
		}
		for(int i=1;i<N;i++){
			ans=max(ans,arr[i+1]-arr[i]);
		}
		/*for(int i=0;i<N;i++) cout<<arr[i] <<" ";
		cout<<"\n\n";*/
		return ans;
	}
	
		
	
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
   29 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 372 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 408 KB Output is correct
7 Correct 0 ms 592 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 7 ms 812 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 8 ms 744 KB Output is correct
19 Correct 8 ms 600 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 34 ms 1916 KB Output is correct
22 Correct 27 ms 1872 KB Output is correct
23 Correct 26 ms 1880 KB Output is correct
24 Correct 25 ms 1880 KB Output is correct
25 Correct 29 ms 1880 KB Output is correct
26 Correct 28 ms 1944 KB Output is correct
27 Correct 27 ms 1784 KB Output is correct
28 Correct 31 ms 1880 KB Output is correct
29 Correct 27 ms 1880 KB Output is correct
30 Correct 22 ms 1936 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 1 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 1 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 6 ms 692 KB Partially correct
17 Partially correct 6 ms 856 KB Partially correct
18 Partially correct 9 ms 600 KB Partially correct
19 Partially correct 7 ms 600 KB Partially correct
20 Partially correct 5 ms 600 KB Partially correct
21 Incorrect 26 ms 1880 KB Expected int32, but "2500100000" found
22 Incorrect 27 ms 1872 KB Expected int32, but "2500100000" found
23 Incorrect 27 ms 1996 KB Expected int32, but "2500100000" found
24 Incorrect 27 ms 1872 KB Expected int32, but "2500100000" found
25 Incorrect 23 ms 1876 KB Expected int32, but "2500100000" found
26 Incorrect 25 ms 1872 KB Expected int32, but "2500100000" found
27 Incorrect 25 ms 1872 KB Expected int32, but "2500100000" found
28 Incorrect 29 ms 1872 KB Expected int32, but "2500100000" found
29 Incorrect 30 ms 1872 KB Expected int32, but "2500100000" found
30 Incorrect 21 ms 1888 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 344 KB Partially correct
32 Partially correct 1 ms 344 KB Partially correct