Submission #2244996
Source Code Expand
#include <iostream> //#include <iomanip> #include <string> //#include <algorithm> //#include <utility> //#include <stack> //#include <queue> //#include <tuple> //#include <set> //#include <map> //#include <unordered_map> #include <vector> //#include <functional> //#include <bitset> //#include <cmath> using namespace std; typedef long long lint; typedef unsigned long long ulint; #define MOD 1000000007 int main(){ string s; cin >> s; bool chk[200001][26]; vector<int> beg; int r=26,K=0; for(int i=0;i<26;i++) chk[s.size()][i]=false; for(int at=s.size()-1;at>=0;at--){ for(int i=0;i<26;i++) chk[at][i]=chk[at+1][i]; if(!chk[at][s[at]-'a']){ chk[at][s[at]-'a']=true; r--; } if(r==0){ r=26; for(int i=0;i<26;i++) chk[at][i]=false; K++; beg.push_back(at); } } string ans=""; for(char c='a';c<='z';c++){ if(!chk[0][c-'a']){ ans=c; break; } } for(int i=beg.size()-1;i>=0;i--){ char last=ans.back(); int j; for(j=beg[i];s[j]!=last;j++); for(char c='a';c<='z';c++){ if(!chk[j+1][c-'a']){ ans=ans+c; break; } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Don't Be a Subsequence |
User | wisteria0410ss |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 1419 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 5636 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 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 | AC | 16 ms | 5636 KB |
11.txt | AC | 15 ms | 5636 KB |
12.txt | AC | 16 ms | 5636 KB |
13.txt | AC | 16 ms | 5636 KB |
14.txt | AC | 16 ms | 5636 KB |
15.txt | AC | 15 ms | 5636 KB |
16.txt | AC | 16 ms | 5636 KB |
17.txt | AC | 16 ms | 5636 KB |
18.txt | AC | 17 ms | 5636 KB |
19.txt | AC | 17 ms | 5636 KB |
2.txt | AC | 1 ms | 256 KB |
20.txt | AC | 18 ms | 5636 KB |
21.txt | AC | 18 ms | 5636 KB |
22.txt | AC | 18 ms | 5636 KB |
23.txt | AC | 18 ms | 5636 KB |
24.txt | AC | 15 ms | 5636 KB |
25.txt | AC | 15 ms | 5636 KB |
26.txt | AC | 15 ms | 5636 KB |
27.txt | AC | 14 ms | 5636 KB |
28.txt | AC | 15 ms | 5636 KB |
29.txt | AC | 15 ms | 5636 KB |
3.txt | AC | 2 ms | 2432 KB |
30.txt | AC | 15 ms | 5636 KB |
4.txt | AC | 2 ms | 512 KB |
5.txt | AC | 8 ms | 3328 KB |
6.txt | AC | 8 ms | 3072 KB |
7.txt | AC | 16 ms | 5636 KB |
8.txt | AC | 16 ms | 5636 KB |
9.txt | AC | 15 ms | 5636 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |