Submission #1114994


Source Code Expand

#include<cstdio>
#include<algorithm>
#define MN 110001
#define ll long long
using namespace std;

ll read_p,read_ca;
inline ll read(){
	read_p=0;read_ca=getchar();
	while (read_ca<'0'||read_ca>'9') read_ca=getchar();
	while (read_ca>='0'&&read_ca<='9') read_p=read_p*10+read_ca-48,read_ca=getchar();
	return read_p;
}
ll n,m,x;
int main(){
	n=read();m=read();
	if (m>n*2) x=(m-n*2)/4,n+=x,m-=2*x;
	m/=2;
	printf("%lld\n",n>m?m:n);
}

Submission Info

Submission Time
Task C - Scc Puzzle
User swm_sxt
Language C++14 (GCC 5.4.1)
Score 300
Code Size 451 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 9
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 128 KB
00_example_02.txt AC 1 ms 128 KB
01.txt AC 1 ms 128 KB
02.txt AC 0 ms 128 KB
03.txt AC 0 ms 128 KB
04.txt AC 0 ms 128 KB
05.txt AC 1 ms 128 KB
06.txt AC 0 ms 128 KB
07.txt AC 0 ms 128 KB