답안 #47953

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47953 2018-05-09T08:30:23 Z khohko Gap (APIO16_gap) C++17
70 / 100
81 ms 3564 KB
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "gap.h"

#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define lol long long
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define MAX ((lol)(1e15+100))
#define MX ((lol)(4e9+100))
#define ARRS ((lol)(1e6+100))
#define MOD ((lol)(1e9+7))
#define EP ((double)(1e-9))
#define EPS ((double)(1e-8))
#define pb push_back
#define PI ((double)3.141592653)
#define LG 21




long long findGap(int T, int n)
{
    if(T==2){
        vector<ll> v;
        ll k,p;
        MinMax(0,1e18,&k,&p);

        v.pb(k);
        v.pb(p);

        if(n>2){
            ll l=k+1,r=p-1;
            ll t=(r-l+n)/(n-1);
            t=max(t,1ll);
            for(ll i=l; i<=r; i+=t){
                MinMax(i,min(r,i+t-1),&k,&p);
                if(k<0)continue;
                v.pb(k);
                v.pb(p);
            }
        }

        sort(v.begin(),v.end());
        ll pas=0;
        for(int i=1; i<v.size(); i++)
            pas=max(pas,v[i]-v[i-1]);
        return pas;
    }
    else {
        vector<ll> v;
        ll k,p;
        ll l=0,r=1e18;
        while(n>=0&&l<=r){
            MinMax(l,r,&k,&p);
            if(k<0)break;
            v.pb(k);
            v.pb(p);
            l=k+1;
            r=p-1;
            n-=2;
        }

        sort(v.begin(),v.end());
        ll pas=0;
        for(int i=1; i<v.size(); i++)
            pas=max(pas,v[i]-v[i-1]);
        return pas;

    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:50:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<v.size(); i++)
                      ~^~~~~~~~~
gap.cpp:70:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<v.size(); i++)
                      ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Incorrect 2 ms 592 KB Output isn't correct
7 Incorrect 2 ms 592 KB Output isn't correct
8 Incorrect 2 ms 596 KB Output isn't correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 Correct 2 ms 724 KB Output is correct
11 Incorrect 3 ms 724 KB Output isn't correct
12 Incorrect 3 ms 724 KB Output isn't correct
13 Incorrect 3 ms 724 KB Output isn't correct
14 Incorrect 3 ms 724 KB Output isn't correct
15 Incorrect 2 ms 724 KB Output isn't correct
16 Incorrect 16 ms 1196 KB Output isn't correct
17 Incorrect 16 ms 1196 KB Output isn't correct
18 Incorrect 16 ms 1196 KB Output isn't correct
19 Incorrect 16 ms 1196 KB Output isn't correct
20 Correct 13 ms 1248 KB Output is correct
21 Incorrect 63 ms 2524 KB Output isn't correct
22 Incorrect 61 ms 2560 KB Output isn't correct
23 Incorrect 72 ms 2560 KB Output isn't correct
24 Incorrect 62 ms 2560 KB Output isn't correct
25 Incorrect 52 ms 2560 KB Output isn't correct
26 Incorrect 60 ms 2560 KB Output isn't correct
27 Incorrect 81 ms 2560 KB Output isn't correct
28 Incorrect 60 ms 2560 KB Output isn't correct
29 Incorrect 68 ms 2660 KB Output isn't correct
30 Correct 47 ms 2712 KB Output is correct
31 Correct 2 ms 2712 KB Output is correct
32 Correct 2 ms 2712 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2712 KB Output is correct
2 Correct 2 ms 2712 KB Output is correct
3 Correct 2 ms 2712 KB Output is correct
4 Correct 2 ms 2712 KB Output is correct
5 Correct 2 ms 2712 KB Output is correct
6 Correct 2 ms 2712 KB Output is correct
7 Correct 2 ms 2712 KB Output is correct
8 Correct 2 ms 2712 KB Output is correct
9 Correct 2 ms 2712 KB Output is correct
10 Correct 2 ms 2712 KB Output is correct
11 Correct 4 ms 2712 KB Output is correct
12 Correct 3 ms 2712 KB Output is correct
13 Correct 3 ms 2712 KB Output is correct
14 Correct 4 ms 2712 KB Output is correct
15 Correct 3 ms 2712 KB Output is correct
16 Correct 22 ms 2712 KB Output is correct
17 Correct 19 ms 2712 KB Output is correct
18 Correct 19 ms 2712 KB Output is correct
19 Correct 19 ms 2712 KB Output is correct
20 Correct 10 ms 2712 KB Output is correct
21 Correct 78 ms 2712 KB Output is correct
22 Correct 77 ms 2712 KB Output is correct
23 Correct 75 ms 2712 KB Output is correct
24 Correct 75 ms 2712 KB Output is correct
25 Correct 81 ms 3564 KB Output is correct
26 Correct 79 ms 3564 KB Output is correct
27 Correct 74 ms 3564 KB Output is correct
28 Correct 76 ms 3564 KB Output is correct
29 Correct 76 ms 3564 KB Output is correct
30 Correct 38 ms 3564 KB Output is correct
31 Correct 2 ms 3564 KB Output is correct
32 Correct 2 ms 3564 KB Output is correct