Submission #1841276
Source Code Expand
#include<bits/stdc++.h> #define N 1000006 using namespace std; char s0[N],t[N]; int n; int val[N],match[N],ed[N]; int main(){ scanf("%d%s%s",&n,s0+1,t+1); for(int i=n,p=n;i>=1;i--){ p=min(p,i); while(p!=0 && s0[p]!=t[i]) p--; if(p==0) return puts("-1"),0; else if(match[p]==0) match[p]=i; } queue<int> q; int ans; for(int i=1;i<=n;i++){ if(match[i]==i) continue; else{ while(!q.empty() && q.front()+q.size()<=i ) q.pop(); if(match[i]!=0) q.push(match[i]); ans=max(ans,(int)q.size()); } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Shik and Copying String |
User | Wuvin |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 682 Byte |
Status | WA |
Exec Time | 29 ms |
Memory | 13952 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:8:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%s%s",&n,s0+1,t+1); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 2 ms | 4352 KB |
001.txt | AC | 2 ms | 2304 KB |
002.txt | AC | 2 ms | 4352 KB |
003.txt | AC | 2 ms | 4352 KB |
004.txt | WA | 2 ms | 4352 KB |
005.txt | WA | 2 ms | 4352 KB |
006.txt | AC | 2 ms | 4352 KB |
007.txt | AC | 2 ms | 4352 KB |
008.txt | AC | 2 ms | 4352 KB |
009.txt | AC | 2 ms | 4352 KB |
010.txt | AC | 2 ms | 4352 KB |
011.txt | WA | 2 ms | 4352 KB |
012.txt | WA | 2 ms | 4352 KB |
013.txt | AC | 2 ms | 4352 KB |
014.txt | AC | 2 ms | 4352 KB |
015.txt | AC | 2 ms | 4352 KB |
016.txt | WA | 2 ms | 4352 KB |
017.txt | WA | 2 ms | 4352 KB |
018.txt | WA | 2 ms | 4352 KB |
019.txt | AC | 2 ms | 4352 KB |
020.txt | AC | 2 ms | 4352 KB |
021.txt | WA | 2 ms | 4352 KB |
022.txt | WA | 2 ms | 4352 KB |
023.txt | WA | 2 ms | 4352 KB |
024.txt | WA | 2 ms | 4352 KB |
025.txt | WA | 10 ms | 9856 KB |
026.txt | WA | 17 ms | 13952 KB |
027.txt | WA | 15 ms | 9856 KB |
028.txt | AC | 29 ms | 9856 KB |
029.txt | AC | 29 ms | 9856 KB |
030.txt | WA | 12 ms | 9856 KB |
031.txt | WA | 13 ms | 9856 KB |
032.txt | AC | 15 ms | 9856 KB |
033.txt | AC | 16 ms | 9856 KB |
034.txt | WA | 17 ms | 9856 KB |
035.txt | AC | 17 ms | 9856 KB |
036.txt | AC | 17 ms | 9856 KB |
037.txt | AC | 16 ms | 9856 KB |
038.txt | WA | 16 ms | 9856 KB |
039.txt | AC | 16 ms | 9856 KB |
040.txt | AC | 25 ms | 9856 KB |
041.txt | AC | 22 ms | 9856 KB |
042.txt | AC | 18 ms | 9856 KB |
043.txt | WA | 18 ms | 9856 KB |
044.txt | AC | 17 ms | 9856 KB |
045.txt | WA | 17 ms | 9856 KB |
046.txt | AC | 17 ms | 9856 KB |
047.txt | AC | 17 ms | 9984 KB |
048.txt | WA | 17 ms | 10624 KB |
049.txt | AC | 17 ms | 10956 KB |
050.txt | AC | 10 ms | 9856 KB |
051.txt | AC | 10 ms | 9856 KB |
052.txt | AC | 9 ms | 7808 KB |
053.txt | AC | 20 ms | 9856 KB |
054.txt | WA | 20 ms | 9856 KB |
055.txt | WA | 20 ms | 9856 KB |
056.txt | AC | 20 ms | 9856 KB |
057.txt | AC | 20 ms | 10240 KB |
058.txt | WA | 20 ms | 10496 KB |
example0.txt | WA | 2 ms | 4352 KB |
example1.txt | WA | 2 ms | 4352 KB |
example2.txt | AC | 2 ms | 4352 KB |
example3.txt | AC | 2 ms | 4352 KB |