| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 254530 |
2020-07-30T07:55:19 Z |
leaked |
Cipele (COCI18_cipele) |
C++14 |
|
593 ms |
5884 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=400000+2;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
cout<<"NE";
exit(0);
}
int n,m;
vector<int>a,b;
bool ok(int tm){
multiset<int>st2;
bool is=1;
st2.insert(all(b));
for(auto &z : a){
int f=z-tm,s=z+tm;
auto it1=st2.lower_bound(f),it2=st2.upper_bound(s);
if(it1!=st2.end()){
if(abs((*it1)-z)<=tm){ st2.erase(it1);continue;}
}
if(it2!=st2.begin()){
it2--;
if(abs((*it2)-z)<=tm){st2.erase(it2);continue;}
}
return 0;
}
return 1;
}
signed main()
{
fast_io;
cin>>n>>m;a.resize(n);b.resize(m);
for(auto &z : a)cin>>z;
for(auto &z : b)cin>>z;
sort(all(a));sort(all(b));
if(sz(a)>sz(b)) swap(a,b);
int l=0,r=1e9+1;
while(l!=r){
int tm=(l+r)>>1;
if(ok(tm)){
r=tm;
}else l=tm+1;
}
cout<<l;
return 0;
}
/*
5
z 3 x y 3
2 y 3 z 3
/
*/
Compilation message
cipele.cpp: In function 'bool ok(int)':
cipele.cpp:95:10: warning: unused variable 'is' [-Wunused-variable]
bool is=1;
^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
472 ms |
5880 KB |
Output is correct |
| 2 |
Correct |
543 ms |
5880 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
542 ms |
5880 KB |
Output is correct |
| 2 |
Correct |
540 ms |
5884 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
512 KB |
Output is correct |
| 2 |
Correct |
21 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
640 KB |
Output is correct |
| 2 |
Correct |
18 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
640 KB |
Output is correct |
| 2 |
Correct |
19 ms |
672 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
640 KB |
Output is correct |
| 2 |
Correct |
19 ms |
668 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
640 KB |
Output is correct |
| 2 |
Correct |
19 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
530 ms |
5496 KB |
Output is correct |
| 2 |
Correct |
302 ms |
3704 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
593 ms |
5496 KB |
Output is correct |
| 2 |
Correct |
367 ms |
4984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
473 ms |
5240 KB |
Output is correct |
| 2 |
Correct |
489 ms |
5112 KB |
Output is correct |
