답안 #61140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61140 2018-07-25T08:43:51 Z istlemin Gap (APIO16_gap) C++14
100 / 100
101 ms 4316 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);
        up++;

        vi a;

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

        rep(i,0,(n-1)){
            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 3 ms 356 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 704 KB Output is correct
11 Correct 4 ms 704 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 4 ms 704 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 704 KB Output is correct
16 Correct 26 ms 1212 KB Output is correct
17 Correct 19 ms 1212 KB Output is correct
18 Correct 19 ms 1212 KB Output is correct
19 Correct 24 ms 1212 KB Output is correct
20 Correct 19 ms 1212 KB Output is correct
21 Correct 83 ms 2492 KB Output is correct
22 Correct 79 ms 2552 KB Output is correct
23 Correct 71 ms 2552 KB Output is correct
24 Correct 98 ms 2552 KB Output is correct
25 Correct 72 ms 2664 KB Output is correct
26 Correct 68 ms 2664 KB Output is correct
27 Correct 69 ms 2664 KB Output is correct
28 Correct 69 ms 2664 KB Output is correct
29 Correct 82 ms 2664 KB Output is correct
30 Correct 53 ms 2664 KB Output is correct
31 Correct 2 ms 2664 KB Output is correct
32 Correct 3 ms 2664 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2664 KB Output is correct
2 Correct 3 ms 2664 KB Output is correct
3 Correct 3 ms 2664 KB Output is correct
4 Correct 3 ms 2664 KB Output is correct
5 Correct 3 ms 2664 KB Output is correct
6 Correct 3 ms 2664 KB Output is correct
7 Correct 2 ms 2664 KB Output is correct
8 Correct 3 ms 2664 KB Output is correct
9 Correct 3 ms 2664 KB Output is correct
10 Correct 3 ms 2664 KB Output is correct
11 Correct 4 ms 2664 KB Output is correct
12 Correct 4 ms 2664 KB Output is correct
13 Correct 3 ms 2664 KB Output is correct
14 Correct 4 ms 2664 KB Output is correct
15 Correct 4 ms 2664 KB Output is correct
16 Correct 26 ms 2664 KB Output is correct
17 Correct 27 ms 2664 KB Output is correct
18 Correct 26 ms 2664 KB Output is correct
19 Correct 24 ms 2664 KB Output is correct
20 Correct 12 ms 2664 KB Output is correct
21 Correct 94 ms 3724 KB Output is correct
22 Correct 89 ms 3808 KB Output is correct
23 Correct 91 ms 3808 KB Output is correct
24 Correct 94 ms 3808 KB Output is correct
25 Correct 91 ms 4316 KB Output is correct
26 Correct 96 ms 4316 KB Output is correct
27 Correct 101 ms 4316 KB Output is correct
28 Correct 92 ms 4316 KB Output is correct
29 Correct 91 ms 4316 KB Output is correct
30 Correct 65 ms 4316 KB Output is correct
31 Correct 3 ms 4316 KB Output is correct
32 Correct 4 ms 4316 KB Output is correct