Submission #1115130
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner as = new Scanner(System.in); long n = as.nextLong(); long m = as.nextLong(); long l = 0; if(m>=2*n){ l+=n; m-=2*n; l+=m/4; }else{ l+=m/2; } System.out.println(l); } }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | amane_lyric |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 308 Byte |
Status | AC |
Exec Time | 109 ms |
Memory | 21844 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 109 ms | 21204 KB |
00_example_02.txt | AC | 91 ms | 18772 KB |
01.txt | AC | 91 ms | 19412 KB |
02.txt | AC | 91 ms | 19924 KB |
03.txt | AC | 92 ms | 18516 KB |
04.txt | AC | 91 ms | 21716 KB |
05.txt | AC | 90 ms | 19796 KB |
06.txt | AC | 91 ms | 21844 KB |
07.txt | AC | 90 ms | 21588 KB |