Submission #16534383
Source Code Expand
Copy
import java.util.*; import java.io.*; import java.math.*; public class Main{ static void solve(){//Here is the main function myout("300 150"); myout("1 1 4"); for(int i = 3; i <= 150; i++){ myout("2 1 " + (i * 2 - 1) + " " + (i * 2)); } myout("0 100000"); } //Method addition frame start //Method addition frame end //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<String>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.add(read); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<Integer, String>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextStrArray(){return myconv(next(), 8);} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<Integer> nextIntArray(){ ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size()); for(int i = 0; i < input.size(); i++){ ret.add(Integer.parseInt(input.get(i))); } return ret; } static ArrayList<Long> nextLongArray(){ ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size()); for(int i = 0; i < input.size(); i++){ ret.add(Long.parseLong(input.get(i))); } return ret; } static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ }
Submission Info
Submission Time | |
---|---|
Task | B - Problem Setting B |
User | watarimaycry2 |
Language | Java (OpenJDK 11.0.6) |
Score | 0 |
Code Size | 3061 Byte |
Status | AC |
Exec Time | 126 ms |
Memory | 37028 KB |
Compile Error
Note: ./Main.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details.
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 01_pretest_00, 01_pretest_01, 01_pretest_02, 01_pretest_03, 01_pretest_04, 01_pretest_05, 01_pretest_06, 01_pretest_07, 01_pretest_08, 01_pretest_09, 01_pretest_10, 01_pretest_11, 01_pretest_12, 01_pretest_13, 01_pretest_14 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01_pretest_00 | AC | 125 ms | 36780 KB |
01_pretest_01 | AC | 126 ms | 37028 KB |
01_pretest_02 | AC | 126 ms | 36972 KB |
01_pretest_03 | AC | 121 ms | 36920 KB |
01_pretest_04 | AC | 124 ms | 36968 KB |
01_pretest_05 | AC | 120 ms | 36948 KB |
01_pretest_06 | AC | 121 ms | 36976 KB |
01_pretest_07 | AC | 122 ms | 36980 KB |
01_pretest_08 | AC | 126 ms | 36872 KB |
01_pretest_09 | AC | 126 ms | 36860 KB |
01_pretest_10 | AC | 125 ms | 36904 KB |
01_pretest_11 | AC | 121 ms | 36916 KB |
01_pretest_12 | AC | 126 ms | 36940 KB |
01_pretest_13 | AC | 121 ms | 36868 KB |
01_pretest_14 | AC | 123 ms | 36848 KB |