Submission #74633784


Source Code Expand

import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.PriorityQueue;

@SuppressWarnings("DuplicatedCode")
public class Main {
    static int MAX_STRING_LENGTH = (int) 1e6; // 字符串最大长度
    static int MAX_DIGIT_LENGTH = (int) 1e6; // 数位最大长度
    static int MOD7 = (int) 1e9 + 7, MOD8 = 80112002, MOD9 = 998244353, inf = Integer.MAX_VALUE;

    /***** 检查 T *****/
    static class Solution {

        void solve() {
            int n = io.nextInt(), t = io.nextInt(), f = io.nextInt();
            int[][] g = new int[n][];
            for (int i = 0; i < n; i++) {
                g[i] = io.nextIntArray(2);
            }
            Arrays.sort(g, (a, b) -> a[0] - b[0]);
            PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
            int ans = 0;
            int p = 0;
            long v = f;
            for (int i = 0; i <= n; i++) {
                int x = i < n ? g[i][0] : t;
                while (x - p > v && !pq.isEmpty()) {
                    v += pq.poll();
                    ans++;
                }
                if (x - p > v) {
                    io.println(-1);
                    return;
                }
                v -= x - p;
                p = x;
                if (i < n) pq.offer(g[i][1]);
            }
            io.println(ans);
        }


    }


    public static void main(String[] args) {
        io = new IO();
        int T = 1;
        // T = io.nextInt();
        for (; T > 0; T--) {
            new Solution().solve();
        }
        io.close();
    }

    static IO io;
    static class IO {
        BufferedInputStream bis = new BufferedInputStream(System.in);
        PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));

        int nextInt() {
            return (int) nextLong();
        }

        long nextLong() {
            try {
                long sign = 1, x = 0;
                int c = bis.read();
                while (c < '0' || c > '9') {
                    if (c == '-') sign = -1;
                    c = bis.read();
                }
                while (c >= '0' && c <= '9') {
                    x = x * 10 + (c - '0');
                    c = bis.read();
                }
                return sign * x;
            } catch (IOException e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                try {
                    int sign = 1, x = 0;
                    int c = bis.read();
                    while (c < '0' || c > '9') {
                        if (c == '-') sign = -1;
                        c = bis.read();
                    }
                    while (c >= '0' && c <= '9') {
                        x = x * 10 + (c - '0');
                        c = bis.read();
                    }
                    a[i] = sign * x;
                } catch (IOException e) {
                    throw new RuntimeException(e.getMessage());
                }
            }
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                try {
                    long sign = 1, x = 0;
                    int c = bis.read();
                    while (c < '0' || c > '9') {
                        if (c == '-') sign = -1;
                        c = bis.read();
                    }
                    while (c >= '0' && c <= '9') {
                        x = x * 10 + (c - '0');
                        c = bis.read();
                    }
                    a[i] = sign * x;
                } catch (IOException e) {
                    throw new RuntimeException(e.getMessage());
                }
            }
            return a;
        }

        int[] nextDigitArray(int n) {
            try {
                int[] a = new int[n];
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int i = 0;
                while (!ignore(x)) {
                    a[i++] = x - '0';
                    x = bis.read();
                }
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        private int[] DIGIT_ARRAY;

        int[] nextDigitArray() {
            try {
                if (DIGIT_ARRAY == null) {
                    DIGIT_ARRAY = new int[MAX_DIGIT_LENGTH];
                }
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int m = 0;
                while (!ignore(x)) {
                    DIGIT_ARRAY[m++] = x - '0';
                    x = bis.read();
                }
                int[] a = new int[m];
                System.arraycopy(DIGIT_ARRAY, 0, a, 0, m);
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        char nextChar() {
            try {
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                return (char) x;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) {
                try {
                    if (CHAR_ARRAY == null) {
                        CHAR_ARRAY = new char[MAX_STRING_LENGTH];
                    }
                    int x = bis.read();
                    while (ignore(x)) {
                        x = bis.read();
                    }
                    int m = 0;
                    while (x != ' ' && x != ',' && !ignore(x)) {
                        CHAR_ARRAY[m++] = (char) x;
                        x = bis.read();
                    }
                    a[i] = new String(CHAR_ARRAY, 0, m);
                } catch (IOException e) {
                    throw new RuntimeException(e.getMessage());
                }
            }
            return a;
        }

        private char[] CHAR_ARRAY;

        char[] nextCharArray(boolean line) {
            try {
                if (CHAR_ARRAY == null) {
                    CHAR_ARRAY = new char[MAX_STRING_LENGTH];
                }
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int m = 0;
                while (line ? (x == ' ' || x == ',' || !ignore(x)) : !ignore(x)) {
                    CHAR_ARRAY[m++] = (char) x;
                    x = bis.read();
                }
                char[] a = new char[m];
                System.arraycopy(CHAR_ARRAY, 0, a, 0, m);
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        char[] nextCharArray(int n) {
            try {
                char[] a = new char[n];
                int x = bis.read();
                while (ignore(x)) {
                    x = bis.read();
                }
                int i = 0;
                while (!ignore(x)) {
                    a[i++] = (char) x;
                    x = bis.read();
                }
                return a;
            } catch (Exception e) {
                throw new RuntimeException(e.getMessage());
            }
        }

        private boolean ignore(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        String nextString(boolean line) {
            return new String(nextCharArray(line));
        }

        String nextString() {
            return nextString(false);
        }

        boolean nextBoolean() {
            return "true".equalsIgnoreCase(nextString());
        }

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

        void println(Object obj) {
            print(obj);
            print("\n");
        }

        void println() {
            print('\n');
        }

        void print(Object obj) {
            pw.print(obj);
        }

        void printf(String format, Object... obj) {
            pw.printf(format, obj);
        }

        void close() {
            try {
                if (bis != null) bis.close();
                if (pw != null) {
                    pw.flush();
                    pw.close();
                }
                bis = null;
                pw = null;
            } catch (Exception ignore) {
            }
        }
    }
}

Submission Info

Submission Time
Task D - Crossing the Desert
User gaoyuliang
Language Java24 (OpenJDK 24.0.2)
Score 400
Code Size 9248 Byte
Status AC
Exec Time 358 ms
Memory 56200 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 87
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt, in77.txt, in78.txt, in79.txt, in80.txt, in81.txt, in82.txt
Case Name Status Exec Time Memory
in01.txt AC 52 ms 38468 KiB
in02.txt AC 47 ms 38608 KiB
in03.txt AC 46 ms 38636 KiB
in04.txt AC 45 ms 38396 KiB
in05.txt AC 46 ms 38436 KiB
in06.txt AC 47 ms 38640 KiB
in07.txt AC 48 ms 38428 KiB
in08.txt AC 47 ms 38700 KiB
in09.txt AC 48 ms 38728 KiB
in10.txt AC 358 ms 56200 KiB
in11.txt AC 322 ms 56032 KiB
in12.txt AC 299 ms 56016 KiB
in13.txt AC 274 ms 49724 KiB
in14.txt AC 308 ms 56088 KiB
in15.txt AC 315 ms 55700 KiB
in16.txt AC 47 ms 38536 KiB
in17.txt AC 47 ms 38500 KiB
in18.txt AC 106 ms 45748 KiB
in19.txt AC 302 ms 56036 KiB
in20.txt AC 47 ms 38596 KiB
in21.txt AC 246 ms 49788 KiB
in22.txt AC 248 ms 49572 KiB
in23.txt AC 251 ms 49752 KiB
in24.txt AC 264 ms 49604 KiB
in25.txt AC 287 ms 55448 KiB
in26.txt AC 255 ms 49848 KiB
in27.txt AC 266 ms 51524 KiB
in28.txt AC 251 ms 49852 KiB
in29.txt AC 47 ms 38324 KiB
in30.txt AC 48 ms 38848 KiB
in31.txt AC 172 ms 52144 KiB
in32.txt AC 101 ms 42548 KiB
in33.txt AC 48 ms 38692 KiB
in34.txt AC 48 ms 38436 KiB
in35.txt AC 49 ms 38544 KiB
in36.txt AC 48 ms 38752 KiB
in37.txt AC 48 ms 38640 KiB
in38.txt AC 48 ms 38408 KiB
in39.txt AC 48 ms 38848 KiB
in40.txt AC 47 ms 38612 KiB
in41.txt AC 48 ms 38860 KiB
in42.txt AC 47 ms 38544 KiB
in43.txt AC 47 ms 38828 KiB
in44.txt AC 47 ms 38752 KiB
in45.txt AC 47 ms 38544 KiB
in46.txt AC 48 ms 38476 KiB
in47.txt AC 48 ms 38584 KiB
in48.txt AC 193 ms 51588 KiB
in49.txt AC 134 ms 44632 KiB
in50.txt AC 48 ms 38552 KiB
in51.txt AC 48 ms 38532 KiB
in52.txt AC 136 ms 48368 KiB
in53.txt AC 138 ms 47660 KiB
in54.txt AC 164 ms 50224 KiB
in55.txt AC 273 ms 52536 KiB
in56.txt AC 252 ms 49628 KiB
in57.txt AC 263 ms 52056 KiB
in58.txt AC 259 ms 49860 KiB
in59.txt AC 130 ms 45768 KiB
in60.txt AC 110 ms 45772 KiB
in61.txt AC 48 ms 38672 KiB
in62.txt AC 48 ms 38980 KiB
in63.txt AC 300 ms 56148 KiB
in64.txt AC 262 ms 49516 KiB
in65.txt AC 49 ms 38560 KiB
in66.txt AC 48 ms 38540 KiB
in67.txt AC 48 ms 38664 KiB
in68.txt AC 47 ms 38492 KiB
in69.txt AC 47 ms 38604 KiB
in70.txt AC 47 ms 38700 KiB
in71.txt AC 47 ms 38544 KiB
in72.txt AC 48 ms 38556 KiB
in73.txt AC 47 ms 38484 KiB
in74.txt AC 48 ms 38528 KiB
in75.txt AC 48 ms 38632 KiB
in76.txt AC 48 ms 38344 KiB
in77.txt AC 48 ms 38264 KiB
in78.txt AC 49 ms 38536 KiB
in79.txt AC 47 ms 38480 KiB
in80.txt AC 46 ms 38544 KiB
in81.txt AC 104 ms 45788 KiB
in82.txt AC 133 ms 45704 KiB
sample01.txt AC 48 ms 38668 KiB
sample02.txt AC 48 ms 38556 KiB
sample03.txt AC 48 ms 38508 KiB
sample04.txt AC 47 ms 38644 KiB
sample05.txt AC 47 ms 38476 KiB