oj.uz

답안 #23397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23397 2017-05-08T18:08:48 Z noobprogrammer Gap (APIO16_gap) C++14
30 / 100
 76 ms 5924 KB 
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define ii pair<int,int>
#define vii vector<pair<int,int> >
#define vi vector<int>

ll arr[100010] ;

ll findGap(int t , int n){
	int sz = n ;
	if(t == 1){
		MinMax( 0 , 1e18 , arr + 1 , arr + n ) ;
		sz-=2 ;
		int  i = 1 ;
		while(sz > 0){
			MinMax( arr[i]+1 , arr[n-i+1]-1 , arr + i + 1 , arr + n - i  ) ;
			sz-=2 ;
			i++ ;
		}
		ll res = 0 ;
		for(int i=1;i<n;i++) res = max(arr[i+1] - arr[i] , res) ;
		return res ;
	}
	else{
		ll mn , mx , len , seg , a , b ;
		MinMax(0 , 1e18 , &mn , &mx ) ;
		len = mx - mn + 1 ; seg = len/n ;
		ll res = 0 , lst = mn ;
		MinMax( mn+1 , mn + seg - 1 , &a , &b ) ;
		if(a != -1) res = a - lst , lst = b ;
		for(ll i=mn+seg ; i<mx ; i+=seg) {
			MinMax( i+1 , min(i + seg - 1 , mx-1 ) , &a , &b ) ;
			if(a > -1) res = max(res , a - lst) , lst = b ;
		}
		return res ; 
	}
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Correct 0 ms 5924 KB Output is correct
5 Correct 0 ms 5924 KB Output is correct
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 13 ms 5924 KB Output is correct
17 Correct 13 ms 5924 KB Output is correct
18 Correct 13 ms 5924 KB Output is correct
19 Correct 16 ms 5924 KB Output is correct
20 Correct 9 ms 5924 KB Output is correct
21 Correct 49 ms 5924 KB Output is correct
22 Correct 53 ms 5924 KB Output is correct
23 Correct 49 ms 5924 KB Output is correct
24 Correct 49 ms 5924 KB Output is correct
25 Correct 46 ms 5924 KB Output is correct
26 Correct 46 ms 5924 KB Output is correct
27 Correct 53 ms 5924 KB Output is correct
28 Correct 49 ms 5924 KB Output is correct
29 Correct 56 ms 5924 KB Output is correct
30 Correct 36 ms 5924 KB Output is correct
31 Correct 0 ms 5924 KB Output is correct
32 Correct 0 ms 5924 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 5924 KB Output isn't correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Correct 0 ms 5924 KB Output is correct
5 Correct 0 ms 5924 KB Output is correct
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 23 ms 5924 KB Output is correct
17 Correct 16 ms 5924 KB Output is correct
18 Correct 16 ms 5924 KB Output is correct
19 Correct 16 ms 5924 KB Output is correct
20 Correct 6 ms 5924 KB Output is correct
21 Correct 73 ms 5924 KB Output is correct
22 Correct 76 ms 5924 KB Output is correct
23 Correct 69 ms 5924 KB Output is correct
24 Correct 73 ms 5924 KB Output is correct
25 Correct 63 ms 5924 KB Output is correct
26 Correct 69 ms 5924 KB Output is correct
27 Correct 66 ms 5924 KB Output is correct
28 Correct 63 ms 5924 KB Output is correct
29 Correct 69 ms 5924 KB Output is correct
30 Correct 39 ms 5924 KB Output is correct
31 Incorrect 0 ms 5924 KB Output isn't correct
32 Correct 0 ms 5924 KB Output is correct