Submission #6518595

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep for(int i = 0;i<n;i++)
#define ll long long
 
//const int INF = 1e8;
const int MOD = 1000000007;
typedef pair<int,int>P;
int dx[4] = {1,0,-1,0};int dy[4] = {0,1,0,-1};
queue<P> que;
 
int main(){
    ll n,m;cin >> n >> m;
    //Sがn個、cがm個
    if(n>=m/2){
        cout << m/2 << endl;
    }else{
        //使えるcの数
        ll a = m - 2*n;
        cout << n +  a/4 << endl;
    }
}

Submission Info

Judge Result