Submission #1865916
Source Code Expand
#include"bits/stdc++.h" #define PB push_back #define PF push_front #define LB lower_bound #define UB upper_bound #define fr(x) freopen(x,"r",stdin) #define fw(x) freopen(x,"w",stdout) #define iout(x) printf("%d\n",x) #define lout(x) printf("%lld\n",x) #define REP(x,l,u) for(int x = (l);x<=(u);x++) #define RREP(x,l,u) for(int x = (l);x>=(u);x--) #define mst(x,a) memset(x,a,sizeof(x)) #define PII pair<int,int> #define PLL pair<ll,ll> #define MP make_pair #define se second #define fi first #define dbg(x) cout<<#x<<" = "<<(x)<<endl; #define sz(x) ((int)x.size()) #define cl(x) x.clear() typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ld; using namespace std; const int maxn = 1000010; const int mod = 1e9+7; const int MAX = 1000000010; const double eps = 1e-6; const double PI = acos(-1); template<typename T> inline void read(T &x){ x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f; } template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);} template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);} template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);} template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;} template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;} int n,ans; char s[maxn],t[maxn]; queue<int> Q; void Work(){ if(!strcmp(s+1,t+1)){ puts("0"); return; } int now=n; RREP(i,n,1)if(t[i]!=t[i-1]){ now=min(now,i); while(now&&s[now]!=t[i])now--; if(!now){ puts("-1"); return; } while(!Q.empty()&&Q.front()>=Q.size()+i)Q.pop(); if(now!=i)Q.push(now); ans=max(ans,(int)Q.size()); } iout(ans+1); } void Init(){ read(n); scanf("%s%s",s+1,t+1); } int main(){ Init(); Work(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Shik and Copying String |
User | yanQval |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 2128 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 6272 KB |
Compile Error
./Main.cpp: In function ‘void Init()’: ./Main.cpp:74:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s%s",s+1,t+1); ^
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 | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
016.txt | AC | 1 ms | 256 KB |
017.txt | AC | 1 ms | 256 KB |
018.txt | AC | 1 ms | 256 KB |
019.txt | AC | 1 ms | 256 KB |
020.txt | AC | 1 ms | 256 KB |
021.txt | AC | 1 ms | 256 KB |
022.txt | AC | 1 ms | 256 KB |
023.txt | AC | 1 ms | 256 KB |
024.txt | AC | 1 ms | 256 KB |
025.txt | AC | 7 ms | 2176 KB |
026.txt | AC | 18 ms | 6272 KB |
027.txt | AC | 13 ms | 4224 KB |
028.txt | AC | 21 ms | 2176 KB |
029.txt | AC | 22 ms | 2176 KB |
030.txt | AC | 10 ms | 2176 KB |
031.txt | AC | 10 ms | 2176 KB |
032.txt | AC | 10 ms | 2176 KB |
033.txt | AC | 10 ms | 2176 KB |
034.txt | AC | 10 ms | 2176 KB |
035.txt | AC | 10 ms | 2176 KB |
036.txt | AC | 10 ms | 2176 KB |
037.txt | AC | 10 ms | 2176 KB |
038.txt | AC | 10 ms | 2176 KB |
039.txt | AC | 10 ms | 2176 KB |
040.txt | AC | 17 ms | 2176 KB |
041.txt | AC | 17 ms | 2176 KB |
042.txt | AC | 17 ms | 2176 KB |
043.txt | AC | 17 ms | 2176 KB |
044.txt | AC | 17 ms | 2176 KB |
045.txt | AC | 17 ms | 2176 KB |
046.txt | AC | 16 ms | 2304 KB |
047.txt | AC | 17 ms | 2304 KB |
048.txt | AC | 17 ms | 2944 KB |
049.txt | AC | 17 ms | 3328 KB |
050.txt | AC | 16 ms | 6272 KB |
051.txt | AC | 16 ms | 6272 KB |
052.txt | AC | 11 ms | 4224 KB |
053.txt | AC | 15 ms | 2176 KB |
054.txt | AC | 15 ms | 2176 KB |
055.txt | AC | 14 ms | 2176 KB |
056.txt | AC | 14 ms | 2304 KB |
057.txt | AC | 15 ms | 2560 KB |
058.txt | AC | 15 ms | 2816 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | AC | 1 ms | 256 KB |
example3.txt | AC | 1 ms | 256 KB |