Submission #1694995


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int MAX_N = 1000005;

char S[MAX_N], T[MAX_N];
int N, pos[MAX_N], R[MAX_N], f[MAX_N];

int main() {
  scanf("%d%s%s", &N, S + 1, T + 1);
  int l = 0, r = N, res = 0;
  
  for (int i = N, l = N; i; --i) {
    if (l > i) l = i;
    while (l > 0 && S[l] != T[i]) l--;
    pos[i] = l;
  }

  for (int i = 1; i <= N; ++i)
    R[pos[i]] = i;
  
  if (R[0]) {
    puts("-1");
    return 0;
  }

  for (int i = N; i; --i) 
    if (R[i] > i) f[i]++, f[R[i] + 1]--;
  for (int i = 1; i <= N; ++i) {
    f[i] += f[i - 1];
    res = max(res, f[i]);
  }

  printf("%d\n", res);
  return 0;
}

Submission Info

Submission Time
Task F - Shik and Copying String
User kiiiiii
Language C++14 (GCC 5.4.1)
Score 0
Code Size 703 Byte
Status WA
Exec Time 24 ms
Memory 13824 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%s%s", &N, S + 1, T + 1);
                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 4
AC × 33
WA × 30
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 2 ms 6272 KB
001.txt AC 2 ms 6272 KB
002.txt AC 2 ms 6272 KB
003.txt AC 2 ms 6272 KB
004.txt AC 2 ms 6272 KB
005.txt AC 2 ms 6272 KB
006.txt AC 2 ms 6272 KB
007.txt AC 2 ms 6272 KB
008.txt AC 2 ms 6272 KB
009.txt AC 2 ms 6272 KB
010.txt WA 2 ms 6272 KB
011.txt AC 2 ms 6272 KB
012.txt WA 2 ms 6272 KB
013.txt WA 2 ms 6272 KB
014.txt AC 2 ms 6272 KB
015.txt AC 2 ms 6272 KB
016.txt AC 2 ms 6272 KB
017.txt AC 2 ms 6272 KB
018.txt WA 2 ms 6272 KB
019.txt AC 2 ms 6272 KB
020.txt AC 2 ms 6272 KB
021.txt AC 2 ms 6272 KB
022.txt AC 2 ms 6272 KB
023.txt WA 2 ms 6272 KB
024.txt WA 2 ms 6272 KB
025.txt AC 14 ms 13824 KB
026.txt WA 15 ms 13824 KB
027.txt AC 15 ms 13824 KB
028.txt WA 24 ms 13824 KB
029.txt WA 24 ms 13824 KB
030.txt WA 15 ms 13824 KB
031.txt AC 16 ms 13824 KB
032.txt AC 17 ms 13824 KB
033.txt WA 17 ms 13824 KB
034.txt AC 17 ms 13824 KB
035.txt WA 17 ms 13824 KB
036.txt AC 17 ms 13824 KB
037.txt AC 17 ms 13824 KB
038.txt WA 16 ms 13824 KB
039.txt WA 16 ms 13824 KB
040.txt WA 22 ms 13824 KB
041.txt WA 20 ms 13824 KB
042.txt WA 16 ms 13824 KB
043.txt WA 16 ms 13824 KB
044.txt WA 15 ms 13824 KB
045.txt WA 15 ms 13824 KB
046.txt WA 15 ms 13824 KB
047.txt WA 15 ms 13824 KB
048.txt WA 15 ms 13824 KB
049.txt WA 15 ms 13824 KB
050.txt AC 11 ms 11776 KB
051.txt AC 11 ms 11776 KB
052.txt AC 11 ms 11776 KB
053.txt WA 19 ms 13824 KB
054.txt WA 19 ms 13824 KB
055.txt WA 19 ms 13824 KB
056.txt WA 19 ms 13824 KB
057.txt WA 19 ms 13824 KB
058.txt WA 19 ms 13824 KB
example0.txt AC 2 ms 6272 KB
example1.txt AC 2 ms 6272 KB
example2.txt AC 2 ms 6272 KB
example3.txt AC 2 ms 6272 KB