結果

問題 No.801 エレベーター
ユーザー OlandOland
提出日時 2020-05-22 01:35:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 7,107 bytes
コンパイル時間 2,814 ms
コンパイル使用メモリ 78,952 KB
実行使用メモリ 40,388 KB
最終ジャッジ日時 2024-10-02 13:43:46
合計ジャッジ時間 9,116 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
37,272 KB
testcase_01 AC 51 ms
37,064 KB
testcase_02 AC 51 ms
37,072 KB
testcase_03 AC 87 ms
38,552 KB
testcase_04 AC 80 ms
38,600 KB
testcase_05 AC 84 ms
38,320 KB
testcase_06 AC 85 ms
38,312 KB
testcase_07 AC 86 ms
38,548 KB
testcase_08 AC 79 ms
38,296 KB
testcase_09 AC 86 ms
38,420 KB
testcase_10 AC 87 ms
38,368 KB
testcase_11 AC 89 ms
38,400 KB
testcase_12 AC 86 ms
38,372 KB
testcase_13 AC 259 ms
40,276 KB
testcase_14 AC 248 ms
40,188 KB
testcase_15 AC 252 ms
40,368 KB
testcase_16 AC 223 ms
39,280 KB
testcase_17 AC 251 ms
40,052 KB
testcase_18 AC 249 ms
40,328 KB
testcase_19 AC 257 ms
40,200 KB
testcase_20 AC 257 ms
40,324 KB
testcase_21 AC 256 ms
40,168 KB
testcase_22 AC 252 ms
40,220 KB
testcase_23 AC 242 ms
40,312 KB
testcase_24 AC 243 ms
40,316 KB
testcase_25 AC 221 ms
38,744 KB
testcase_26 AC 247 ms
40,280 KB
testcase_27 AC 242 ms
40,388 KB
testcase_28 AC 247 ms
40,340 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    void solve(){
        int N = in.nextInt(), M = in.nextInt(), K = in.nextInt();
        int[] L = new int[M], R = new int[M];
        for(int i = 0; i < M; i++){
            L[i] = in.nextInt();
            R[i] = in.nextInt();
        }
        
        long[] cs = new long[N+1], imos = new long[N+2];
        Arrays.fill(cs, 1);
        cs[0] = 0;
        for(int cnt = 1; cnt <= K; cnt++){
            for(int i = 0; i < M; i++){
                long sum = (cs[R[i]] - cs[L[i]-1] + MOD) % MOD;
                imos[L[i]] = (imos[L[i]] + sum) % MOD;
                imos[R[i]+1] = (imos[R[i]+1] - sum + MOD) % MOD;
            }
            long s = 0;
            for(int i = 1; i <= N; i++){
                s = (s + imos[i]) % MOD;
                cs[i] = (cs[i-1] + s) % MOD;
                imos[i] = 0;
            }
        }
        long ans = (cs[N] - cs[N-1] + MOD) % MOD;
        out.println(ans);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0