Submission #257077

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
2570772020-08-03 15:15:49zoooma13Necklace (Subtask 1-3) (BOI19_necklace1)C++14
17 / 85
302 ms36088 KiB
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 3003
int n ,m;
string s ,t;
int com[MAX_N][MAX_N];
int go(int i ,int j){
if(i == n || j == m)
return 0;
int&ret = com[i][j];
if(~ret)
return ret;
go(i+1 ,j);
go(i ,j+1);
if(s[i] == t[j])
return ret = 1 + go(i+1 ,j+1);
return ret = 0;
}
int main()
{
cin >> s >> t; n = s.size() ,m = t.size();
memset(com ,-1 ,sizeof com);
go(0 ,0);
pair<int ,pair <int ,int>> ans;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...