답안 #1003732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003732 2024-06-20T16:29:52 Z MarwenElarbi Gap (APIO16_gap) C++17
64.6316 / 100
36 ms 1240 KB
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=2e3+5;
void MinMax(long long, long long, long long*, long long*);
long long findGap(int T, int N)
{
    if(T==1){
      long long lst,mx;
      MinMax(0,1e18,&lst,&mx);
      if(N==2) return mx-lst;
      //else if(N<=N){
      long long ans=0;
      int j=N-1;
      int i=2;
      while(i<=j){
        long long a,b;
        MinMax(lst+1,mx-1,&a,&b);
        ans=max(ans,max(a-lst,mx-b));
        lst=a;
        mx=b;
        i++;j--;
      }
      return max(ans,mx-lst);
    }else{
    long long lst,mx;
    MinMax(0,1e18,&lst,&mx);
    if(N<=2) return mx-lst;
    long long ans=1;
    while(mx!=lst){
        long long a,b;
        MinMax(lst+1,lst+ans,&a,&b);
        if(a==-1){
            while(a==-1){
                ans*=2;
                MinMax(lst+1,lst+ans,&a,&b);
            }
            ans=a-lst;
            lst=b;
        }else{
            lst=b;
        }
    }
    return ans;
    }   
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 8 ms 600 KB Output is correct
18 Correct 6 ms 548 KB Output is correct
19 Correct 8 ms 600 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 30 ms 1100 KB Output is correct
22 Correct 25 ms 1112 KB Output is correct
23 Correct 34 ms 1112 KB Output is correct
24 Correct 25 ms 1112 KB Output is correct
25 Correct 30 ms 1112 KB Output is correct
26 Correct 25 ms 1112 KB Output is correct
27 Correct 25 ms 1112 KB Output is correct
28 Correct 28 ms 1240 KB Output is correct
29 Correct 25 ms 1112 KB Output is correct
30 Correct 21 ms 1116 KB Output is correct
31 Correct 0 ms 352 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Partially correct 1 ms 344 KB Partially correct
16 Correct 5 ms 600 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 4 ms 440 KB Output is correct
19 Correct 4 ms 604 KB Output is correct
20 Correct 4 ms 600 KB Output is correct
21 Correct 16 ms 1104 KB Output is correct
22 Correct 16 ms 1112 KB Output is correct
23 Correct 17 ms 1116 KB Output is correct
24 Correct 16 ms 1112 KB Output is correct
25 Partially correct 36 ms 1212 KB Partially correct
26 Correct 25 ms 1112 KB Output is correct
27 Correct 17 ms 1112 KB Output is correct
28 Correct 16 ms 1116 KB Output is correct
29 Correct 16 ms 1112 KB Output is correct
30 Correct 15 ms 1112 KB Output is correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct