Submission #1606224
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <cstring> #include <vector> #include <queue> #include <set> #include <map> #include <cmath> #include <iomanip> #include <cassert> #include <bitset> using namespace std; typedef pair<int, int> P; #define rep(i, n) for (int i=0; i<(n); i++) #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) #define _1 first #define _2 second #define pb push_back #define INF 1145141919 #define MOD 1000000007 int N; string A; int S[200001][26]; int dp[200001]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cin >> A; N = A.length(); rep(i, 26) S[N][i] = N; for (int i=N-1; i>=0; i--) { rep(j, 26) S[i][j] = S[i+1][j]; S[i][A[i]-'a'] = i; } rep(i, N+1) dp[i] = INF; dp[N] = 0; for (int i=N-1; i>=0; i--) { rep(j, 26) { if (A[i]-'a' == j) continue; dp[i] = min(dp[i], dp[S[i][j]]+1); } } //rep(i, N)cout<<dp[i]<<",";cout<<"\n"; string o = ""; int L = dp[0]; int pos = 0; rep(i, L) { int t = -1; assert(pos <= N); rep(j, 26) { //assert(S[pos][j] <= N); int to = S[pos][j]; if (dp[min(to+1, N)] <= L-1-i) { pos = to+1; //cout<<"pos="<<pos<<"\n"; t = j; break; } } assert(t != -1); o += (char)('a'+t); } assert(o.size() == L); cout << o << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Don't Be a Subsequence |
User | funcsr |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1495 Byte |
Status | WA |
Exec Time | 23 ms |
Memory | 21652 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 600 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 1 ms | 256 KB |
10.txt | WA | 23 ms | 21652 KB |
11.txt | WA | 23 ms | 21652 KB |
12.txt | WA | 23 ms | 21524 KB |
13.txt | WA | 23 ms | 21652 KB |
14.txt | WA | 23 ms | 21652 KB |
15.txt | WA | 23 ms | 21652 KB |
16.txt | WA | 23 ms | 21652 KB |
17.txt | WA | 23 ms | 21652 KB |
18.txt | WA | 23 ms | 21652 KB |
19.txt | WA | 23 ms | 21652 KB |
2.txt | AC | 1 ms | 384 KB |
20.txt | WA | 23 ms | 21652 KB |
21.txt | WA | 23 ms | 21652 KB |
22.txt | WA | 23 ms | 21652 KB |
23.txt | WA | 23 ms | 21652 KB |
24.txt | WA | 23 ms | 21652 KB |
25.txt | WA | 23 ms | 21652 KB |
26.txt | AC | 23 ms | 21652 KB |
27.txt | WA | 23 ms | 21652 KB |
28.txt | AC | 23 ms | 21652 KB |
29.txt | AC | 23 ms | 21652 KB |
3.txt | WA | 2 ms | 1280 KB |
30.txt | AC | 23 ms | 21652 KB |
4.txt | WA | 2 ms | 1280 KB |
5.txt | WA | 12 ms | 12368 KB |
6.txt | WA | 12 ms | 12368 KB |
7.txt | WA | 23 ms | 21652 KB |
8.txt | WA | 23 ms | 21652 KB |
9.txt | WA | 23 ms | 21652 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |