oj.uz

답안 #105876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105876 2019-04-15T12:37:05 Z Pro_ktmr Gap (APIO16_gap) C++14
30 / 100
 108 ms 5752 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) / 4 + 1;
			for(LL i=tmp1+1; i<=tmp2-1; i+=B){
				kukan.push(MP(i, min(i+B-1, tmp2-1)));
			}*/
			kukan.push(MP(tmp1+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: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 3 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 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 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 16 ms 1408 KB Output is correct
17 Correct 20 ms 1408 KB Output is correct
18 Correct 18 ms 1408 KB Output is correct
19 Correct 21 ms 1408 KB Output is correct
20 Correct 17 ms 1024 KB Output is correct
21 Correct 68 ms 4112 KB Output is correct
22 Correct 69 ms 3952 KB Output is correct
23 Correct 57 ms 4080 KB Output is correct
24 Correct 62 ms 4052 KB Output is correct
25 Correct 64 ms 3464 KB Output is correct
26 Correct 54 ms 4080 KB Output is correct
27 Correct 64 ms 4208 KB Output is correct
28 Correct 64 ms 3996 KB Output is correct
29 Correct 58 ms 4080 KB Output is correct
30 Correct 54 ms 2928 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 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 Partially correct 2 ms 384 KB Partially 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 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
11 Correct 4 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 Partially correct 3 ms 384 KB Partially correct
16 Correct 24 ms 1792 KB Output is correct
17 Correct 26 ms 1788 KB Output is correct
18 Correct 28 ms 1792 KB Output is correct
19 Correct 25 ms 1792 KB Output is correct
20 Runtime error 15 ms 1228 KB Execution failed because the return code was nonzero
21 Correct 93 ms 5724 KB Output is correct
22 Correct 108 ms 5752 KB Output is correct
23 Correct 90 ms 5676 KB Output is correct
24 Correct 103 ms 5720 KB Output is correct
25 Incorrect 91 ms 4396 KB Expected int32, but "2500200001" found
26 Correct 93 ms 5712 KB Output is correct
27 Correct 96 ms 5624 KB Output is correct
28 Correct 104 ms 5752 KB Output is correct
29 Correct 89 ms 5624 KB Output is correct
30 Runtime error 65 ms 4012 KB Execution failed because the return code was nonzero
31 Partially correct 2 ms 384 KB Partially correct
32 Partially correct 3 ms 384 KB Partially correct