Submission #1381018
Source Code Expand
import java.util.Scanner; public class Main { private static Scanner scan = new Scanner(System.in); public static void main(String[] args) { int N = Integer.parseInt(scan.next()); int M = Integer.parseInt(scan.next()); int count = 0; if(2*N >= M) count = M / 2; else { count += N; int 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 | 0 |
Code Size | 433 Byte |
Status | RE |
Exec Time | 95 ms |
Memory | 21844 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
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 | 90 ms | 21460 KB |
00_example_02.txt | AC | 89 ms | 20564 KB |
01.txt | RE | 95 ms | 19924 KB |
02.txt | RE | 90 ms | 21844 KB |
03.txt | RE | 92 ms | 21588 KB |
04.txt | AC | 90 ms | 20948 KB |
05.txt | AC | 90 ms | 21716 KB |
06.txt | AC | 90 ms | 20564 KB |
07.txt | AC | 90 ms | 20564 KB |