結果

問題 No.945 YKC饅頭
ユーザー OlandOland
提出日時 2019-12-08 00:14:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 354 ms / 2,000 ms
コード長 8,941 bytes
コンパイル時間 2,661 ms
コンパイル使用メモリ 77,640 KB
実行使用メモリ 68,232 KB
最終ジャッジ日時 2023-08-27 07:09:03
合計ジャッジ時間 18,810 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 71 ms
50,808 KB
testcase_01 AC 71 ms
50,604 KB
testcase_02 AC 74 ms
50,872 KB
testcase_03 AC 85 ms
52,284 KB
testcase_04 AC 70 ms
50,884 KB
testcase_05 AC 77 ms
51,128 KB
testcase_06 AC 81 ms
51,212 KB
testcase_07 AC 79 ms
50,956 KB
testcase_08 AC 73 ms
50,644 KB
testcase_09 AC 79 ms
50,792 KB
testcase_10 AC 80 ms
51,208 KB
testcase_11 AC 77 ms
50,624 KB
testcase_12 AC 77 ms
50,728 KB
testcase_13 AC 84 ms
52,188 KB
testcase_14 AC 82 ms
50,824 KB
testcase_15 AC 78 ms
50,864 KB
testcase_16 AC 74 ms
50,828 KB
testcase_17 AC 82 ms
50,972 KB
testcase_18 AC 79 ms
51,012 KB
testcase_19 AC 72 ms
50,884 KB
testcase_20 AC 72 ms
50,852 KB
testcase_21 AC 74 ms
50,732 KB
testcase_22 AC 86 ms
52,084 KB
testcase_23 AC 84 ms
51,280 KB
testcase_24 AC 86 ms
52,164 KB
testcase_25 AC 87 ms
52,108 KB
testcase_26 AC 85 ms
51,888 KB
testcase_27 AC 76 ms
50,788 KB
testcase_28 AC 72 ms
50,852 KB
testcase_29 AC 71 ms
50,708 KB
testcase_30 AC 72 ms
50,728 KB
testcase_31 AC 137 ms
56,740 KB
testcase_32 AC 122 ms
56,980 KB
testcase_33 AC 209 ms
63,624 KB
testcase_34 AC 274 ms
58,948 KB
testcase_35 AC 326 ms
64,120 KB
testcase_36 AC 272 ms
57,380 KB
testcase_37 AC 270 ms
58,248 KB
testcase_38 AC 268 ms
57,556 KB
testcase_39 AC 179 ms
59,340 KB
testcase_40 AC 184 ms
61,024 KB
testcase_41 AC 155 ms
59,084 KB
testcase_42 AC 304 ms
60,368 KB
testcase_43 AC 260 ms
57,024 KB
testcase_44 AC 293 ms
63,504 KB
testcase_45 AC 314 ms
59,208 KB
testcase_46 AC 112 ms
56,628 KB
testcase_47 AC 259 ms
58,956 KB
testcase_48 AC 162 ms
54,784 KB
testcase_49 AC 191 ms
58,976 KB
testcase_50 AC 317 ms
61,136 KB
testcase_51 AC 346 ms
68,232 KB
testcase_52 AC 350 ms
67,448 KB
testcase_53 AC 348 ms
66,832 KB
testcase_54 AC 343 ms
67,160 KB
testcase_55 AC 354 ms
67,332 KB
testcase_56 AC 107 ms
58,608 KB
testcase_57 AC 107 ms
58,528 KB
testcase_58 AC 284 ms
64,108 KB
testcase_59 AC 307 ms
67,612 KB
testcase_60 AC 214 ms
61,288 KB
testcase_61 AC 291 ms
67,480 KB
testcase_62 AC 284 ms
63,948 KB
testcase_63 AC 123 ms
58,852 KB
testcase_64 AC 220 ms
60,772 KB
testcase_65 AC 210 ms
60,692 KB
testcase_66 AC 194 ms
63,460 KB
testcase_67 AC 238 ms
61,084 KB
testcase_68 AC 218 ms
61,340 KB
testcase_69 AC 194 ms
61,168 KB
testcase_70 AC 194 ms
60,916 KB
testcase_71 AC 191 ms
61,328 KB
testcase_72 AC 236 ms
61,480 KB
testcase_73 AC 298 ms
68,204 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