Submission #980155
Source Code Expand
#include <cstdio> #include <algorithm> #include <stack> #include <queue> #include <deque> #include <vector> #include <string> #include <string.h> #include <cstdlib> #include <ctime> #include <cmath> #include <map> #include <set> #include <iostream> #include <sstream> #include <numeric> #include <cctype> #include <bitset> #include <cassert> #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next) #define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++) #define rng(a) a.begin(),a.end() #define maxs(x,y) x = max(x,y) #define mins(x,y) x = min(x,y) #define pb push_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcount #define uni(x) x.erase(unique(rng(x)),x.end()) #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define df(x) int x = in() #define dame { puts("-1"); return 0;} #define show(x) cout<<#x<<" = "<<x<<endl; #define PQ(T) priority_queue<T,vector<T>,greater<T> > using namespace std; typedef long long int ll; typedef pair<int,int> P; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<P> vp; inline int in() { int x; scanf("%d",&x); return x;} inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');} template<typename T>istream& operator>>(istream&i,vector<T>&v) {rep(j,sz(v))i>>v[j];return i;} template<typename T>string join(vector<T>&v) {stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);} template<typename T>ostream& operator<<(ostream&o,vector<T>&v) {if(sz(v))o<<join(v);return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v) {return i>>v.fi>>v.se;} template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v) {return o<<v.fi<<","<<v.se;} const int MX = 100005, INF = 1001001001; const ll LINF = 1e18; const double eps = 1e-10; int main() { int n; scanf("%d",&n); string s, t; cin >> s >> t; vi a(n+1,INF); // vi cp(256,-1); // int mx = 0; // rep(i,n) { // cp[s[i]] = i; // int x = cp[t[i]]; // if (x < mx) dame; // a[i] = x; // mx = x; // } int si = n-1; drep(i,n) { while (si >= 0 && (si > i || s[si] != t[i])) --si; if (si == -1) dame; a[i] = si; } vi p; rep(i,n) if (a[i] != a[i+1]) p.pb(i); reverse(rng(p)); int ans = 0; deque<int> q; for (int r : p) { int l = a[r]; q.push_front(l); while (sz(q)) { int i = sz(q)-1; if (q[i]-i < r) break; q.pop_back(); } maxs(ans,sz(q)); } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Shik and Copying String |
User | snuke |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 2870 Byte |
Status | AC |
Exec Time | 104 ms |
Memory | 14076 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:66:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1500 / 1500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.txt, example3.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, 050.txt, 051.txt, 052.txt, 053.txt, 054.txt, 055.txt, 056.txt, 057.txt, 058.txt, example0.txt, example1.txt, example2.txt, example3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 2 ms | 256 KB |
001.txt | AC | 2 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 2 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 2 ms | 256 KB |
008.txt | AC | 2 ms | 256 KB |
009.txt | AC | 2 ms | 256 KB |
010.txt | AC | 3 ms | 256 KB |
011.txt | AC | 3 ms | 256 KB |
012.txt | AC | 3 ms | 256 KB |
013.txt | AC | 3 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 3 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 3 ms | 256 KB |
018.txt | AC | 3 ms | 256 KB |
019.txt | AC | 3 ms | 256 KB |
020.txt | AC | 3 ms | 256 KB |
021.txt | AC | 3 ms | 256 KB |
022.txt | AC | 3 ms | 256 KB |
023.txt | AC | 2 ms | 256 KB |
024.txt | AC | 3 ms | 256 KB |
025.txt | AC | 91 ms | 10752 KB |
026.txt | AC | 94 ms | 14076 KB |
027.txt | AC | 84 ms | 10112 KB |
028.txt | AC | 103 ms | 10752 KB |
029.txt | AC | 104 ms | 10752 KB |
030.txt | AC | 91 ms | 10752 KB |
031.txt | AC | 92 ms | 10752 KB |
032.txt | AC | 93 ms | 10752 KB |
033.txt | AC | 93 ms | 10752 KB |
034.txt | AC | 92 ms | 10752 KB |
035.txt | AC | 92 ms | 10752 KB |
036.txt | AC | 87 ms | 8708 KB |
037.txt | AC | 86 ms | 8708 KB |
038.txt | AC | 85 ms | 8708 KB |
039.txt | AC | 83 ms | 8708 KB |
040.txt | AC | 95 ms | 10752 KB |
041.txt | AC | 94 ms | 10752 KB |
042.txt | AC | 96 ms | 10752 KB |
043.txt | AC | 93 ms | 10752 KB |
044.txt | AC | 94 ms | 10752 KB |
045.txt | AC | 94 ms | 10752 KB |
046.txt | AC | 94 ms | 10752 KB |
047.txt | AC | 94 ms | 10752 KB |
048.txt | AC | 93 ms | 10752 KB |
049.txt | AC | 93 ms | 11132 KB |
050.txt | AC | 73 ms | 6280 KB |
051.txt | AC | 73 ms | 6280 KB |
052.txt | AC | 73 ms | 6280 KB |
053.txt | AC | 88 ms | 8708 KB |
054.txt | AC | 88 ms | 8708 KB |
055.txt | AC | 88 ms | 8708 KB |
056.txt | AC | 88 ms | 8708 KB |
057.txt | AC | 88 ms | 8708 KB |
058.txt | AC | 87 ms | 8708 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |
example2.txt | AC | 2 ms | 256 KB |
example3.txt | AC | 2 ms | 256 KB |