| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 32209 |
2017-10-03T14:32:00 Z |
dongwon0427 |
Gap (APIO16_gap) |
C++ |
|
106 ms |
8304 KB |
#include "gap.h"
#define MAX 1000000000000000000
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findGap(int T, int N)
{
if(T==1) {
ll a=0,b=MAX,c,d;
vector<ll> v;
for(int i=1;i<=(N+1)/2;i++) {
if(a>b) break;
MinMax(a,b,&c,&d);
if(c>=0)v.push_back(c);
if(d>=0)v.push_back(d);
a=c+1; b=d-1;
if(c==d && c>=0) v.pop_back();
}
sort(v.begin(),v.end());
//for(int i=0;i<v.size();i++) cout<<v[i]<<' ';
ll _max = 0ll;
for(int i=0;i<v.size()-1;i++) {
_max = max(_max , v[i+1]-v[i]);
}
return _max;
} else {
ll s,e;
MinMax(0,MAX,&s,&e);
ll minin = (e-s-1ll) / (ll)(N-1) + 1ll;
ll a=s, b=s+minin;
vector<ll> v;
while(1) {
int flag=0;
if(b>=e) {
flag=1;
b=e;
}
ll t1,t2;
MinMax(a,b,&t1,&t2);
if(t1!=-1) {
v.push_back(t1);
v.push_back(t2);
}
if(flag==1) break;
a = b+1;
b = a+minin;
}
//for(int i=0;i<v.size();i++) cout<<v[i]<<' ';
ll _max=0;
for(int i=0;i<v.size()-1;i++) {
_max = max(_max , v[i+1]-v[i]);
}
return _max;
}
return 0;
}
Compilation message
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:22:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v.size()-1;i++) {
^
gap.cpp:50:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v.size()-1;i++) {
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
16 ms |
5616 KB |
Output is correct |
| 17 |
Correct |
19 ms |
5616 KB |
Output is correct |
| 18 |
Correct |
16 ms |
5616 KB |
Output is correct |
| 19 |
Correct |
13 ms |
5616 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5616 KB |
Output is correct |
| 21 |
Correct |
66 ms |
6768 KB |
Output is correct |
| 22 |
Correct |
69 ms |
6768 KB |
Output is correct |
| 23 |
Correct |
59 ms |
6768 KB |
Output is correct |
| 24 |
Correct |
69 ms |
6768 KB |
Output is correct |
| 25 |
Correct |
63 ms |
6768 KB |
Output is correct |
| 26 |
Correct |
63 ms |
6768 KB |
Output is correct |
| 27 |
Correct |
49 ms |
6768 KB |
Output is correct |
| 28 |
Correct |
63 ms |
6768 KB |
Output is correct |
| 29 |
Correct |
59 ms |
6768 KB |
Output is correct |
| 30 |
Correct |
46 ms |
6768 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5288 KB |
Output is correct |
| 16 |
Correct |
19 ms |
5616 KB |
Output is correct |
| 17 |
Correct |
16 ms |
5616 KB |
Output is correct |
| 18 |
Correct |
19 ms |
5616 KB |
Output is correct |
| 19 |
Correct |
23 ms |
5616 KB |
Output is correct |
| 20 |
Correct |
6 ms |
5144 KB |
Output is correct |
| 21 |
Correct |
63 ms |
6768 KB |
Output is correct |
| 22 |
Correct |
83 ms |
6768 KB |
Output is correct |
| 23 |
Correct |
73 ms |
6768 KB |
Output is correct |
| 24 |
Correct |
73 ms |
6768 KB |
Output is correct |
| 25 |
Correct |
73 ms |
8304 KB |
Output is correct |
| 26 |
Correct |
83 ms |
6768 KB |
Output is correct |
| 27 |
Correct |
86 ms |
6768 KB |
Output is correct |
| 28 |
Correct |
106 ms |
6768 KB |
Output is correct |
| 29 |
Correct |
73 ms |
6768 KB |
Output is correct |
| 30 |
Correct |
39 ms |
5616 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
