結果

問題 No.945 YKC饅頭
ユーザー OlandOland
提出日時 2019-12-08 00:14:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 358 ms / 2,000 ms
コード長 8,941 bytes
コンパイル時間 2,545 ms
コンパイル使用メモリ 94,320 KB
実行使用メモリ 55,044 KB
最終ジャッジ日時 2024-06-08 02:54:58
合計ジャッジ時間 17,566 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
37,600 KB
testcase_01 AC 64 ms
37,856 KB
testcase_02 AC 76 ms
38,032 KB
testcase_03 AC 82 ms
38,068 KB
testcase_04 AC 69 ms
38,156 KB
testcase_05 AC 72 ms
38,204 KB
testcase_06 AC 74 ms
38,012 KB
testcase_07 AC 75 ms
38,280 KB
testcase_08 AC 82 ms
38,140 KB
testcase_09 AC 76 ms
38,296 KB
testcase_10 AC 82 ms
38,032 KB
testcase_11 AC 74 ms
38,176 KB
testcase_12 AC 74 ms
37,936 KB
testcase_13 AC 82 ms
38,184 KB
testcase_14 AC 80 ms
38,008 KB
testcase_15 AC 73 ms
37,804 KB
testcase_16 AC 80 ms
37,828 KB
testcase_17 AC 79 ms
37,772 KB
testcase_18 AC 76 ms
38,328 KB
testcase_19 AC 67 ms
38,004 KB
testcase_20 AC 68 ms
37,644 KB
testcase_21 AC 69 ms
37,756 KB
testcase_22 AC 82 ms
38,288 KB
testcase_23 AC 86 ms
37,944 KB
testcase_24 AC 85 ms
38,136 KB
testcase_25 AC 81 ms
37,988 KB
testcase_26 AC 85 ms
38,124 KB
testcase_27 AC 78 ms
38,072 KB
testcase_28 AC 67 ms
37,876 KB
testcase_29 AC 68 ms
37,832 KB
testcase_30 AC 78 ms
37,840 KB
testcase_31 AC 141 ms
43,376 KB
testcase_32 AC 118 ms
45,244 KB
testcase_33 AC 197 ms
48,936 KB
testcase_34 AC 262 ms
47,004 KB
testcase_35 AC 329 ms
51,208 KB
testcase_36 AC 266 ms
43,788 KB
testcase_37 AC 263 ms
44,500 KB
testcase_38 AC 271 ms
45,760 KB
testcase_39 AC 179 ms
46,732 KB
testcase_40 AC 187 ms
49,100 KB
testcase_41 AC 148 ms
47,412 KB
testcase_42 AC 304 ms
47,800 KB
testcase_43 AC 266 ms
44,132 KB
testcase_44 AC 298 ms
50,880 KB
testcase_45 AC 325 ms
49,004 KB
testcase_46 AC 112 ms
42,772 KB
testcase_47 AC 262 ms
47,108 KB
testcase_48 AC 184 ms
42,092 KB
testcase_49 AC 208 ms
47,128 KB
testcase_50 AC 323 ms
47,492 KB
testcase_51 AC 352 ms
54,388 KB
testcase_52 AC 358 ms
54,612 KB
testcase_53 AC 355 ms
54,636 KB
testcase_54 AC 343 ms
55,044 KB
testcase_55 AC 330 ms
54,728 KB
testcase_56 AC 104 ms
46,388 KB
testcase_57 AC 111 ms
46,116 KB
testcase_58 AC 276 ms
50,916 KB
testcase_59 AC 284 ms
54,164 KB
testcase_60 AC 207 ms
49,568 KB
testcase_61 AC 292 ms
53,820 KB
testcase_62 AC 270 ms
50,860 KB
testcase_63 AC 124 ms
46,716 KB
testcase_64 AC 261 ms
49,632 KB
testcase_65 AC 202 ms
49,488 KB
testcase_66 AC 200 ms
49,664 KB
testcase_67 AC 222 ms
50,176 KB
testcase_68 AC 227 ms
49,808 KB
testcase_69 AC 192 ms
49,220 KB
testcase_70 AC 183 ms
49,208 KB
testcase_71 AC 178 ms
48,920 KB
testcase_72 AC 226 ms
49,904 KB
testcase_73 AC 288 ms
54,844 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve() {
        int n = in.nextInt(), m = in.nextInt();
        DualSegmentTreeUpdate seg = new DualSegmentTreeUpdate(n, 0);
        int[] L = new int[m], R = new int[m], T = new int[m];
        for(int i = 0; i < m; i++){
            L[i] = in.nextInt()-1;
            R[i] = in.nextInt();
            char t = in.nextChar();
            if(t == 'Y') T[i] = 1;
            if(t == 'K') T[i] = 2;
            if(t == 'C') T[i] = 3;
        }
        for(int i = m-1; i >= 0; i--){
            seg.setSegment(L[i], R[i], T[i]);
        }
        int[] num = new int[4];
        for(int i = 0; i < n; i++) num[(int)seg.getPoint(i)]++;
        for(int i = 1; i <= 3; i++) out.print(num[i] + " ");
        out.println();
    }
    
    class DualSegmentTreeUpdate {
        //0-indexed
        int d;
        long[] node;
        int[] stamp;
        int count;
        
        /* 単位元で初期化 */
        public DualSegmentTreeUpdate(int sz, long initVal){
            long[] v = new long[sz];
            Arrays.fill(v, initVal);
            init(v);
        }
        
        /* 配列vで初期化 */
        public DualSegmentTreeUpdate(long[] v){
            init(v);
        }
        
        private void init(long[] v){
            d = 1;
            while(d < v.length) d *= 2;
            node = new long[2*d];
            stamp = new int[2*d];
            count = 0;
            for(int i = 0; i < v.length; i++)
                node[i+d] = v[i];
        }
        
        /* xの要素を取得する */
        public long getPoint(int x){
            x += d;
            long res = node[x];
            int maxCount = stamp[x];
            while(x > 1){
                x = x / 2;
                if(maxCount < stamp[x]){
                    maxCount = stamp[x];
                    res = node[x];
                }
            }
            return res;
        }
        
        /* 指定した区間[a,b)に含まれるすべての要素を更新するクエリ */
        public void setSegment(int L, int R, long val){
            count++;//時間を更新
            L += d;
            R += d;
            while (L < R) {
                if ((L & 1) != 0){
                    node[L] = val;
                    stamp[L] = count;//タイムスタンプ
                    L++;
                }
                if ((R & 1) != 0){
                    --R;
                    node[R] = val;
                    stamp[R] = count;//タイムスタンプ
                }
                L >>= 1;
                R >>= 1;
            }
        }
    }
    
    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 = "output.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