oj.uz

Submission #316567

# Submission time Handle Problem Language Result Execution time Memory
316567 2020-10-26T16:47:53 Z ronnith Cipele (COCI18_cipele) C++14
63 / 90
 1000 ms 6908 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define bin1(a) __builtin_popcount(a)
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define de cerr
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (((a)/(__gcd(a,b))) * b)
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define v vector
#define p pair
#define pii p<int,int>
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
typedef double d;
using namespace std;
using namespace __gnu_pbds;
ll modF=1e9+7;
ll inf = 2e9 + 1;

/*OUTPUT

*/

void solve(){
	int n,m;
	cin >> n >> m;
	if(n == m){
		vi a(n);
		rep(i,0,n){
			cin >> a[i];
		}
		vi b(m);
		rep(i,0,m){
			cin >> b[i];
		}
		sort(all(a));
		sort(all(b));
		int ans = 0;
		for(int i = 0;i < min(n,m);i ++){
			maxs(ans,abs(b[i] - a[i]));
		}
		cout << ans << ln;
		return;
	}
	v<vi> a(2,vi(max(n,m)));
	for(int i = 0;i < n;i ++){
		cin >> a[0][i];
	}
	for(int i = 0;i < m;i ++){
		cin >> a[1][i];
	}
	sort(a[0].begin(),a[0].begin() + n);
	sort(a[1].begin(),a[1].begin() + m);	
	int c = 0;
	int d = 1;
	if(m < n){
		swap(c,d);
		swap(n,m);
	}
	vi dp(m);
	v<vi> pre(m,vi(2));
	int crr = 0;
	int prev = 1;
	for(int i = 0;i < n;i ++){
		
		for(int j = 0;j < m;j ++){
			if(i == 0){
				dp[j] = abs(a[c][i] - a[d][j]);
			}
			else{
				dp[j] = abs(a[c][i] - a[d][j]);
				if(j != 0){
					maxs(dp[j],pre[j - 1][prev]);
				}
				else{
					dp[j] = inf; 
				}
				//
				// dp[i][j] = max(a[i] - b[j], min(dp[i - 1][j - 1],dp[i - 1][j - 2]....));
				//
			}
			pre[j][crr] = dp[j];
			if(j != 0){
				mins(pre[j][crr],pre[j - 1][crr]);
			}
			// debug(dp[i][j]);
		}
		// de << ln;
		crr = 1 - crr;
		prev = 1 - prev;
	}
	int ans;
	for(int j = 0;j < m;j ++){
		if(j == 0){
			ans = dp[j];
		}
		else{
			mins(ans,dp[j]);
		}
	}
	cout << ans << ln;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	// cin >> t;
	while(t --){
		solve();
	}
}

Compilation message

cipele.cpp: In function 'void solve()':
cipele.cpp:28:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   28 | #define ln "\n"
      |            ^~~~
cipele.cpp:108:6: note: 'ans' was declared here
  108 |  int ans;
      |      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1280 KB Output is correct
2 Correct 42 ms 1408 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1280 KB Output is correct
2 Correct 40 ms 1408 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 512 KB Output is correct
2 Correct 93 ms 768 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 93 ms 812 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 768 KB Output is correct
2 Correct 95 ms 768 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 768 KB Output is correct
2 Correct 96 ms 768 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 768 KB Output is correct
2 Correct 99 ms 812 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 6908 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 6668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 6544 KB Time limit exceeded
2 Halted 0 ms 0 KB -