Submission #108458

# Submission time Handle Problem Language Result Execution time Memory
108458 2019-04-30T00:22:15 Z nxteru Gap (APIO16_gap) C++14
0 / 100
66 ms 2768 KB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;
#define PB push_back
ll ans,mn,mx,n;
long long findGap(int t, int N)
{
	n=N;
	if(t==1){
		ll l=-1,r=1e18+1;
		vector<ll>x,y;
		while(x.size()+y.size()<n){
			l++,r--;
			MinMax(l,r,&l,&r);
			x.PB(l);
			y.PB(r);
		}
		for(int i=y.size()-1;i>=0;i--)x.PB(y[i]);
		for(int i=0;i+1<x.size();i++)ans=max(ans,x[i+1]-x[i]);
		return ans;
	}
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:13:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(x.size()+y.size()<n){
         ~~~~~~~~~~~~~~~~~^~
gap.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i+1<x.size();i++)ans=max(ans,x[i+1]-x[i]);
               ~~~^~~~~~~~~
gap.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 14 ms 1024 KB Output is correct
17 Correct 14 ms 1068 KB Output is correct
18 Correct 19 ms 1060 KB Output is correct
19 Correct 15 ms 1024 KB Output is correct
20 Correct 13 ms 1024 KB Output is correct
21 Correct 56 ms 2672 KB Output is correct
22 Correct 56 ms 2708 KB Output is correct
23 Correct 53 ms 2768 KB Output is correct
24 Correct 50 ms 2716 KB Output is correct
25 Correct 55 ms 2716 KB Output is correct
26 Correct 60 ms 2724 KB Output is correct
27 Correct 66 ms 2684 KB Output is correct
28 Correct 59 ms 2696 KB Output is correct
29 Correct 53 ms 2716 KB Output is correct
30 Correct 38 ms 2716 KB Output is correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 Incorrect 3 ms 384 KB Output isn't correct
13 Incorrect 2 ms 384 KB Output isn't correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 Incorrect 8 ms 512 KB Output isn't correct
17 Incorrect 9 ms 512 KB Output isn't correct
18 Incorrect 9 ms 512 KB Output isn't correct
19 Incorrect 7 ms 512 KB Output isn't correct
20 Incorrect 6 ms 512 KB Output isn't correct
21 Incorrect 28 ms 1152 KB Output isn't correct
22 Incorrect 31 ms 1116 KB Output isn't correct
23 Incorrect 27 ms 1152 KB Output isn't correct
24 Incorrect 27 ms 1144 KB Output isn't correct
25 Incorrect 17 ms 1152 KB Output isn't correct
26 Incorrect 38 ms 1060 KB Output isn't correct
27 Incorrect 24 ms 1152 KB Output isn't correct
28 Incorrect 24 ms 1144 KB Output isn't correct
29 Incorrect 31 ms 1040 KB Output isn't correct
30 Incorrect 13 ms 1124 KB Output isn't correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 2 ms 588 KB Output isn't correct