Submission #625162

# Submission time Handle Problem Language Result Execution time Memory
625162 2022-08-09T14:04:22 Z PoonYaPat Gap (APIO16_gap) C++14
30 / 100
53 ms 3232 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) {
        ll l=0, r=1e18;
        while (k.size()<n) {
            MinMax(l,r,&mn,&mx);
            if (mn==mx) k.push_back(mn);
            else {
                k.push_back(mn);
                k.push_back(mx);
            }
            l=mn+1; r=mx-1;
        }
        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));
        if (n==2) return mx-mn;

        ll wide=(mx-mn+n-2)/(n-1)+1;
        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;
}

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:25:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int i=1; i<k.size(); ++i) ans=max(ans,k[i]-k[i-1]);
      |                       ~^~~~~~~~~
gap.cpp:39: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]
   39 |         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 1 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 13 ms 848 KB Output is correct
17 Correct 10 ms 848 KB Output is correct
18 Correct 10 ms 848 KB Output is correct
19 Correct 10 ms 988 KB Output is correct
20 Correct 8 ms 848 KB Output is correct
21 Correct 38 ms 2196 KB Output is correct
22 Correct 38 ms 2204 KB Output is correct
23 Correct 40 ms 2192 KB Output is correct
24 Correct 43 ms 2336 KB Output is correct
25 Correct 33 ms 2200 KB Output is correct
26 Correct 39 ms 2208 KB Output is correct
27 Correct 38 ms 2128 KB Output is correct
28 Correct 41 ms 2204 KB Output is correct
29 Correct 40 ms 2192 KB Output is correct
30 Correct 31 ms 2204 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
# 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 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 320 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 13 ms 812 KB Output is correct
17 Correct 12 ms 860 KB Output is correct
18 Correct 12 ms 812 KB Output is correct
19 Correct 13 ms 848 KB Output is correct
20 Runtime error 8 ms 440 KB Execution failed because the return code was nonzero
21 Correct 49 ms 2172 KB Output is correct
22 Correct 50 ms 2176 KB Output is correct
23 Correct 48 ms 2240 KB Output is correct
24 Correct 52 ms 2248 KB Output is correct
25 Correct 53 ms 3232 KB Output is correct
26 Correct 53 ms 2160 KB Output is correct
27 Correct 49 ms 2200 KB Output is correct
28 Correct 52 ms 2196 KB Output is correct
29 Correct 48 ms 2132 KB Output is correct
30 Runtime error 24 ms 1484 KB Execution failed because the return code was nonzero
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct