oj.uz

답안 #47957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47957 2018-05-09T08:32:56 Z khohko Gap (APIO16_gap) C++17
100 / 100
 80 ms 3552 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){
            if(l>r)break;
            MinMax(l,r,&k,&p);
            if(k<0)break;
            v.pb(k);
            v.pb(p);
            l=k+1ll;
            r=p-1ll;
            n-=2ll;
        }

        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:71:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1; i<v.size(); i++)
                      ~^~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 2 ms 624 KB Output is correct
11 Correct 2 ms 624 KB Output is correct
12 Correct 2 ms 624 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 2 ms 624 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 16 ms 1148 KB Output is correct
17 Correct 16 ms 1148 KB Output is correct
18 Correct 16 ms 1148 KB Output is correct
19 Correct 16 ms 1148 KB Output is correct
20 Correct 12 ms 1148 KB Output is correct
21 Correct 60 ms 2552 KB Output is correct
22 Correct 59 ms 2552 KB Output is correct
23 Correct 59 ms 2552 KB Output is correct
24 Correct 68 ms 2552 KB Output is correct
25 Correct 52 ms 2552 KB Output is correct
26 Correct 59 ms 2552 KB Output is correct
27 Correct 61 ms 2604 KB Output is correct
28 Correct 59 ms 2604 KB Output is correct
29 Correct 59 ms 2604 KB Output is correct
30 Correct 45 ms 2604 KB Output is correct
31 Correct 2 ms 2604 KB Output is correct
32 Correct 2 ms 2604 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2604 KB Output is correct
2 Correct 2 ms 2604 KB Output is correct
3 Correct 2 ms 2604 KB Output is correct
4 Correct 2 ms 2604 KB Output is correct
5 Correct 2 ms 2604 KB Output is correct
6 Correct 2 ms 2604 KB Output is correct
7 Correct 3 ms 2604 KB Output is correct
8 Correct 2 ms 2604 KB Output is correct
9 Correct 2 ms 2604 KB Output is correct
10 Correct 2 ms 2604 KB Output is correct
11 Correct 3 ms 2604 KB Output is correct
12 Correct 3 ms 2604 KB Output is correct
13 Correct 3 ms 2604 KB Output is correct
14 Correct 3 ms 2604 KB Output is correct
15 Correct 3 ms 2604 KB Output is correct
16 Correct 20 ms 2604 KB Output is correct
17 Correct 20 ms 2604 KB Output is correct
18 Correct 21 ms 2604 KB Output is correct
19 Correct 20 ms 2604 KB Output is correct
20 Correct 10 ms 2604 KB Output is correct
21 Correct 80 ms 2604 KB Output is correct
22 Correct 76 ms 2604 KB Output is correct
23 Correct 78 ms 2604 KB Output is correct
24 Correct 79 ms 2604 KB Output is correct
25 Correct 80 ms 3552 KB Output is correct
26 Correct 77 ms 3552 KB Output is correct
27 Correct 80 ms 3552 KB Output is correct
28 Correct 79 ms 3552 KB Output is correct
29 Correct 78 ms 3552 KB Output is correct
30 Correct 49 ms 3552 KB Output is correct
31 Correct 2 ms 3552 KB Output is correct
32 Correct 2 ms 3552 KB Output is correct