Submission #625153

# Submission time Handle Problem Language Result Execution time Memory
625153 2022-08-09T13:48:15 Z PoonYaPat Gap (APIO16_gap) C++14
0 / 100
61 ms 3260 KB
#include "gap.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

vector<pll> v;
vector<ll> k;
ll mx,mn,ans;

ll findGap(int T, int n) {
    if (T==1) {
        mn=0, mx=1e18;
        while (k.size()<n) {
            MinMax(mn+1,mx-1,&mn,&mx);
            if (mn==mx) k.push_back(mn);
            else {
                k.push_back(mn);
                k.push_back(mx);
            }
        }
        sort(k.begin(),k.end());
        for (int i=1; i<k.size(); ++i) ans=max(ans,k[i]-k[i-1]);
    } else {
        MinMax(0,1e18,&mn,&mx);
        ll mmin=mn,mmax=mx;
        v.push_back(pll(mn,mn));

        ll wide=(mx-mn+n-3)/n;
        for (int i=0; i<n-1; ++i) {
            MinMax(mmin+1+wide*i,min(mmin+wide*(i+1),mmax-1),&mn,&mx);
            if (mn!=-1) v.push_back(pll(mn,mx));
        }
        v.push_back(pll(mmax,mmax));

        for (int i=1; i<v.size(); ++i) ans=max(ans,v[i].first-v[i-1].second);
    }
    return ans;
}
/*
2 6
12 15 34 54 675 678
*/

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:15:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |         while (k.size()<n) {
      |                ~~~~~~~~^~
gap.cpp:24:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int i=1; i<k.size(); ++i) ans=max(ans,k[i]-k[i-1]);
      |                       ~^~~~~~~~~
gap.cpp:37:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for (int i=1; i<v.size(); ++i) ans=max(ans,v[i].first-v[i-1].second);
      |                       ~^~~~~~~~~
# Verdict Execution time Memory 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 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 1 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 11 ms 832 KB Output is correct
17 Correct 10 ms 856 KB Output is correct
18 Correct 13 ms 816 KB Output is correct
19 Correct 11 ms 864 KB Output is correct
20 Correct 9 ms 848 KB Output is correct
21 Correct 39 ms 2228 KB Output is correct
22 Correct 38 ms 2152 KB Output is correct
23 Correct 38 ms 2240 KB Output is correct
24 Correct 42 ms 2240 KB Output is correct
25 Correct 36 ms 2240 KB Output is correct
26 Correct 49 ms 2380 KB Output is correct
27 Correct 38 ms 2240 KB Output is correct
28 Correct 37 ms 2192 KB Output is correct
29 Correct 44 ms 2200 KB Output is correct
30 Correct 32 ms 2204 KB Output is correct
31 Runtime error 0 ms 208 KB Execution failed because the return code was nonzero
32 Runtime error 0 ms 208 KB Execution failed because the return code was nonzero
# Verdict Execution time Memory 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Incorrect 0 ms 208 KB Output isn't correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 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 12 ms 836 KB Output is correct
17 Correct 14 ms 848 KB Output is correct
18 Correct 11 ms 816 KB Output is correct
19 Correct 14 ms 872 KB Output is correct
20 Runtime error 6 ms 464 KB Execution failed because the return code was nonzero
21 Correct 54 ms 2188 KB Output is correct
22 Correct 52 ms 2196 KB Output is correct
23 Correct 48 ms 2200 KB Output is correct
24 Correct 47 ms 2192 KB Output is correct
25 Correct 52 ms 3260 KB Output is correct
26 Correct 61 ms 2200 KB Output is correct
27 Correct 49 ms 2160 KB Output is correct
28 Correct 50 ms 2196 KB Output is correct
29 Correct 56 ms 2204 KB Output is correct
30 Runtime error 29 ms 1460 KB Execution failed because the return code was nonzero
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct