oj.uz

Submission #671246

# Submission time Handle Problem Language Result Execution time Memory
671246 2022-12-12T14:02:16 Z 4EVER Cipele (COCI18_cipele) C++11
90 / 90
 42 ms 2908 KB 
/******************************
*    author : @hihihihi       *
*    date : 12 / 12 / 2022    *
******************************/

#include <bits/stdc++.h>
// #pragma GCC optimize("O2")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize ("O3,unroll-loops,no-stack-protector")
// #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

// template
#define PB push_back
#define ALL(i_) i_.begin(), i_.end()
#define LOG2(x_) (31 - __builtin_clz(x_))
#define getBit(x_, i_) ((x_ >> i_) & (ll) 1)
#define rd(l_, r_) (l_ + rng() % (r_ - l_ + 1))
#define FOR(i_, a_, b_)  for(int i_ = (int) (a_); i_ <= (int) (b_); ++i_)
#define FORD(i_, a_, b_) for(int i_ = (int) (a_); i_ >= (int) (b_); --i_)
// debugger 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef DEBUG
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
typedef long long ll;
typedef long double ld;

template<class X, class Y> bool minimize(X &x, const Y &y){
    X eps = 1e-9;
    if (x > y + eps) {
        x = y;
        return 1;
    }
    return 0;
}

template<class X, class Y> bool maximize(X &x, const Y &y) {
    X eps = 1e-9;
    if (x + eps < y) {
        x = y;
        return 1;
    }
    return 0;
}

template<class T> T Abs(const T &x) { return (x < 0 ? -x : x); }
template<class T> using heap_min = priority_queue<T, vector<T>, greater<T>>;
template<class T> using heap_max = priority_queue<T>;

const int mod = (int) 1e9 + 7;

template<class X, class Y> void Add(X &x, const Y &y){
    x += y;
    if(x >= mod) x -= mod;
    if(x < 0) x += mod;
}

const int oo = (int) 1e9 + 99;
const array<int, 2> dxy8[] = { {-1, 0}, {1, 0}, {0, 1}, {0, -1}, {1, -1}, {1, 1}, {-1, 1}, {-1, -1} };
const array<int, 2> dxy4[] = { {-1, 0}, {1, 0}, {0, 1}, {0, -1} };

const int maxn = (int) 1e5 + 11;
const int LOG = (int) LOG2(maxn) + 3;

void File(){
    #define TASK "CIPELE"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
}

int n, m;
int a[maxn], b[maxn];

void ReadInput(){
    cin >> n >> m;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, m) cin >> b[i];
}

bool Check(int lim){
	int cnt = 0;
	int j = 1;
	FOR(i, 1, n){
		while(j <= m && (a[i] >= b[j]) && (a[i] - b[j] > lim)) ++j;
		if(j <= m && Abs(a[i] - b[j]) <= lim){
			++cnt;
			++j;
		}
	}
	return (cnt == min(n, m));
}

void Solve(){
	sort(a + 1, a + n + 1);
	sort(b + 1, b + m + 1);
    int l = 0, r = (int) 1e9, res;
    while(r - l >= 0){
    	int mid = (l + r) >> 1;
    	if(Check(mid)){
    		res = mid;
    		r = mid - 1;
    	}
    	else l = mid + 1;
    }
    cout << res;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    File();
    ReadInput();
    Solve();
    cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    return 0;
}

Compilation message

cipele.cpp: In function 'void File()':
cipele.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cipele.cpp:94:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cipele.cpp: In function 'void Solve()':
cipele.cpp:132:13: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
  132 |     cout << res;
      |             ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2636 KB Output is correct
2 Correct 42 ms 2908 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2764 KB Output is correct
2 Correct 40 ms 2892 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 472 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 476 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2308 KB Output is correct
2 Correct 24 ms 1788 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2604 KB Output is correct
2 Correct 27 ms 2040 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2360 KB Output is correct
2 Correct 33 ms 2440 KB Output is correct