Submission #1820370
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> #include<complex> using namespace std; #define FOR(i,a,b) for (int i = (a); i < (b); i++) #define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--) #define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL)INF; const int MAX = 1000 * 1000 + 47; int SH[MAX]; int R[MAX]; int L[MAX]; int H[MAX]; string s, t; void imp() { cout << -1 << endl; exit(0); } int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n >> s >> t; if (s == t) { cout << 0 << endl; return 0; } FOR(i, 0, n) { R[i] = -1; } int p = n - 1; RFOR(i, n, 0) { while (p != -1 && t[i] != s[p]) p--; if (p == -1) imp(); L[p] = i; R[p] = max(i, R[p]); if (i == p) p--; } int sh = 0, add = 0; int ans = 0; RFOR(i, n, 0) { H[i] = -add; if (R[i] == -1) { continue; } ans = max(ans, H[R[i] + sh] + add + 1); if (i == L[i]) { add = 0; sh = 0; continue; } sh++; add++; } //FOR(i, 0, n) //{ // cout << R[i] << " "; //} //cout << endl; //FOR(i, 0, n) //{ // cout << H[i] << " "; //} //cout << endl; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | F - Shik and Copying String |
User | philologist |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1980 Byte |
Status | WA |
Exec Time | 23 ms |
Memory | 15516 KB |
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 | AC | 1 ms | 256 KB |
001.txt | AC | 2 ms | 2304 KB |
002.txt | AC | 2 ms | 4352 KB |
003.txt | AC | 2 ms | 4352 KB |
004.txt | AC | 2 ms | 4352 KB |
005.txt | AC | 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 | WA | 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 | AC | 2 ms | 4352 KB |
017.txt | AC | 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 | AC | 2 ms | 4352 KB |
022.txt | AC | 2 ms | 4352 KB |
023.txt | AC | 2 ms | 4352 KB |
024.txt | AC | 2 ms | 4352 KB |
025.txt | AC | 5 ms | 3228 KB |
026.txt | AC | 14 ms | 15516 KB |
027.txt | AC | 13 ms | 15516 KB |
028.txt | WA | 23 ms | 15516 KB |
029.txt | WA | 23 ms | 15516 KB |
030.txt | WA | 14 ms | 15516 KB |
031.txt | WA | 14 ms | 15516 KB |
032.txt | AC | 16 ms | 15516 KB |
033.txt | WA | 16 ms | 15516 KB |
034.txt | WA | 16 ms | 15516 KB |
035.txt | AC | 16 ms | 15516 KB |
036.txt | AC | 16 ms | 15516 KB |
037.txt | AC | 16 ms | 15516 KB |
038.txt | WA | 15 ms | 15516 KB |
039.txt | WA | 15 ms | 15516 KB |
040.txt | AC | 21 ms | 15516 KB |
041.txt | AC | 18 ms | 15516 KB |
042.txt | AC | 15 ms | 15516 KB |
043.txt | AC | 14 ms | 15516 KB |
044.txt | AC | 14 ms | 15516 KB |
045.txt | AC | 14 ms | 15516 KB |
046.txt | AC | 14 ms | 15516 KB |
047.txt | AC | 14 ms | 15516 KB |
048.txt | AC | 14 ms | 15516 KB |
049.txt | AC | 14 ms | 15516 KB |
050.txt | AC | 11 ms | 13468 KB |
051.txt | AC | 11 ms | 13468 KB |
052.txt | AC | 10 ms | 13468 KB |
053.txt | AC | 18 ms | 15516 KB |
054.txt | AC | 18 ms | 15516 KB |
055.txt | AC | 18 ms | 15516 KB |
056.txt | AC | 18 ms | 15516 KB |
057.txt | AC | 18 ms | 15516 KB |
058.txt | AC | 18 ms | 15516 KB |
example0.txt | AC | 2 ms | 4352 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | AC | 2 ms | 4352 KB |
example3.txt | AC | 2 ms | 4352 KB |