답안 #61233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61233 2018-07-25T11:53:11 Z istlemin Gap (APIO16_gap) C++14
100 / 100
79 ms 3080 KB
#include "gap.h"
#include<bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for(int i = a; i<int(b);++i)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define trav(a,c) for(auto a: c)

typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;

void ask(ll l,ll r, ll *mn,ll *mx){
    ll ansMn,ansMx;
    MinMax(l,r-1,&ansMn,&ansMx);
    (*mn) = ansMn;
	(*mx) = ansMx;
}

long long findGap(int T, int N) {
    ll t = T;
    ll n = N;

    if(t==1){
        vi a;
        ll l = -1;
        ll r = 2e18;
        while(true){
            ll mn,mx;
            if(a.size()==n) break;
            ask(l,r,&mn,&mx);
            l = mn+1;
            r = mx;
			a.push_back(mn);
			if(mn==mx) break;
			a.push_back(mx);
        }
        sort(all(a));
        ll mxGap = 0;
        rep(i,0,n-1) mxGap = max(mxGap,a[i+1]-a[i]);
        return mxGap;
    } else {
        ll dn,up;
        ask(-1,2e18,&dn,&up);
        vi a;
		a.push_back(dn);
		a.push_back(up);
        ++dn;


        vi endPoints;
        endPoints.push_back(dn);

        ll numGroups = n/2+1;

        rep(i,0,numGroups){
            if(i<(up-dn)%numGroups)
				endPoints.push_back(endPoints[endPoints.size()-1]+(up-dn)/numGroups+1);
			else
				endPoints.push_back(endPoints[endPoints.size()-1]+(up-dn)/numGroups);
        }

        rep(i,0,numGroups){
            ll l = endPoints[i];
            ll r = endPoints[i+1];
            ll mn,mx;
            ask(l,r,&mn,&mx);
            if(mn==-1) continue;
            a.push_back(mn);
            a.push_back(mx);
        }

        sort(all(a));
        ll mxGap = 0;
        rep(i,0,a.size()-1) mxGap = max(mxGap,a[i+1]-a[i]);
        //cout<<"yes"<<endl;
        return mxGap;

    }

	return 0;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:32:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(a.size()==n) break;
                ~~~~~~~~^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 660 KB Output is correct
8 Correct 3 ms 660 KB Output is correct
9 Correct 2 ms 668 KB Output is correct
10 Correct 2 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 4 ms 668 KB Output is correct
13 Correct 4 ms 668 KB Output is correct
14 Correct 4 ms 668 KB Output is correct
15 Correct 4 ms 668 KB Output is correct
16 Correct 25 ms 1212 KB Output is correct
17 Correct 18 ms 1212 KB Output is correct
18 Correct 23 ms 1224 KB Output is correct
19 Correct 19 ms 1224 KB Output is correct
20 Correct 17 ms 1224 KB Output is correct
21 Correct 76 ms 2496 KB Output is correct
22 Correct 79 ms 2532 KB Output is correct
23 Correct 70 ms 2532 KB Output is correct
24 Correct 66 ms 2532 KB Output is correct
25 Correct 62 ms 2536 KB Output is correct
26 Correct 68 ms 2536 KB Output is correct
27 Correct 69 ms 2536 KB Output is correct
28 Correct 66 ms 2536 KB Output is correct
29 Correct 66 ms 2536 KB Output is correct
30 Correct 69 ms 2536 KB Output is correct
31 Correct 2 ms 2536 KB Output is correct
32 Correct 3 ms 2536 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2536 KB Output is correct
2 Correct 2 ms 2536 KB Output is correct
3 Correct 2 ms 2536 KB Output is correct
4 Correct 2 ms 2536 KB Output is correct
5 Correct 2 ms 2536 KB Output is correct
6 Correct 2 ms 2536 KB Output is correct
7 Correct 3 ms 2536 KB Output is correct
8 Correct 3 ms 2536 KB Output is correct
9 Correct 2 ms 2536 KB Output is correct
10 Correct 3 ms 2536 KB Output is correct
11 Correct 4 ms 2536 KB Output is correct
12 Correct 3 ms 2536 KB Output is correct
13 Correct 5 ms 2536 KB Output is correct
14 Correct 4 ms 2536 KB Output is correct
15 Correct 3 ms 2536 KB Output is correct
16 Correct 20 ms 2536 KB Output is correct
17 Correct 20 ms 2536 KB Output is correct
18 Correct 21 ms 2536 KB Output is correct
19 Correct 18 ms 2536 KB Output is correct
20 Correct 9 ms 2536 KB Output is correct
21 Correct 68 ms 2912 KB Output is correct
22 Correct 73 ms 2940 KB Output is correct
23 Correct 65 ms 2972 KB Output is correct
24 Correct 64 ms 2972 KB Output is correct
25 Correct 63 ms 2972 KB Output is correct
26 Correct 69 ms 2972 KB Output is correct
27 Correct 72 ms 2972 KB Output is correct
28 Correct 75 ms 2972 KB Output is correct
29 Correct 67 ms 3080 KB Output is correct
30 Correct 46 ms 3080 KB Output is correct
31 Correct 3 ms 3080 KB Output is correct
32 Correct 2 ms 3080 KB Output is correct