oj.uz

답안 #105756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105756 2019-04-14T09:42:01 Z Pro_ktmr Gap (APIO16_gap) C++14
50.5042 / 100
 126 ms 4452 KB 
#include"bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define PB push_back
#define MP make_pair
#define MOD 1000000007

#include"gap.h"

//MinMax(LL s, LL t, LL& mn, LL& mx)
//aiのうちs以上の最小の数がmnに、aiのうちt以下の最大値がmxに格納される

//aiの差分のうち最大のものを返す
LL findGap(int T, int N){
	if(T == 1){
		LL m = 0LL;
		LL M = 1000000000000000000LL;
		vector<LL> v;
		for(int i=0; i<(N+1)/2; i++){
			LL tmp1, tmp2;
			MinMax(m, M, &tmp1, &tmp2);
			v.PB(tmp1);
			v.PB(tmp2);
			m = tmp1+1;
			M = tmp2-1;
		}
		sort(v.begin(), v.end());

		LL ans = 0;
		for(int i=1; i<v.size(); i++){
			ans = max(ans, v[i] - v[i-1]);
		}
		return ans;
	}
	if(T == 2){

		LL B = 1000000000000000001LL / N;
		queue<pair<LL, LL>> kukan;
		for(LL i=0; i<=1000000000000000000LL; i+=B){
			kukan.push(MP(i,i+B-1));
		}
		vector<LL> v;
		while(kukan.size() > 0){
			LL m = kukan.front().first;
			LL M = kukan.front().second;
			kukan.pop();
			LL tmp1, tmp2;
			MinMax(m, M, &tmp1, &tmp2);
			if(tmp1 == -1) continue;
			v.PB(tmp1);
			if(tmp1 == tmp2) continue;
			v.PB(tmp2);

			B = (tmp2 - tmp1) / 5 + 1;
			for(LL i=tmp1+1; i<=tmp2-1; i+=B){
				kukan.push(MP(i, min(i+B-1,tmp2-1)));
			}
		}
		sort(v.begin(), v.end());
		LL ans = 0;
		for(int i=1; i<v.size(); i++){
			ans = max(ans, v[i] - v[i-1]);
		}
		return ans;
	}
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1; i<v.size(); i++){
                ~^~~~~~~~~
gap.cpp:62:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1; i<v.size(); i++){
                ~^~~~~~~~~
gap.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 14 ms 896 KB Output is correct
17 Correct 13 ms 896 KB Output is correct
18 Correct 14 ms 896 KB Output is correct
19 Correct 19 ms 896 KB Output is correct
20 Correct 11 ms 1024 KB Output is correct
21 Correct 53 ms 2288 KB Output is correct
22 Correct 71 ms 2288 KB Output is correct
23 Correct 56 ms 2288 KB Output is correct
24 Correct 69 ms 2288 KB Output is correct
25 Correct 44 ms 2288 KB Output is correct
26 Correct 64 ms 2344 KB Output is correct
27 Correct 76 ms 2332 KB Output is correct
28 Correct 54 ms 2452 KB Output is correct
29 Correct 62 ms 2288 KB Output is correct
30 Correct 40 ms 2288 KB Output is correct
31 Correct 2 ms 304 KB Output is correct
32 Correct 0 ms 384 KB Output is correct

Subtask #2
20.5042230198 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Partially correct 2 ms 384 KB Partially correct
3 Partially correct 2 ms 384 KB Partially correct
4 Partially correct 2 ms 384 KB Partially correct
5 Partially correct 2 ms 384 KB Partially correct
6 Partially correct 2 ms 384 KB Partially correct
7 Partially correct 2 ms 384 KB Partially correct
8 Partially correct 2 ms 384 KB Partially correct
9 Partially correct 2 ms 276 KB Partially correct
10 Partially correct 2 ms 384 KB Partially correct
11 Partially correct 3 ms 384 KB Partially correct
12 Partially correct 0 ms 384 KB Partially correct
13 Partially correct 3 ms 384 KB Partially correct
14 Partially correct 3 ms 384 KB Partially correct
15 Partially correct 4 ms 464 KB Partially correct
16 Partially correct 29 ms 1408 KB Partially correct
17 Partially correct 27 ms 1408 KB Partially correct
18 Partially correct 33 ms 1408 KB Partially correct
19 Partially correct 34 ms 1488 KB Partially correct
20 Partially correct 21 ms 1220 KB Partially correct
21 Partially correct 113 ms 4380 KB Partially correct
22 Partially correct 111 ms 4360 KB Partially correct
23 Partially correct 112 ms 4308 KB Partially correct
24 Partially correct 126 ms 4336 KB Partially correct
25 Partially correct 86 ms 3372 KB Partially correct
26 Partially correct 122 ms 4452 KB Partially correct
27 Partially correct 116 ms 4332 KB Partially correct
28 Partially correct 115 ms 4336 KB Partially correct
29 Partially correct 121 ms 4336 KB Partially correct
30 Partially correct 75 ms 3416 KB Partially correct
31 Partially correct 2 ms 384 KB Partially correct
32 Partially correct 2 ms 384 KB Partially correct