Submission #986053
Source Code Expand
#include <iostream> #include <cassert> #include <cstring> #include <cstdlib> #include <cstdio> #include <cmath> #include <ctime> #include <queue> #include <set> #include <map> #include <stack> #include <string> #include <bitset> #include <vector> #include <complex> #include <algorithm> using namespace std; typedef long long ll; typedef long double db; typedef pair<int,int> pii; typedef vector<int> vi; #define de(x) cout << #x << "=" << x << endl #define rep(i,a,b) for(int i=a;i<(b);++i) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() #define mp make_pair #define pb push_back #define fi first #define se second //aacabaab //aaaaacba // 0 0 0 0 0 0 0 0 +0 // |\ // 0 0 0 0 0 0 1 0 +1 // | |\ \ // 0 0 0 0 1 2 1 0 +2 // | | |\ \ \ // 0 0 1 2 3 2 1 0 +3 // h[i + offset] + add = H[i] const int N = 1010101; char s[N] , t[N]; int n , add[N] , h[N]; int x[N]; int main(){ scanf("%d",&n); scanf("%s%s",s + 1 , t + 1); if(strcmp(s + 1 , t + 1) == 0) return puts("0") , 0; int offset = 0 , cur = n , sum = 0; for(int i=n,j=n;i>=1;--i) if(t[i] != t[i-1]){ j = min(j , i); while(j >= 1 && s[j] != t[i]) --j; if(j == 0) return puts("-1") , 0; for(int k=cur+offset;cur>=i;) h[cur--] = sum += add[k--]; //for(int k=j;k<=i-1;++k) x[k] = x[k + 1] + 1; sum -= add[i + offset]; if(j != i){ add[i + offset]++ , add[j + offset]--; } offset++; //cout << i << " " << j << " " << offset << " " << sum << endl; } for(int k=cur+offset;cur>=1;) h[cur--] = sum += add[k--]; //rep(i,1,n+1) printf("%d%c",h[i]," \n"[i==n]); //rep(i,1,n+1) printf("%d%c",x[i]," \n"[i==n]); printf("%d\n",*max_element(h + 1 , h + n + 1) + 1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Shik and Copying String |
User | Y_UME |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 1960 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 9728 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:52:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:53:32: 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 | 3 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | AC | 3 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 3 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 3 ms | 256 KB |
009.txt | AC | 3 ms | 256 KB |
010.txt | AC | 3 ms | 256 KB |
011.txt | AC | 3 ms | 256 KB |
012.txt | AC | 3 ms | 256 KB |
013.txt | AC | 3 ms | 256 KB |
014.txt | AC | 3 ms | 256 KB |
015.txt | AC | 3 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 3 ms | 256 KB |
018.txt | AC | 3 ms | 256 KB |
019.txt | AC | 3 ms | 256 KB |
020.txt | AC | 3 ms | 256 KB |
021.txt | AC | 3 ms | 384 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 | 19 ms | 6144 KB |
027.txt | AC | 19 ms | 6144 KB |
028.txt | AC | 25 ms | 7552 KB |
029.txt | AC | 25 ms | 7552 KB |
030.txt | AC | 25 ms | 9472 KB |
031.txt | AC | 25 ms | 9600 KB |
032.txt | AC | 25 ms | 9600 KB |
033.txt | AC | 25 ms | 9600 KB |
034.txt | AC | 25 ms | 9600 KB |
035.txt | AC | 25 ms | 9600 KB |
036.txt | AC | 24 ms | 9728 KB |
037.txt | AC | 24 ms | 9728 KB |
038.txt | AC | 24 ms | 9728 KB |
039.txt | AC | 23 ms | 9600 KB |
040.txt | AC | 24 ms | 8064 KB |
041.txt | AC | 22 ms | 7296 KB |
042.txt | AC | 20 ms | 6400 KB |
043.txt | AC | 19 ms | 6272 KB |
044.txt | AC | 19 ms | 6144 KB |
045.txt | AC | 19 ms | 6144 KB |
046.txt | AC | 19 ms | 6144 KB |
047.txt | AC | 19 ms | 6144 KB |
048.txt | AC | 19 ms | 6144 KB |
049.txt | AC | 19 ms | 6144 KB |
050.txt | AC | 18 ms | 6144 KB |
051.txt | AC | 18 ms | 6144 KB |
052.txt | AC | 15 ms | 4224 KB |
053.txt | AC | 22 ms | 8064 KB |
054.txt | AC | 22 ms | 8064 KB |
055.txt | AC | 22 ms | 7296 KB |
056.txt | AC | 22 ms | 7168 KB |
057.txt | AC | 22 ms | 7168 KB |
058.txt | AC | 22 ms | 7168 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |
example2.txt | AC | 3 ms | 256 KB |
example3.txt | AC | 3 ms | 256 KB |