Submission #2405869
Source Code Expand
#include <iostream> #include <bits/stdc++.h> typedef long long ll; const int MAXN=1e6+7; using namespace std; int c[MAXN]; int main() { string s,t; int n; cin>>n; cin>>s>>t; if(s[0]!=t[0]){return 0*puts("-1");} int ans=0,k=0,sum=0; for(int i=n-1,j=n-1;i>=0;i--) { sum+= c[i+k]; if( j>i || t[i]!=s[j]) { while( j&&( j>i|| t[i]!=s[j])) j--; if(j==i) continue; if(j<0) { return 0*puts("-1"); } k++,sum++; c[i+k-1]=0,c[j+k-1]--; } ans=max(ans,sum); } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | sizaif |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 697 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.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, example0.txt, example1.txt, example2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | WA | 1 ms | 256 KB |
001.txt | WA | 1 ms | 256 KB |
002.txt | WA | 1 ms | 256 KB |
003.txt | WA | 1 ms | 256 KB |
004.txt | WA | 1 ms | 256 KB |
005.txt | WA | 1 ms | 256 KB |
006.txt | WA | 1 ms | 256 KB |
007.txt | WA | 1 ms | 256 KB |
008.txt | WA | 1 ms | 256 KB |
009.txt | WA | 1 ms | 256 KB |
010.txt | WA | 1 ms | 256 KB |
011.txt | WA | 2 ms | 256 KB |
012.txt | WA | 1 ms | 256 KB |
013.txt | WA | 1 ms | 256 KB |
014.txt | WA | 1 ms | 256 KB |
015.txt | WA | 1 ms | 256 KB |
016.txt | WA | 1 ms | 256 KB |
017.txt | WA | 1 ms | 256 KB |
018.txt | WA | 1 ms | 256 KB |
example0.txt | WA | 1 ms | 256 KB |
example1.txt | WA | 1 ms | 256 KB |
example2.txt | WA | 1 ms | 256 KB |