oj.uz

답안 #1073469

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073469 2024-08-24T15:09:36 Z Hugo1729 Gap (APIO16_gap) C++11
89.1236 / 100
 48 ms 4472 KB 
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;


ll solve1(int N){
	ll s=0,t=1e18,ml=0,mr;

	vector<ll> ans,sus2;
	
	for(int i=0;i<N;i+=2){
		MinMax(s,t,&ml,&mr);

		if(mr==-1)break;

		ans.push_back(ml);
		if(ml==mr)break;
		sus2.push_back(mr);

		s=ml+1;
		t=mr-1;
	}

	for(int j=sus2.size()-1;j>=0;j--){
		ans.push_back(sus2[j]);
	}

	ll out=0;

	for(int i=0;i<N;i++){
		out=max(out,ans[i+1]-ans[i]);
	}

	// for(int i : ans)cout << i << ' ';
	// cout << '\n';
	

	return out;
}

ll solve2(int N){
	ll ml,mr;

	int cnt=0;
	
	MinMax(0,1e18,&ml,&mr);
	if(ml!=-1){
		if(ml==mr)cnt++;
		else cnt+=2;
	}

	ll lo=ml,hi=mr;
	ll L=hi-lo;
	ll sus=(L+N-2)/(N-1);

	ll ans = sus;

	ll prev=lo;

	for(ll i=ml+1;i<hi;i+=sus){
		MinMax(i,min(i+sus,hi-1),&ml,&mr);
		if(ml!=-1){
		if(ml==mr)cnt++;
		else cnt+=2;
		}

		if(ml==-1)continue;

		ans=max(ans,ml-prev);

		prev=mr;
		
		if(cnt>=N)break;
	}

	return max(ans,hi-prev);
}

ll findGap(int T, int N){
	if(T==1)return solve1(N);
	else return solve2(N);
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 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 0 ms 2392 KB Output is correct
5 Correct 1 ms 2388 KB Output is correct
6 Correct 1 ms 2388 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2484 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2388 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 2388 KB Output is correct
16 Correct 10 ms 2904 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 6 ms 3036 KB Output is correct
19 Correct 10 ms 2904 KB Output is correct
20 Correct 8 ms 2904 KB Output is correct
21 Correct 38 ms 4364 KB Output is correct
22 Correct 27 ms 4212 KB Output is correct
23 Correct 26 ms 4472 KB Output is correct
24 Correct 34 ms 4288 KB Output is correct
25 Correct 29 ms 4212 KB Output is correct
26 Correct 25 ms 4220 KB Output is correct
27 Correct 39 ms 4292 KB Output is correct
28 Correct 32 ms 4336 KB Output is correct
29 Correct 39 ms 4220 KB Output is correct
30 Correct 22 ms 4460 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
59.1236356051 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 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 0 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 11 ms 2488 KB Output is correct
17 Correct 12 ms 2588 KB Output is correct
18 Correct 9 ms 2392 KB Output is correct
19 Correct 12 ms 2392 KB Output is correct
20 Partially correct 6 ms 2392 KB Partially correct
21 Correct 43 ms 2728 KB Output is correct
22 Correct 34 ms 2764 KB Output is correct
23 Correct 48 ms 2648 KB Output is correct
24 Correct 47 ms 2648 KB Output is correct
25 Correct 32 ms 2844 KB Output is correct
26 Correct 36 ms 2844 KB Output is correct
27 Correct 39 ms 2900 KB Output is correct
28 Correct 43 ms 2648 KB Output is correct
29 Correct 45 ms 2808 KB Output is correct
30 Partially correct 21 ms 2648 KB Partially correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct