Submission #401439

# Submission time Handle Problem Language Result Execution time Memory
401439 2021-05-10T09:26:20 Z victoriad Gap (APIO16_gap) C++14
30 / 100
54 ms 1896 KB
#include "gap.h"
#include "vector"
#include <cmath>
using namespace std;
 long long findGap(int T, int N)

{ vector<long long>a(N);
long long  i=0;
long long int hi=1e18,low=0;
  while(i<=(N-1)/2){
  long long int s=low,t=hi;
   MinMax(low,hi,&s,&t);
  
    if(s==t){
      if(s<0)continue;
      a[i]=t;
      break;
    }
    else{
      a[i]=s;
      low=s+1;
      a[N-1-i]=t;
      hi=t-1;
    }
    i++;
  }
    long long int x=0;
	for(int k=0;k<N-1;k++){
		if(x<(a[k+1]-a[k]))x=a[k+1]-a[k];
	}
	return x;
}

  
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 11 ms 584 KB Output is correct
17 Correct 12 ms 664 KB Output is correct
18 Correct 11 ms 584 KB Output is correct
19 Correct 12 ms 692 KB Output is correct
20 Correct 9 ms 584 KB Output is correct
21 Correct 44 ms 1808 KB Output is correct
22 Correct 50 ms 1808 KB Output is correct
23 Correct 44 ms 1896 KB Output is correct
24 Correct 45 ms 1808 KB Output is correct
25 Correct 40 ms 1752 KB Output is correct
26 Correct 47 ms 1816 KB Output is correct
27 Correct 54 ms 1856 KB Output is correct
28 Correct 44 ms 1856 KB Output is correct
29 Correct 44 ms 1828 KB Output is correct
30 Correct 36 ms 1816 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Partially correct 1 ms 200 KB Partially correct
3 Partially correct 1 ms 200 KB Partially correct
4 Partially correct 1 ms 200 KB Partially correct
5 Partially correct 1 ms 200 KB Partially correct
6 Partially correct 1 ms 200 KB Partially correct
7 Partially correct 1 ms 200 KB Partially correct
8 Partially correct 1 ms 200 KB Partially correct
9 Partially correct 1 ms 200 KB Partially correct
10 Partially correct 1 ms 200 KB Partially correct
11 Partially correct 1 ms 200 KB Partially correct
12 Partially correct 1 ms 200 KB Partially correct
13 Partially correct 1 ms 200 KB Partially correct
14 Partially correct 1 ms 328 KB Partially correct
15 Partially correct 1 ms 328 KB Partially correct
16 Partially correct 12 ms 620 KB Partially correct
17 Partially correct 11 ms 584 KB Partially correct
18 Partially correct 11 ms 584 KB Partially correct
19 Partially correct 11 ms 608 KB Partially correct
20 Partially correct 9 ms 584 KB Partially correct
21 Incorrect 44 ms 1804 KB Expected int32, but "2500100000" found
22 Incorrect 45 ms 1816 KB Expected int32, but "2500100000" found
23 Incorrect 43 ms 1796 KB Expected int32, but "2500100000" found
24 Incorrect 44 ms 1808 KB Expected int32, but "2500100000" found
25 Incorrect 39 ms 1856 KB Expected int32, but "2500100000" found
26 Incorrect 44 ms 1856 KB Expected int32, but "2500100000" found
27 Incorrect 43 ms 1808 KB Expected int32, but "2500100000" found
28 Incorrect 46 ms 1856 KB Expected int32, but "2500100000" found
29 Incorrect 45 ms 1728 KB Expected int32, but "2500100000" found
30 Incorrect 35 ms 1792 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 200 KB Partially correct
32 Partially correct 1 ms 200 KB Partially correct