답안 #213639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213639 2020-03-26T09:59:50 Z KoalaMuch Gap (APIO16_gap) C++14
100 / 100
82 ms 3308 KB
#include "gap.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
long long a[100005];
vector< long long > v;
long long findGap(int T, int N)
{
    long long ans = 0;
    if(T==1)
    {
        long long l = -1,r = 4e18;
        for(int i=1;i<=(N+1)/2;i++)
        {
            long long mn,mx;
            MinMax(l+1,r-1,&mn,&mx);
            a[i] = l = mn;
            a[N-i+1] = r = mx;
        }
        for(int i=2;i<=N;i++)   ans = max(ans,a[i]-a[i-1]);
    }
    else
    {
        long long mn,mx,w1,w2,m;
        MinMax(0,4e18,&mn,&mx);
        if(N>2) w1 = (mx-mn-1)/(long long)(N-2)+1;
        if(N>2) w2 = (mx-mn-1)/(long long)(N-2);
        if(N>2) m = (mx-mn-1)%(N-2);
//        printf("%lld %lld %lld %lld %lld\n",w1,w2,m,mx,mn);
        v.push_back(mn),v.push_back(mx);
        long long last = mn;
        for(int i=1;i<=N-2;i++)
        {
           if(i<=m) MinMax(last+1,last+w1,&mn,&mx),last = last+w1;
           else     MinMax(last+1,last+w2,&mn,&mx),last = last+w2;
           if(mn!=-1)   v.push_back(mn),v.push_back(mx);
        }
        sort(v.begin(),v.end());
        for(int i=0;i<v.size()-1;i++)   ans = max(ans,v[i+1]-v[i]);
    }
	return ans;
}
/*
2 3
0 1 100000000000000000
2 4
2 3 6 8
3 4 5 6 7
2 5
1 2 3 4 22
1 19 20 21 22

2 3 4 5 6 7 8     9 10 11 12 13 14 15   16 17 18 19 20 21

25/6
*/

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:39:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<v.size()-1;i++)   ans = max(ans,v[i+1]-v[i]);
                     ~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 17 ms 768 KB Output is correct
17 Correct 17 ms 768 KB Output is correct
18 Correct 17 ms 768 KB Output is correct
19 Correct 17 ms 768 KB Output is correct
20 Correct 14 ms 768 KB Output is correct
21 Correct 56 ms 1912 KB Output is correct
22 Correct 55 ms 1912 KB Output is correct
23 Correct 56 ms 1912 KB Output is correct
24 Correct 57 ms 1912 KB Output is correct
25 Correct 47 ms 1912 KB Output is correct
26 Correct 65 ms 1912 KB Output is correct
27 Correct 54 ms 1912 KB Output is correct
28 Correct 56 ms 1912 KB Output is correct
29 Correct 54 ms 1912 KB Output is correct
30 Correct 41 ms 1912 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 21 ms 1024 KB Output is correct
17 Correct 21 ms 1024 KB Output is correct
18 Correct 21 ms 1024 KB Output is correct
19 Correct 21 ms 1024 KB Output is correct
20 Correct 12 ms 640 KB Output is correct
21 Correct 75 ms 2288 KB Output is correct
22 Correct 74 ms 2288 KB Output is correct
23 Correct 74 ms 2288 KB Output is correct
24 Correct 74 ms 2288 KB Output is correct
25 Correct 69 ms 3308 KB Output is correct
26 Correct 82 ms 2288 KB Output is correct
27 Correct 74 ms 2288 KB Output is correct
28 Correct 81 ms 2424 KB Output is correct
29 Correct 75 ms 2292 KB Output is correct
30 Correct 41 ms 1528 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct