Submission #2696133


Source Code Expand

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {

    static int N;
    static int A;
    static int B;
    static int C;
    static int D;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        N = sc.nextInt();
        A = sc.nextInt();
        B = sc.nextInt();
        C = sc.nextInt();
        D = sc.nextInt();

        System.out.println( solve() ? "Yes" : "No" );
    }

    static boolean solve() {
        // GはgoalのG
        int G = Math.abs(A-B);
        int times = N - 1;

        // C*q D*q G という状態まで詰める
        int q = G / D;
        int r = G % D;
        times -= q;

        // 回数切れで届かない
        if( times <= 0 ) return false;

        if( times % 2 == 0 ) {
            // +D -Cとすることで D-Cずつ距離を詰めることができる
            return r <= (times / 2) * (D-C);

        } else {
            int C1 = C * (q+1);
            int D1 = D * (q+1);
            times -= 1;

            // C1 <= B <= D1 の場合はそれで終了
            if( C1 <= G && G <= D1 ) return true;

            // G D1 C1 という状態なので D1からGに向かって詰めることができたらOK
            int r1 = D1 - G;
            return r1 <= (times /2) * (D-C);
        }
    }

    static class FastScanner {

        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

        String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }

            return tokenizer.nextToken("\n");
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }
    }
}

Submission Info

Submission Time
Task B - Moderate Differences
User kusomushi
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 3169 Byte
Status WA
Exec Time 71 ms
Memory 23252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
WA × 4
WA × 38
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt, sample4.txt
All sample1.txt, sample2.txt, sample3.txt, sample4.txt, a01.txt, a02.txt, a03.txt, a04.txt, b01.txt, b02.txt, b03.txt, b04.txt, c01.txt, c02.txt, c03.txt, c04.txt, d01.txt, d02.txt, d03.txt, d04.txt, d05.txt, d06.txt, d07.txt, d08.txt, d09.txt, d10.txt, d11.txt, d12.txt, d13.txt, d14.txt, d15.txt, d16.txt, d17.txt, d18.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt
Case Name Status Exec Time Memory
a01.txt WA 70 ms 17876 KB
a02.txt WA 69 ms 17748 KB
a03.txt WA 69 ms 19156 KB
a04.txt WA 69 ms 17876 KB
b01.txt WA 70 ms 18772 KB
b02.txt WA 69 ms 18644 KB
b03.txt WA 68 ms 17620 KB
b04.txt WA 67 ms 19284 KB
c01.txt WA 70 ms 20436 KB
c02.txt WA 68 ms 21204 KB
c03.txt WA 70 ms 18772 KB
c04.txt WA 71 ms 19156 KB
d01.txt WA 70 ms 21204 KB
d02.txt WA 70 ms 18900 KB
d03.txt WA 70 ms 23252 KB
d04.txt WA 71 ms 21204 KB
d05.txt WA 69 ms 19156 KB
d06.txt WA 70 ms 20052 KB
d07.txt WA 69 ms 19028 KB
d08.txt WA 69 ms 18900 KB
d09.txt WA 69 ms 19156 KB
d10.txt WA 69 ms 19412 KB
d11.txt WA 69 ms 20308 KB
d12.txt WA 67 ms 19796 KB
d13.txt WA 68 ms 17748 KB
d14.txt WA 70 ms 19028 KB
d15.txt WA 69 ms 21076 KB
d16.txt WA 70 ms 18900 KB
d17.txt WA 67 ms 19284 KB
d18.txt WA 70 ms 18772 KB
sample1.txt WA 69 ms 21076 KB
sample2.txt WA 68 ms 19284 KB
sample3.txt WA 68 ms 21204 KB
sample4.txt WA 69 ms 19284 KB