oj.uz

답안 #105760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105760 2019-04-14T09:49:33 Z Pro_ktmr Gap (APIO16_gap) C++14
47.4817 / 100
 147 ms 4948 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<pair<LL, LL>,int>> kukan;
		for(LL i=0; i<=1000000000000000000LL; i+=B){
			kukan.push(MP(MP(i,i+B-1),sqrt(N)));
		}
		vector<LL> v;
		while(kukan.size() > 0){
			LL m = kukan.front().first.first;
			LL M = kukan.front().first.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 = (double)(tmp2 - tmp1) / 3.5 + 1;
			//B = kukan.front().second;
			for(LL i=tmp1+1; i<=tmp2-1; i+=B){
				kukan.push(MP(MP(i, min(i+B-1,tmp2-1)),sqrt(kukan.front().second)));
			}
		}
		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:63:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1; i<v.size(); i++){
                ~^~~~~~~~~
gap.cpp:68: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 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 0 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 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 16 ms 960 KB Output is correct
17 Correct 15 ms 896 KB Output is correct
18 Correct 16 ms 896 KB Output is correct
19 Correct 15 ms 1024 KB Output is correct
20 Correct 13 ms 1024 KB Output is correct
21 Correct 58 ms 2400 KB Output is correct
22 Correct 55 ms 2288 KB Output is correct
23 Correct 63 ms 2256 KB Output is correct
24 Correct 57 ms 2304 KB Output is correct
25 Correct 52 ms 2328 KB Output is correct
26 Correct 60 ms 2240 KB Output is correct
27 Correct 63 ms 2292 KB Output is correct
28 Correct 59 ms 2416 KB Output is correct
29 Correct 60 ms 2288 KB Output is correct
30 Correct 47 ms 2288 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #2
17.4816878145 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 356 KB Output is 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 384 KB Partially correct
10 Partially correct 2 ms 384 KB Partially correct
11 Partially correct 3 ms 384 KB Partially correct
12 Partially correct 5 ms 384 KB Partially correct
13 Partially correct 3 ms 384 KB Partially correct
14 Partially correct 4 ms 384 KB Partially correct
15 Partially correct 3 ms 384 KB Partially correct
16 Partially correct 39 ms 1592 KB Partially correct
17 Partially correct 29 ms 1592 KB Partially correct
18 Partially correct 27 ms 1596 KB Partially correct
19 Partially correct 30 ms 1656 KB Partially correct
20 Partially correct 26 ms 1368 KB Partially correct
21 Partially correct 123 ms 4848 KB Partially correct
22 Partially correct 124 ms 4820 KB Partially correct
23 Partially correct 118 ms 4848 KB Partially correct
24 Partially correct 126 ms 4848 KB Partially correct
25 Partially correct 105 ms 4108 KB Partially correct
26 Partially correct 142 ms 4804 KB Partially correct
27 Partially correct 147 ms 4848 KB Partially correct
28 Partially correct 121 ms 4848 KB Partially correct
29 Partially correct 122 ms 4948 KB Partially correct
30 Partially correct 73 ms 3832 KB Partially correct
31 Partially correct 2 ms 384 KB Partially correct
32 Partially correct 2 ms 384 KB Partially correct