Contest Duration: - (local time) (100 minutes) Back to Home

Submission #6998416

Source Code Expand

Copy
```using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
static void Main()
{
//SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
new Program().solve();
Out.Flush();
}
readonly Scanner cin = new Scanner();
readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }
const long inf = long.MaxValue / 3;

void solve()
{

var B = new long[26];
foreach (var item in T)
{
B[item - 'a']++;
}
var A = new long[26];
foreach (var item in S)
{
A[item - 'a']++;
}
for (int i = 0; i < 26; i++)
{
if (B[i] == 0) continue;
if (A[i] == 0)
{
WriteLine(-1);
return;
}
}

int N = S.Length;
var dp = new long[S.Length, 26];
for (int i = 0; i < S.Length; i++)
{
for (int j = 0; j < 26; j++)
{
dp[i, j] = inf;
}
}

for (int i = 0; i < S.Length; i++)
{
var id = S[i] - 'a';
chmin(ref dp[N - 1, id], i + 1);
}

for (int i = S.Length - 1; i > 0; i--)
{
for (int j = 0; j < 26; j++)
{
dp[i - 1, j] = dp[i, j] + 1;
}
var id = S[i] - 'a';
dp[i - 1, id] = 1;
}

long ans = 0;
long now = N - 1;
foreach (var v in T)
{
var id = v - 'a';
var take = dp[now, id];
ans += take;
now = (now + take) % N;
}

WriteLine(ans);

}

}

static class Ex
{
public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
{
int low = 0, high = arr.Count;
int mid;
while (low < high)
{
mid = ((high - low) >> 1) + low;
if (arr[mid].CompareTo(val) < 0) low = mid + 1;
else high = mid;
}
return low;
}
public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
{
int low = 0, high = arr.Count;
int mid;
while (low < high)
{
mid = ((high - low) >> 1) + low;
if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
else high = mid;
}
return low;
}
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
public T f; public U s;
public Pair(T f, U s) { this.f = f; this.s = s; }
public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
public override string ToString() => \$"{f} {s}";
}

class Scanner
{
string[] s; int i;
readonly char[] cs = new char[] { ' ' };
public Scanner() { s = new string[0]; i = 0; }
public int[] scanint => Array.ConvertAll(scan, int.Parse);
public long[] scanlong => Array.ConvertAll(scan, long.Parse);
public double[] scandouble => Array.ConvertAll(scan, double.Parse);
public string next
{
get
{
if (i < s.Length) return s[i++];
while (st == "") st = ReadLine();
s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
i = 0;
return next;
}
}
public int nextint => int.Parse(next);
public long nextlong => long.Parse(next);
public double nextdouble => double.Parse(next);
}
```

#### Submission Info

Submission Time 2019-08-18 21:37:33+0900 E - Strings of Impurity claw88 C# (Mono 4.6.2.0) 500 4778 Byte AC 48 ms 32096 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
 AC × 3
 AC × 45
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33, b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45
Case Name Status Exec Time Memory
a01 AC 21 ms 11092 KB
a02 AC 20 ms 11220 KB
a03 AC 20 ms 9044 KB
b04 AC 23 ms 9172 KB
b05 AC 20 ms 9044 KB
b06 AC 20 ms 9044 KB
b07 AC 21 ms 9044 KB
b08 AC 21 ms 11092 KB
b09 AC 20 ms 9172 KB
b10 AC 46 ms 31968 KB
b11 AC 46 ms 32096 KB
b12 AC 46 ms 30048 KB
b13 AC 46 ms 30048 KB
b14 AC 47 ms 31968 KB
b15 AC 46 ms 31968 KB
b16 AC 22 ms 11744 KB
b17 AC 47 ms 31968 KB
b18 AC 48 ms 31968 KB
b19 AC 22 ms 9696 KB
b20 AC 46 ms 29920 KB
b21 AC 46 ms 30048 KB
b22 AC 46 ms 30048 KB
b23 AC 46 ms 32096 KB
b24 AC 46 ms 30048 KB
b25 AC 47 ms 30048 KB
b26 AC 46 ms 30048 KB
b27 AC 46 ms 30048 KB
b28 AC 46 ms 30048 KB
b29 AC 45 ms 30048 KB
b30 AC 46 ms 30048 KB
b31 AC 22 ms 11744 KB
b32 AC 23 ms 11196 KB
b33 AC 21 ms 11360 KB
b34 AC 43 ms 31584 KB
b35 AC 21 ms 9312 KB
b36 AC 46 ms 32096 KB
b37 AC 46 ms 32096 KB
b38 AC 46 ms 32096 KB
b39 AC 46 ms 32096 KB
b40 AC 46 ms 32096 KB
b41 AC 46 ms 30048 KB
b42 AC 22 ms 11744 KB
b43 AC 22 ms 9696 KB
b44 AC 46 ms 32096 KB
b45 AC 46 ms 31968 KB