oj.uz

Submission #931568

# Submission time Handle Problem Language Result Execution time Memory
931568 2024-02-22T04:53:17 Z Baizho Watching (JOI13_watching) C++14
0 / 100
 5 ms 9564 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e3)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
 
int n, p, q, a[N], dp[105][105][105], pos1[N], pos2[N];

bool check(int w) {
	dp[0][0][0] = 1;
	int p1 = 1, p2 = 1;
	for(int i = 1; i <= n; i ++) {
		while(p1 < i && a[p1] < a[i] - w + 1) p1 ++;
		while(p2 < i && a[p2] < a[i] - 2 * w + 1) p2 ++;
		pos1[i] = p1;
		pos2[i] = p2;
//		cout<<i<<" "<<p1<<" "<<p2<<"\n";
	}
	for(int i = 1; i <= n; i ++) {
		for(int kp = 0; kp <= p; kp ++) {
			for(int kq = 0; kq <= q; kq ++) {
				dp[i][kp][kq] = 0;
				if(kp - 1 >= 0) dp[i][kp][kq] |= dp[pos1[i] - 1][kp - 1][kq];
				if(kq - 1 >= 0) dp[i][kp][kq] |= dp[pos2[i] - 1][kp][kq - 1];
//				cout<<i<<" "<<kp<<" "<<kq<<" "<<dp[i][kp][kq]<<"\n";
			}
		}
	}
	for(int i = 0; i <= p; i ++) for(int j = 0; j <= q; j ++) if(dp[n][i][j]) return true;
	return false;
}

void Baizho() {
	cin>>n>>p>>q;
	for(int i = 1; i <= n; i ++) {
		cin>>a[i];
	}
	sort(a + 1, a + n + 1);
	
	int l = 1, r = 1e9;
//	int l = 3, r = 3;
	while(l <= r) {
		int mid = (l + r) / 2;
		if(check(mid)) r = mid - 1;
		else l = mid + 1;
	}
	cout<<r + 1<<"\n";
	
	
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

watching.cpp: In function 'void Freopen(std::string)':
watching.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
watching.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Runtime error 5 ms 9564 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 9052 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -