Submission #1381020


Source Code Expand

import java.util.Scanner;

public class Main {

    private static Scanner scan = new Scanner(System.in);

    public static void main(String[] args) {
	long N = Long.parseLong(scan.next());
	long M = Long.parseLong(scan.next());

	long count = 0;
	if(2*N >= M) count = M / 2;
	else {
	    count += N;
	    long rest = M - 2 * N;
	    count += rest / 4;
	}

	System.out.println(count);
	scan.close();
    }
}

Submission Info

Submission Time
Task C - Scc Puzzle
User tkyobc
Language Java8 (OpenJDK 1.8.0)
Score 300
Code Size 433 Byte
Status AC
Exec Time 91 ms
Memory 21844 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 89 ms 20560 KB
00_example_02.txt AC 89 ms 21716 KB
01.txt AC 89 ms 20564 KB
02.txt AC 89 ms 20692 KB
03.txt AC 89 ms 18516 KB
04.txt AC 89 ms 20556 KB
05.txt AC 89 ms 21716 KB
06.txt AC 90 ms 21844 KB
07.txt AC 91 ms 19024 KB