# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
47934 |
2018-05-09T08:17:22 Z |
khohko |
Gap (APIO16_gap) |
C++17 |
|
93 ms |
3656 KB |
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "gap.h"
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define lol long long
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define MAX ((lol)(1e15+100))
#define MX ((lol)(4e9+100))
#define ARRS ((lol)(1e6+100))
#define MOD ((lol)(1e9+7))
#define EP ((double)(1e-9))
#define EPS ((double)(1e-8))
#define pb push_back
#define PI ((double)3.141592653)
#define LG 21
long long findGap(int T, int n)
{
vector<ll> v;
ll k,p;
MinMax(0,1e18,&k,&p);
v.pb(k);
v.pb(p);
ll l=k+1,r=p-1;
ll t=(r-l+2)/(n-1);
t=max(t,1ll);
for(ll i=l; i<=r; i+=t){
MinMax(i,min(r,i+t-1),&k,&p);
if(k<0)continue;
v.pb(k);
v.pb(p);
}
sort(v.begin(),v.end());
ll pas=0;
for(int i=1; i<v.size(); i++)
pas=max(pas,v[i]-v[i-1]);
return pas;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v.size(); i++)
~^~~~~~~~~
gap.cpp:47:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(int i=1; i<v.size(); i++)
^~~
gap.cpp:49:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
return pas;
^~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
472 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
472 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
592 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
592 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
592 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
592 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
592 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
592 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
11 |
Incorrect |
3 ms |
648 KB |
Output isn't correct |
12 |
Incorrect |
3 ms |
648 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
648 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
648 KB |
Output isn't correct |
15 |
Incorrect |
3 ms |
700 KB |
Output isn't correct |
16 |
Incorrect |
19 ms |
1108 KB |
Output isn't correct |
17 |
Incorrect |
23 ms |
1236 KB |
Output isn't correct |
18 |
Incorrect |
20 ms |
1236 KB |
Output isn't correct |
19 |
Incorrect |
19 ms |
1236 KB |
Output isn't correct |
20 |
Incorrect |
9 ms |
1236 KB |
Output isn't correct |
21 |
Incorrect |
75 ms |
2564 KB |
Output isn't correct |
22 |
Incorrect |
75 ms |
2564 KB |
Output isn't correct |
23 |
Incorrect |
78 ms |
2656 KB |
Output isn't correct |
24 |
Incorrect |
76 ms |
2656 KB |
Output isn't correct |
25 |
Incorrect |
71 ms |
3656 KB |
Output isn't correct |
26 |
Incorrect |
74 ms |
3656 KB |
Output isn't correct |
27 |
Incorrect |
75 ms |
3656 KB |
Output isn't correct |
28 |
Incorrect |
75 ms |
3656 KB |
Output isn't correct |
29 |
Incorrect |
75 ms |
3656 KB |
Output isn't correct |
30 |
Incorrect |
40 ms |
3656 KB |
Output isn't correct |
31 |
Incorrect |
2 ms |
3656 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
3656 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
3656 KB |
Output is correct |
2 |
Correct |
2 ms |
3656 KB |
Output is correct |
3 |
Correct |
2 ms |
3656 KB |
Output is correct |
4 |
Correct |
2 ms |
3656 KB |
Output is correct |
5 |
Correct |
2 ms |
3656 KB |
Output is correct |
6 |
Correct |
2 ms |
3656 KB |
Output is correct |
7 |
Correct |
2 ms |
3656 KB |
Output is correct |
8 |
Correct |
2 ms |
3656 KB |
Output is correct |
9 |
Correct |
2 ms |
3656 KB |
Output is correct |
10 |
Correct |
2 ms |
3656 KB |
Output is correct |
11 |
Correct |
3 ms |
3656 KB |
Output is correct |
12 |
Correct |
3 ms |
3656 KB |
Output is correct |
13 |
Correct |
4 ms |
3656 KB |
Output is correct |
14 |
Correct |
3 ms |
3656 KB |
Output is correct |
15 |
Correct |
3 ms |
3656 KB |
Output is correct |
16 |
Correct |
22 ms |
3656 KB |
Output is correct |
17 |
Correct |
28 ms |
3656 KB |
Output is correct |
18 |
Correct |
24 ms |
3656 KB |
Output is correct |
19 |
Correct |
22 ms |
3656 KB |
Output is correct |
20 |
Partially correct |
9 ms |
3656 KB |
Partially correct |
21 |
Correct |
76 ms |
3656 KB |
Output is correct |
22 |
Correct |
74 ms |
3656 KB |
Output is correct |
23 |
Correct |
75 ms |
3656 KB |
Output is correct |
24 |
Correct |
92 ms |
3656 KB |
Output is correct |
25 |
Correct |
93 ms |
3656 KB |
Output is correct |
26 |
Correct |
75 ms |
3656 KB |
Output is correct |
27 |
Correct |
74 ms |
3656 KB |
Output is correct |
28 |
Correct |
74 ms |
3656 KB |
Output is correct |
29 |
Correct |
75 ms |
3656 KB |
Output is correct |
30 |
Partially correct |
39 ms |
3656 KB |
Partially correct |
31 |
Correct |
2 ms |
3656 KB |
Output is correct |
32 |
Correct |
2 ms |
3656 KB |
Output is correct |