제출 #419412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
419412		amunduzbaev	구경하기 (JOI13_watching)	C++14	0 / 100	4 ms	604 KiB

watching

/* made by amunduzbaev */
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
template<class T> using oset = tree<T, 
null_type, less_equal<T>, rb_tree_tag, 
tree_order_statistics_node_update>;
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int par[N], sz[N], lv[N], rv[N], l[N], r[N], used[N];
set<tut<3>> ss;

int f(int x){ return (par[x] == x ? x : par[x] = f(par[x])); }
void merge(int a, int b){
	a = f(a), b = f(b);
	if(a == b) return;
	if(sz[b] > sz[a]) swap(a, b);
	//~ par[b] = a, umin(l[a], l[b]), umax(r[a], r[b]);
	//~ umin(lv[a], lv[b]), umax(rv[a], rv[b]);
	int ok = 0;
	int pp = a;
	if(b > a) swap(a, b), ok = 1;
	if(lv[b] > 0){
		int c = lv[b] - 1;
		ss.erase({r[b] - l[f(c)] + 1, f(c), b});
		ss.insert({r[a] - l[f(c)] + 1, f(c), pp});
	} if(lv[a] < n-1) {
		int c = rv[a] + 1;
		ss.erase({r[f(c)] - l[a] + 1, a, f(c)});
		ss.insert({r[f(c)] - l[b] + 1, pp, f(c)});
	} if(ok) swap(a, b);
	
	par[b] = a, umin(l[a], l[b]), umax(r[a], r[b]);
	umin(lv[a], lv[b]), umax(rv[a], rv[b]);
	sz[a] += sz[b];
}

void solve(int t_case){
	cin>>n>>m>>q;
	for(int i=0;i<n;i++) cin>>a[i];
	sort(a, a+n);
	
	for(int i=0;i<n;i++) par[i] = i, l[i] = r[i] = a[i], sz[i] = 1, lv[i] = rv[i] = i;
	for(int i=1;i<n;i++) ss.insert({a[i] - a[i-1] + 1, i - 1, i});
	
	
	for(int i=0;i<n - (m + q);i++){
		int a = (*ss.begin())[1], b = (*ss.begin())[2]; ss.erase(ss.begin());
		merge(a, b);
	}
	
	vii tmp;
	for(int i=0;i<n;i++){
		int x = f(i);
		if(used[x]) continue; 
		//~ cout<<l[x]<<" "<<r[x]<<"\n";
		used[x] = 1;
		tmp.pb(r[x] - l[x] + 1);
	}
	
	sort(all(tmp));
	for(int i=sz(tmp)-1;i>=max(0ll, sz(tmp)-q);i--) tmp[i] = (tmp[i] + 1) / 2;
	for(auto x : tmp) umax(res, x);
	cout<<res<<"\n";
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

watching.cpp: In function 'void usaco(std::string)':
watching.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
watching.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 50
• Subtask 2: 0 / 50