Submission #623691

# Submission time Handle Problem Language Result Execution time Memory
623691 2022-08-06T09:34:59 Z sword060 Gap (APIO16_gap) C++17
39.2789 / 100
71 ms 2312 KB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int q,int x){
  if(q==2){
    long long l=0,r=1e18,ans=0;
   MinMax(l,r,&l,&r);
    if(x==2)return r-l;
    long long xd=l,dist=0,lol=(r-l+x-2)/(x-1);
    while(xd<r){
     long long c1,c2;
     MinMax(xd+1,xd+1+lol,&c1,&c2);
      if(c1==-1){
        dist+=lol+1;
        xd+=lol+1;
      }else{
         ans=max(ans,dist+c1-xd);
         dist=0;
         xd=c1;
       }
    }
    return ans;
  }else{
    vector<long long>a;
    long long c=0,v=1e18,zz=x;
    while(zz&&c<=v){
      long long l,r;
     MinMax(c,v,&l,&r);
      if(l==-1)break;
      a.push_back(l);if(l!=r)a.push_back(r);
      c=l+1;v=r-1;zz-=2;
    }
    sort(a.begin(),a.end());
   long long ret=0;
    for(int i=0;i<(int)a.size()-1;i++)ret=max(ret,a[i+1]-a[i]);
    return ret;
  }
  return 0;
}
# 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 1 ms 208 KB Output is correct
7 Correct 1 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 9 ms 848 KB Output is correct
17 Correct 12 ms 848 KB Output is correct
18 Correct 11 ms 848 KB Output is correct
19 Correct 10 ms 848 KB Output is correct
20 Correct 8 ms 848 KB Output is correct
21 Correct 38 ms 2200 KB Output is correct
22 Correct 39 ms 2200 KB Output is correct
23 Correct 39 ms 2204 KB Output is correct
24 Correct 44 ms 2192 KB Output is correct
25 Correct 35 ms 2240 KB Output is correct
26 Correct 38 ms 2196 KB Output is correct
27 Correct 37 ms 2216 KB Output is correct
28 Correct 37 ms 2204 KB Output is correct
29 Correct 45 ms 2312 KB Output is correct
30 Correct 31 ms 2180 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 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 0 ms 208 KB Partially correct
4 Partially correct 0 ms 208 KB Partially correct
5 Correct 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Partially correct
7 Partially correct 0 ms 208 KB Partially correct
8 Partially correct 0 ms 208 KB Partially correct
9 Partially correct 0 ms 208 KB Partially correct
10 Partially correct 1 ms 208 KB Partially correct
11 Partially correct 1 ms 208 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 1 ms 336 KB Partially correct
15 Correct 1 ms 208 KB Output is correct
16 Partially correct 15 ms 568 KB Partially correct
17 Partially correct 15 ms 464 KB Partially correct
18 Partially correct 15 ms 512 KB Partially correct
19 Partially correct 14 ms 464 KB Partially correct
20 Partially correct 13 ms 464 KB Partially correct
21 Partially correct 61 ms 1016 KB Partially correct
22 Partially correct 60 ms 968 KB Partially correct
23 Partially correct 71 ms 1172 KB Partially correct
24 Partially correct 61 ms 1080 KB Partially correct
25 Correct 50 ms 1064 KB Output is correct
26 Partially correct 62 ms 1056 KB Partially correct
27 Partially correct 61 ms 1084 KB Partially correct
28 Partially correct 63 ms 1024 KB Partially correct
29 Partially correct 70 ms 1060 KB Partially correct
30 Partially correct 55 ms 1084 KB Partially correct
31 Partially correct 0 ms 208 KB Partially correct
32 Partially correct 0 ms 208 KB Partially correct