oj.uz

답안 #107419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107419 2019-04-24T07:20:47 Z yamamayumi9489 Gap (APIO16_gap) C++14
100 / 100
 85 ms 4076 KB 
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<functional>
 
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999
#define INTBIG 1111111111
#define MOD 1000000007
#define PI pair<int,int>
#define VI vector<int>
#define VL vector<LL>
#define VVI vector<vector<int>>
 
#include"gap.h"
//MinMax(int,int,int&,int&)
 
long long findGap(int T, int N) {
	if (T == 1) {
		LL A[100002];
		LL l = 0, r = 1000000000000000000LL;
		for (int i = 0; i<(N + 1) / 2; i++) {
			MinMax(l, r, &A[i], &A[N - 1 - i]);
			l = A[i] + 1; r = A[N - 1 - i] - 1;
		}
 
		LL ans = 0;
		for (int i = 0; i<N - 1; i++)
			ans = max(ans, A[i + 1] - A[i]);
		return ans;
	}
	else if (T == 2) {
		VL A; LL mn, mx;
		MinMax(0, 1000000000000000000LL, &mn, &mx);
		LL l = mn + 1;
		LL r = mn + ((mx - mn + N - 1) / N);
		r = min(r,mx-1);
		for (LL i = 0; i < N; i++) {
			LL a, b;
			MinMax(l, r, &a, &b);
			if (a != -1) {
				A.push_back(a);	A.push_back(b);
			}
			if(r == mx-1) break;
			l += ((mx - mn + N - 1) / N);
			r += ((mx - mn + N - 1) / N);
			r = min(r,mx-1);
		}
		A.push_back(mn);
		A.push_back(mx);
		sort(A.begin(), A.end());
		LL ans = 0;
		for (int i = 1; i < (int)A.size(); i++)
			ans = max(ans, A[i] - A[i - 1]);
		return ans;
	}
	else return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 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 2 ms 356 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 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 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 17 ms 1016 KB Output is correct
17 Correct 18 ms 1024 KB Output is correct
18 Correct 20 ms 1024 KB Output is correct
19 Correct 17 ms 1024 KB Output is correct
20 Correct 12 ms 768 KB Output is correct
21 Correct 53 ms 3064 KB Output is correct
22 Correct 58 ms 3080 KB Output is correct
23 Correct 58 ms 3192 KB Output is correct
24 Correct 52 ms 3064 KB Output is correct
25 Correct 48 ms 2680 KB Output is correct
26 Correct 68 ms 3064 KB Output is correct
27 Correct 61 ms 3136 KB Output is correct
28 Correct 57 ms 3064 KB Output is correct
29 Correct 57 ms 3064 KB Output is correct
30 Correct 41 ms 2424 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 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 2 ms 384 KB Output is correct
9 Correct 3 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 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 21 ms 1280 KB Output is correct
17 Correct 22 ms 1408 KB Output is correct
18 Correct 22 ms 1280 KB Output is correct
19 Correct 21 ms 1272 KB Output is correct
20 Correct 10 ms 512 KB Output is correct
21 Correct 75 ms 3440 KB Output is correct
22 Correct 81 ms 3364 KB Output is correct
23 Correct 83 ms 3408 KB Output is correct
24 Correct 72 ms 3440 KB Output is correct
25 Correct 80 ms 4076 KB Output is correct
26 Correct 85 ms 3536 KB Output is correct
27 Correct 74 ms 3616 KB Output is correct
28 Correct 81 ms 3604 KB Output is correct
29 Correct 73 ms 3440 KB Output is correct
30 Correct 42 ms 2040 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct