Submission #980787
Source Code Expand
#ifdef DEBUG #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back #define sz(s) ((int) ((s).size())) #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr) #ifdef _WIN32 #define LLD "%I64d" #else #define LLD "%lld" #endif typedef long long ll; typedef long double ld; const int inf = (int) 1e9 + 100; const ld eps = 1e-11; const ld pi = acos(-1.0L); mt19937 mrand(random_device{} ()); int rnd(int x) { return mrand() % x; } void precalc() { } const int maxn = 1e6 + 100; int n; char s[maxn], t[maxn]; bool read() { if (scanf("%d", &n) < 1) { return false; } scanf("%s", s); scanf("%s", t); return true; } vector<int> pos[300]; void solve() { { bool ok = true; for (int i = 0; i < n; i++) { if (s[i] != t[i]) { ok = false; } } if (ok) { printf("0\n"); return; } } for (int i = 0; i < 300; i++) { pos[i].clear(); } for (int i = 0; i < n; i++) { pos[s[i]].pb(i); } vector<int> xs; vector<int> want; for (int i = n - 1; i >= 0; i--) { if (i == 0 || t[i] != t[i - 1]) { int mx = sz(xs) ? xs.back() : inf; mx = min(mx, i); int j = (int) (upper_bound(pos[t[i]].begin(), pos[t[i]].end(), mx) - pos[t[i]].begin()); j--; if (j == -1) { printf("-1\n"); return; } xs.pb(pos[t[i]][j]); want.pb(i); } } reverse(xs.begin(), xs.end()); reverse(want.begin(), want.end()); vector<int> magic; for (int i = 0; i < sz(xs); i++) { magic.pb(xs[i] - i); } magic.pb(want.back() - sz(xs) + 1); int ans = 1; for (int i = 0; i < sz(xs); i++) { int j = (int) (lower_bound(magic.begin(), magic.end(), want[i] - i) - magic.begin()); ans = max(ans, 1 + j - i); } printf("%d\n", ans); } int main() { precalc(); #ifdef DEBUG assert(freopen("text.in", "r", stdin)); assert(freopen("text.out", "w", stdout)); #endif while (true) { if (!read()) { break; } solve(); #ifdef DEBUG eprintf("Time: %.18f\n", (double) clock() / CLOCKS_PER_SEC); #endif } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Shik and Copying String |
User | StanislavErshov |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 2262 Byte |
Status | AC |
Exec Time | 146 ms |
Memory | 22824 KB |
Compile Error
./Main.cpp: In function ‘bool read()’: ./Main.cpp:43:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", s); ^ ./Main.cpp:44:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", t); ^
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 | 3 ms | 256 KB |
002.txt | AC | 3 ms | 256 KB |
003.txt | AC | 2 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 2 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 2 ms | 256 KB |
008.txt | AC | 2 ms | 256 KB |
009.txt | AC | 2 ms | 256 KB |
010.txt | AC | 2 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 2 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 3 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 3 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
019.txt | AC | 2 ms | 256 KB |
020.txt | AC | 2 ms | 256 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 3 ms | 256 KB |
023.txt | AC | 3 ms | 256 KB |
024.txt | AC | 3 ms | 256 KB |
025.txt | AC | 10 ms | 2176 KB |
026.txt | AC | 146 ms | 22380 KB |
027.txt | AC | 85 ms | 14576 KB |
028.txt | AC | 112 ms | 18404 KB |
029.txt | AC | 113 ms | 17868 KB |
030.txt | AC | 41 ms | 8676 KB |
031.txt | AC | 40 ms | 8572 KB |
032.txt | AC | 40 ms | 8768 KB |
033.txt | AC | 40 ms | 8592 KB |
034.txt | AC | 38 ms | 8644 KB |
035.txt | AC | 38 ms | 8640 KB |
036.txt | AC | 35 ms | 8516 KB |
037.txt | AC | 34 ms | 8164 KB |
038.txt | AC | 33 ms | 8264 KB |
039.txt | AC | 31 ms | 7816 KB |
040.txt | AC | 86 ms | 14792 KB |
041.txt | AC | 111 ms | 19112 KB |
042.txt | AC | 132 ms | 21832 KB |
043.txt | AC | 133 ms | 22248 KB |
044.txt | AC | 136 ms | 22504 KB |
045.txt | AC | 135 ms | 22576 KB |
046.txt | AC | 135 ms | 22696 KB |
047.txt | AC | 136 ms | 22616 KB |
048.txt | AC | 138 ms | 22824 KB |
049.txt | AC | 139 ms | 22820 KB |
050.txt | AC | 71 ms | 14744 KB |
051.txt | AC | 69 ms | 14744 KB |
052.txt | AC | 43 ms | 11892 KB |
053.txt | AC | 79 ms | 14668 KB |
054.txt | AC | 78 ms | 14640 KB |
055.txt | AC | 80 ms | 14544 KB |
056.txt | AC | 81 ms | 14704 KB |
057.txt | AC | 81 ms | 14636 KB |
058.txt | AC | 81 ms | 14640 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |
example2.txt | AC | 2 ms | 256 KB |
example3.txt | AC | 2 ms | 256 KB |