답안 #569666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569666 2022-05-27T15:26:29 Z ali22413836 Gap (APIO16_gap) C++14
30 / 100
2000 ms 8140 KB
#include "gap.h"
#include <bits/stdc++.h>
#define  endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
    if(y == 0) return 1 ;
    if(y == 1) return x ;
    ll ret = mypower(x , y / 2);
    ret = (ret * ret) % mod;
    if(y % 2) ret = ( ret * x ) % mod ;
    return ret ;
}
map < ll , ll > mp ;
vector < ll > v  ;
long long findGap(int T, int N)
{
    ll n = N ; 
    ll mn = -1 , mx = 1e18 ;
    if(T == 1){
        ll l = -1 , r = 1e18 + 1 ;
        while(v.size() != N){
            MinMax(l , r , &mn , &mx) ;
            if(mn == -1 && mx == -1){
                break ;
            }
            if(mp.count(mn) == 0){
                mp[mn] = 1 ;
                v.push_back(mn) ;
                l = mn + 1 ;
            }
            if(mp.count(mx) == 0){
                mp[mx] = 1 ;
                v.push_back(mx) ;
                r = mx - 1;
            }
        }
        sort(v.begin() , v.end()) ;
        ll ans = 0 ;
        for(int i = 1 ; i < N ; i++){
            ans = max(ans , v[i] - v[i - 1]) ;
        }
        return ans ;
    }
    else{
        MinMax(mn , mx , &mn , &mx) ;
        ll len = (mx - mn + 1) / (n - 1) ;
        ll q = mn ;
        ll ans = 0 ;
        for(int i = mn ; i < mx ; i+= len){
            MinMax(i , i + len , &mn , &mx) ;
            if(mn != -1){
                ans = max(ans , mn - q) ;
                q = mx ;
            }
        }
        return ans ;
    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:26:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         while(v.size() != N){
      |               ~~~~~~~~~^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 18 ms 2204 KB Output is correct
17 Correct 19 ms 2264 KB Output is correct
18 Correct 21 ms 2168 KB Output is correct
19 Correct 18 ms 2216 KB Output is correct
20 Correct 18 ms 2252 KB Output is correct
21 Correct 79 ms 8044 KB Output is correct
22 Correct 76 ms 8036 KB Output is correct
23 Correct 75 ms 8140 KB Output is correct
24 Correct 86 ms 8036 KB Output is correct
25 Correct 69 ms 8124 KB Output is correct
26 Correct 74 ms 8128 KB Output is correct
27 Correct 77 ms 8124 KB Output is correct
28 Correct 77 ms 8124 KB Output is correct
29 Correct 83 ms 8084 KB Output is correct
30 Correct 68 ms 8108 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3073 ms 208 KB Time limit exceeded
2 Incorrect 0 ms 208 KB Output isn't correct
3 Incorrect 0 ms 208 KB Output isn't correct
4 Execution timed out 3068 ms 208 KB Time limit exceeded
5 Incorrect 0 ms 208 KB Output isn't correct
6 Execution timed out 3073 ms 208 KB Time limit exceeded
7 Execution timed out 3075 ms 208 KB Time limit exceeded
8 Incorrect 0 ms 208 KB Output isn't correct
9 Execution timed out 3054 ms 208 KB Time limit exceeded
10 Incorrect 1 ms 208 KB Output isn't correct
11 Incorrect 1 ms 208 KB Output isn't correct
12 Execution timed out 3067 ms 208 KB Time limit exceeded
13 Execution timed out 3071 ms 208 KB Time limit exceeded
14 Execution timed out 3052 ms 208 KB Time limit exceeded
15 Incorrect 0 ms 208 KB Output isn't correct
16 Incorrect 5 ms 464 KB Output isn't correct
17 Incorrect 5 ms 464 KB Output isn't correct
18 Incorrect 5 ms 460 KB Output isn't correct
19 Incorrect 4 ms 428 KB Output isn't correct
20 Incorrect 3 ms 464 KB Output isn't correct
21 Execution timed out 3061 ms 980 KB Time limit exceeded
22 Incorrect 18 ms 976 KB Output isn't correct
23 Incorrect 18 ms 960 KB Output isn't correct
24 Execution timed out 3054 ms 968 KB Time limit exceeded
25 Incorrect 14 ms 992 KB Output isn't correct
26 Execution timed out 3045 ms 1060 KB Time limit exceeded
27 Execution timed out 3056 ms 968 KB Time limit exceeded
28 Execution timed out 3053 ms 996 KB Time limit exceeded
29 Incorrect 20 ms 1072 KB Output isn't correct
30 Incorrect 11 ms 996 KB Output isn't correct
31 Execution timed out 3083 ms 208 KB Time limit exceeded
32 Incorrect 0 ms 208 KB Output isn't correct