Submission #1114449

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	ll lo = 0; ll hi = ll(1e13);
	ll n,m; cin>>n>>m;
	ll ans =0;
	while(lo<=hi)
	{
		ll mid = (lo+hi)>>1;
		ll tmp = m - 2LL*mid;
		if(tmp<0)
		{
			hi=mid-1;
			continue;
		}
		ll nn = n + tmp/2;
		if(nn>=mid)
		{
			ans=mid;
			lo=mid+1;
		}
		else hi=mid-1;
	}
	cout<<ans<<'\n';
}

Submission Info

Judge Result