oj.uz

Submission #928873

# Submission time Handle Problem Language Result Execution time Memory
928873 2024-02-17T07:24:53 Z KaleemRazaSyed Necklace (Subtask 1-3) (BOI19_necklace1) C++17
0 / 85
 2 ms 348 KB 
#include<bits/stdc++.h>

using namespace std;

map<string, int> mp; // the starting point of that string

int main()
{
  string s, t;
  cin >> s >> t;
  int n = s.size(), m = t.size(); 
  int mx = min(n, m);
  for(int ans = mx; ans >= 1; ans--)
    {
      for(int i = 0; i < n - ans + 1; i++)
	{
	  string v = s.substr(i, ans);
	  mp[v] = i + 1;
	  reverse(v.begin(), v.end());
	  mp[v] = i + 1;
	}
      for(int i = 0; i < m - ans + 1; i++)
	{
	  string v = t.substr(i, ans);
	  for(int j = 0; j < ans; j++)
	    {
	      if(mp.find(v) != mp.end())
		{
		 cout << ans << endl;
		 cout << mp[v] << ' ' << i + 1 << endl;
		 return 0;
		}
	      v = v.substr(1, ans) + v.substr(0, 1);
	    }
	}
      mp.clear();
    }
  return 0;
}

Subtask #1
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -