{"problem":{"name":"Scc Puzzle","description":{"content":"Snuke loves puzzles. Today, he is working on a puzzle using `S`\\- and `c`\\-shaped pieces. In this puzzle, you can combine two `c`\\-shaped pieces into one `S`\\-shaped piece, as shown in the figure belo","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc069_a"},"statements":[{"statement_type":"Markdown","content":"Snuke loves puzzles.\nToday, he is working on a puzzle using `S`\\- and `c`\\-shaped pieces. In this puzzle, you can combine two `c`\\-shaped pieces into one `S`\\-shaped piece, as shown in the figure below:\n\n![image](https://atcoder.jp/img/arc069/9b0bd546db9f28b4093d417b8f274124.png)\n\nSnuke decided to create as many `Scc` groups as possible by putting together one `S`\\-shaped piece and two `c`\\-shaped pieces.\nFind the maximum number of `Scc` groups that can be created when Snuke has $N$ `S`\\-shaped pieces and $M$ `c`\\-shaped pieces.\n\n## Constraints\n\n*   $1 ≤ N,M ≤ 10^{12}$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc069_a","tags":[],"sample_group":[["1 6","2\n\nTwo `Scc` groups can be created as follows:\n\n*   Combine two `c`\\-shaped pieces into one `S`\\-shaped piece\n*   Create two `Scc` groups, each from one `S`\\-shaped piece and two `c`\\-shaped pieces"],["12345 678901","175897"]],"created_at":"2026-03-03 11:01:14"}}