Mujin Programming Challenge 2017

Submission #1294393

Source codeソースコード

#include <cstdio>
#include <algorithm>
static const int MAXN = 5e5 + 4;
static const int LOGN = 20;
static const int ALPHABET = 26;

int n, q;
char s[MAXN];
// f[position][token or ALPHABET - empty string] - first index where the shrunk string equals a given character
int f[MAXN][ALPHABET + 1];
// g[position][power of two] - going 2^i steps through f[*][ALPHABET], the stopping index, or MAXN if nonexistent
int g[MAXN][LOGN];

int main()
{
    for (n = 0; (s[n] = getchar()) != '\n'; ++n) s[n] -= 'a';

    for (int i = 0; i <= n; ++i)
        for (int j = 0; j <= ALPHABET; ++j) f[i][j] = g[i][j] = MAXN;
    for (int i = n - 1; i >= 0; --i) {
        f[i][s[i]] = i + 1;
        for (int token = s[i] + 1; token <= ALPHABET; ++token)
            f[i][token] = (f[i][token - 1] == MAXN ? MAXN : f[f[i][token - 1]][token - 1]);
        if (f[i][ALPHABET] != MAXN) for (int token = 0; token < s[i]; ++token)
            f[i][token] = f[f[i][ALPHABET]][token];
        g[i][0] = f[i][ALPHABET];
        for (int j = 1; j < LOGN; ++j)
            g[i][j] = (g[i][j - 1] == MAXN ? MAXN : g[g[i][j - 1]][j - 1]);
    }

    scanf("%d", &q);
    int l, r;
    for (int i = 0; i < q; ++i) {
        scanf("%d%d", &l, &r); --l;
        for (int pot = LOGN - 1; pot >= 0; --pot)
            if (g[l][pot] <= r) l = g[l][pot];
        puts(l == r ? "Yes" : "No");
    }

    return 0;
}

Submission

Task問題 C - Robot and String
User nameユーザ名 (๑´ω`๑)
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1300
Source lengthソースコード長 1421 Byte
File nameファイル名
Exec time実行時間 181 ms
Memory usageメモリ使用量 92928 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &q);
^
./Main.cpp:34:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &l, &r); --l;
^
./Main.cpp:19:69: warning: iteration 20u invokes undefined behavior [-Waggressive-loop-optimizations]
for (int j = 0; j <= ALPHABET; ++j) f[i][j] = g[i][j] = MAXN;
^
./Main.cpp:19:27: note: containing loop
for (int j = 0; j <= ALPHABET; ++j) f[i][j] = g[i][j] = MAXN;
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt
All 1300 / 1300 0_00.txt,0_01.txt,0_02.txt,1_00.txt,1_01.txt,1_02.txt,1_03.txt,1_04.txt,1_05.txt,1_06.txt,1_07.txt,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt,1_20.txt,1_21.txt,1_22.txt,1_23.txt,1_24.txt,1_25.txt,1_26.txt,1_27.txt,1_28.txt,1_29.txt,1_30.txt,1_31.txt,1_32.txt,1_33.txt,1_34.txt,1_35.txt,1_36.txt,1_37.txt,1_38.txt,1_39.txt,1_40.txt,1_41.txt,1_42.txt,1_43.txt,1_44.txt,1_45.txt,1_46.txt,1_47.txt,1_48.txt,1_49.txt,1_50.txt,1_51.txt,1_52.txt,1_53.txt,1_54.txt,1_55.txt,1_56.txt,1_57.txt,1_58.txt,1_59.txt,1_60.txt,1_61.txt,1_62.txt,1_63.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 1 ms 4224 KB
0_01.txt AC 1 ms 4224 KB
0_02.txt AC 1 ms 4224 KB
1_00.txt AC 20 ms 4608 KB
1_01.txt AC 20 ms 4608 KB
1_02.txt AC 139 ms 92800 KB
1_03.txt AC 134 ms 92800 KB
1_04.txt AC 135 ms 92800 KB
1_05.txt AC 138 ms 92800 KB
1_06.txt AC 180 ms 92800 KB
1_07.txt AC 181 ms 92800 KB
1_08.txt AC 101 ms 92800 KB
1_09.txt AC 99 ms 92800 KB
1_10.txt AC 98 ms 92800 KB
1_11.txt AC 97 ms 92800 KB
1_12.txt AC 97 ms 92800 KB
1_13.txt AC 98 ms 92800 KB
1_14.txt AC 98 ms 92800 KB
1_15.txt AC 99 ms 92800 KB
1_16.txt AC 98 ms 92800 KB
1_17.txt AC 102 ms 92800 KB
1_18.txt AC 107 ms 92800 KB
1_19.txt AC 108 ms 92800 KB
1_20.txt AC 110 ms 92800 KB
1_21.txt AC 112 ms 92800 KB
1_22.txt AC 123 ms 92800 KB
1_23.txt AC 124 ms 92800 KB
1_24.txt AC 136 ms 92800 KB
1_25.txt AC 150 ms 92800 KB
1_26.txt AC 159 ms 92800 KB
1_27.txt AC 165 ms 92800 KB
1_28.txt AC 169 ms 92800 KB
1_29.txt AC 171 ms 92800 KB
1_30.txt AC 164 ms 92800 KB
1_31.txt AC 165 ms 92800 KB
1_32.txt AC 164 ms 92800 KB
1_33.txt AC 92 ms 92800 KB
1_34.txt AC 93 ms 92800 KB
1_35.txt AC 99 ms 92800 KB
1_36.txt AC 101 ms 92800 KB
1_37.txt AC 104 ms 92800 KB
1_38.txt AC 106 ms 92800 KB
1_39.txt AC 109 ms 92800 KB
1_40.txt AC 115 ms 92800 KB
1_41.txt AC 126 ms 92800 KB
1_42.txt AC 124 ms 92800 KB
1_43.txt AC 134 ms 92800 KB
1_44.txt AC 134 ms 92800 KB
1_45.txt AC 137 ms 92800 KB
1_46.txt AC 141 ms 92800 KB
1_47.txt AC 147 ms 92800 KB
1_48.txt AC 155 ms 92800 KB
1_49.txt AC 135 ms 92800 KB
1_50.txt AC 153 ms 92800 KB
1_51.txt AC 116 ms 92800 KB
1_52.txt AC 152 ms 92800 KB
1_53.txt AC 111 ms 92800 KB
1_54.txt AC 151 ms 92800 KB
1_55.txt AC 119 ms 92800 KB
1_56.txt AC 146 ms 92800 KB
1_57.txt AC 111 ms 92800 KB
1_58.txt AC 132 ms 92800 KB
1_59.txt AC 171 ms 92800 KB
1_60.txt AC 135 ms 92800 KB
1_61.txt AC 130 ms 92928 KB
1_62.txt AC 94 ms 92800 KB
1_63.txt AC 123 ms 92800 KB