結果
問題 | No.274 The Wall |
ユーザー | tanzaku |
提出日時 | 2015-08-28 23:10:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 71 ms / 2,000 ms |
コード長 | 5,713 bytes |
コンパイル時間 | 2,917 ms |
コンパイル使用メモリ | 91,136 KB |
実行使用メモリ | 51,444 KB |
最終ジャッジ日時 | 2024-06-22 02:00:03 |
合計ジャッジ時間 | 4,654 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,668 KB |
testcase_01 | AC | 55 ms
50,440 KB |
testcase_02 | AC | 53 ms
50,812 KB |
testcase_03 | AC | 55 ms
50,816 KB |
testcase_04 | AC | 53 ms
50,836 KB |
testcase_05 | AC | 53 ms
50,900 KB |
testcase_06 | AC | 53 ms
50,680 KB |
testcase_07 | AC | 52 ms
50,476 KB |
testcase_08 | AC | 53 ms
50,644 KB |
testcase_09 | AC | 54 ms
50,688 KB |
testcase_10 | AC | 53 ms
50,640 KB |
testcase_11 | AC | 60 ms
50,816 KB |
testcase_12 | AC | 61 ms
51,040 KB |
testcase_13 | AC | 54 ms
50,668 KB |
testcase_14 | AC | 58 ms
50,704 KB |
testcase_15 | AC | 63 ms
51,444 KB |
testcase_16 | AC | 63 ms
51,088 KB |
testcase_17 | AC | 71 ms
51,352 KB |
testcase_18 | AC | 64 ms
51,308 KB |
testcase_19 | AC | 63 ms
51,044 KB |
testcase_20 | AC | 66 ms
50,952 KB |
testcase_21 | AC | 67 ms
50,948 KB |
testcase_22 | AC | 70 ms
51,244 KB |
testcase_23 | AC | 66 ms
51,260 KB |
testcase_24 | AC | 65 ms
51,292 KB |
testcase_25 | AC | 63 ms
50,908 KB |
ソースコード
import java.io.*; import java.math.*; import java.util.*; import static java.util.Arrays.*; public class Main { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { int n = io.nextInt(); int m = io.nextInt(); int[][] v = io.nextIntArray2D(n, 2); for(int [] x : v) { if(x[0] > m-1-x[1]) { x[0] = m-1-x[0]; x[1] = m-1-x[1]; swap(x, 0, 1); } } Arrays.sort(v, (a,b)->a[0]==b[0]?a[1]-b[1]:a[0]-b[0]); int l = 0, r = m-1; for(int[] x : v) { // System.err.println(x[0] + " " + x[1] + " " + l + " " + r); if(x[0] >= l && x[1] <= r) l = x[1]+1; else if(m-1-x[0] <= r && m-1-x[1] >= l) r = m-1-x[1]-1; else { io.out.println("NO"); return; } } io.out.println("YES"); } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new Main().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); } void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); } void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }