Submission #2977842

---

Source Code Expand

import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, std.bitmanip;

bool solve(string s, int l, int r) {
    int[] sub;
    foreach (i; l..r+1) {
        if (s[i] == s[l]) {
            sub ~= i;
        } else if (s[i] < s[l]) {
            return false;
        }
    }
    sub ~= r+1;

    Tuple!(string, int, int)[] substrs;
    foreach (i; 0..sub.length.to!int-1) {
        substrs ~= tuple(s[sub[i]..sub[i+1]], sub[i], sub[i+1]-1);
    }
    substrs.sort();

    foreach (i; 0..substrs.length.to!int-1) {
        if (substrs[i][1] > substrs[i+1][1]) {
            return false;
        }
    }

    return true;
}

void main() {
    auto s = readln.chomp;
    writeln(solve(s, 0, s.length.to!int-1) ? "Yes" : "No");
}

Submission Info

Judge Result