Submission #1368482

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

ll N, M;
int main() {
	cin >> N >> M;
	ll x = max((M - 2*N)/4, 0ll);
	N += x; M -= 2 * x;
	printf("%lld\n", min(M/2, N));
	return 0;
}

Submission Info

Judge Result