Submission #981158
Source Code Expand
// {{{ by shik
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }
template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
int c=0;
while ( *s!=',' || c!=0 ) {
if ( *s=='(' || *s=='[' || *s=='{' ) c++;
if ( *s==')' || *s==']' || *s=='}' ) c--;
cerr<<*s++;
}
cerr<<"="<<head<<", ";
_dump(s+1,tail...);
}
#define dump(...) do { \
fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
_dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)
template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
s<<"[";
for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
s<<"]";
return s;
}
template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif
template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }
void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
_R(head);
R(tail...);
}
template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
if ( i!=x.cbegin() ) putchar(' ');
_W(*i);
}
}
void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
_W(head);
putchar(sizeof...(tail)?' ':'\n');
W(tail...);
}
#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
freopen(name ".in","r",stdin); \
freopen(name ".out","w",stdout); \
} while (0)
#endif
// }}}
const int N=1e6+10;
int n,to[N];
char s1[N],s2[N];
int main() {
R(n,s1,s2);
if ( !strcmp(s1,s2) ) {
W(0);
return 0;
}
memset(to,-1,sizeof(to));
for ( int i=n-1,j=n-1; i>=0; i-- ) {
while ( j>=0 && (j>i || s1[j]!=s2[i]) ) j--;
if ( j<0 ) {
W(-1);
return 0;
}
dump(i,j);
if ( to[j]==-1 ) to[j]=i;
}
int ans=0,off=0;
priority_queue<int> q;
for ( int i=n-1; i>=0; i-- ) if ( to[i]!=-1 ) {
while ( !q.empty() && q.top()+off>to[i] ) q.pop();
off--;
q.push(i-off);
q.push(to[i]-off);
dump(i,to[i],SZ(q),q.top()+off);
ans=max(ans,SZ(q)-1);
}
W(ans);
return 0;
}
Submission Info
Submission Time
2016-11-12 23:14:06+0900
Task
F - Shik and Copying String
User
shik
Language
C++14 (GCC 5.4.1)
Score
1500
Code Size
3608 Byte
Status
AC
Exec Time
187 ms
Memory
10352 KB
Compile Error
./Main.cpp: In function ‘void _R(long long int&)’:
./Main.cpp:62:46: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 2 has type ‘long long int*’ [-Wformat=]
void _R( long long &x ) { scanf("%" PRId64,&x); }
^
./Main.cpp: In function ‘void _R(int&)’:
./Main.cpp:61:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void _R( int &x ) { scanf("%d",&x); }
^
./Main.cpp: In function ‘void _R(long long int&)’:
./Main.cpp:62:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
void _R( long long &x ) { scanf("%" PRId64,&x); }
^
./Main.cpp: In function ‘void _R(double&)’:
./Main.cpp:63:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-resu...
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
3 ms
256 KB
001.txt
AC
6 ms
4096 KB
002.txt
AC
6 ms
4096 KB
003.txt
AC
6 ms
4096 KB
004.txt
AC
6 ms
4096 KB
005.txt
AC
6 ms
4096 KB
006.txt
AC
6 ms
4096 KB
007.txt
AC
6 ms
4096 KB
008.txt
AC
6 ms
4096 KB
009.txt
AC
6 ms
4096 KB
010.txt
AC
6 ms
4096 KB
011.txt
AC
6 ms
4096 KB
012.txt
AC
6 ms
4096 KB
013.txt
AC
6 ms
4096 KB
014.txt
AC
6 ms
4096 KB
015.txt
AC
6 ms
4096 KB
016.txt
AC
6 ms
4096 KB
017.txt
AC
6 ms
4096 KB
018.txt
AC
6 ms
4096 KB
019.txt
AC
6 ms
4096 KB
020.txt
AC
6 ms
4096 KB
021.txt
AC
6 ms
4096 KB
022.txt
AC
6 ms
4096 KB
023.txt
AC
6 ms
4096 KB
024.txt
AC
6 ms
4096 KB
025.txt
AC
10 ms
2176 KB
026.txt
AC
187 ms
10352 KB
027.txt
AC
88 ms
8308 KB
028.txt
AC
50 ms
6144 KB
029.txt
AC
62 ms
6144 KB
030.txt
AC
31 ms
6144 KB
031.txt
AC
31 ms
6144 KB
032.txt
AC
31 ms
6144 KB
033.txt
AC
31 ms
6144 KB
034.txt
AC
29 ms
6144 KB
035.txt
AC
28 ms
6144 KB
036.txt
AC
27 ms
6144 KB
037.txt
AC
26 ms
6144 KB
038.txt
AC
24 ms
6144 KB
039.txt
AC
23 ms
6144 KB
040.txt
AC
45 ms
6144 KB
041.txt
AC
48 ms
6144 KB
042.txt
AC
68 ms
6144 KB
043.txt
AC
78 ms
6144 KB
044.txt
AC
101 ms
6144 KB
045.txt
AC
114 ms
6144 KB
046.txt
AC
136 ms
6272 KB
047.txt
AC
147 ms
6528 KB
048.txt
AC
175 ms
7288 KB
049.txt
AC
179 ms
8308 KB
050.txt
AC
16 ms
6144 KB
051.txt
AC
16 ms
6144 KB
052.txt
AC
15 ms
6144 KB
053.txt
AC
62 ms
6144 KB
054.txt
AC
70 ms
6144 KB
055.txt
AC
80 ms
6144 KB
056.txt
AC
84 ms
6272 KB
057.txt
AC
93 ms
6780 KB
058.txt
AC
94 ms
7288 KB
example0.txt
AC
6 ms
4096 KB
example1.txt
AC
3 ms
256 KB
example2.txt
AC
6 ms
4096 KB
example3.txt
AC
6 ms
4096 KB