# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257077 | zoooma13 | Necklace (Subtask 1-3) (BOI19_necklace1) | C++14 | 302 ms | 36088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |