oj.uz

Submission #422858

# Submission time Handle Problem Language Result Execution time Memory
422858 2021-06-10T13:10:35 Z abdzag Necklace (Subtask 1-3) (BOI19_necklace1) C++17
5 / 85
 100 ms 71004 KB 
#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 1e15;

int main() {
	cin.sync_with_stdio(false);
	string a, b;
	cin >> a >> b;
	ll ans = 0;
	ll pos1, pos2;
	vector<vector<ll>> v(3001, vector<ll>(3001));
	rep(i, 0, b.size()) {
		ll counter = 0;
		rep(j, 1, a.size()+1) {
			if (b[i+counter] == a[j-1])v[i][j] = ++counter;
			else counter = 0;
		}
	}
	rep(i, 0, a.size()) {
		ll counter = 0;
		rep(j, 1, b.size() + 1) {
			if (a[i + counter] == b[j-1])counter++;
			else counter = 0;
			if (ans < counter + v[j][i]) {
				ans = counter + v[j][i];
				pos1 = i - v[j][i];
				pos2 = j - counter;
			}
		}
	}
	reverse(all(a));
	v.clear();
	v.resize(3001, vector<ll>(3001, 0));
	rep(i, 0, b.size()) {
		ll counter = 0;
		rep(j, 1, a.size() + 1) {
			if (b[i + counter] == a[j - 1])v[i][j] = ++counter;
			else {
				counter--;
				while (b[i + counter] != a[j - 1]&&counter)counter--;
				if (b[i + counter] == a[j - 1])v[i][j] = ++counter;
			}
		}
	}
	rep(i, 0, a.size()) {
		ll counter = 0;
		rep(j, 1, b.size() + 1) {
			if (a[i + counter] == b[j - 1])counter++;
			else counter = 0;
			if (ans < counter + v[j][i]) {
				ans = counter + v[j][i];
				pos1 = a.size()-i - counter;
				pos2 = j - counter;
			}
		}
	}
	cout << ans << endl;
	if (ans)cout << pos1 << " " << pos2;
	return 0;
}

Subtask #1
5.0 / 25.0

# Verdict Execution time Memory Grader output
1 Partially correct 82 ms 70852 KB Output is partially correct
2 Partially correct 100 ms 70864 KB Output is partially correct
3 Partially correct 77 ms 70888 KB Output is partially correct
4 Correct 77 ms 71000 KB Output is correct
5 Correct 75 ms 70880 KB Output is correct

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 82 ms 70852 KB Output is partially correct
2 Partially correct 100 ms 70864 KB Output is partially correct
3 Partially correct 77 ms 70888 KB Output is partially correct
4 Correct 77 ms 71000 KB Output is correct
5 Correct 75 ms 70880 KB Output is correct
6 Partially correct 76 ms 70912 KB Output is partially correct
7 Partially correct 79 ms 70864 KB Output is partially correct
8 Correct 85 ms 70872 KB Output is correct
9 Correct 78 ms 70920 KB Output is correct
10 Incorrect 76 ms 71004 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 82 ms 70852 KB Output is partially correct
2 Partially correct 100 ms 70864 KB Output is partially correct
3 Partially correct 77 ms 70888 KB Output is partially correct
4 Correct 77 ms 71000 KB Output is correct
5 Correct 75 ms 70880 KB Output is correct
6 Partially correct 76 ms 70912 KB Output is partially correct
7 Partially correct 79 ms 70864 KB Output is partially correct
8 Correct 85 ms 70872 KB Output is correct
9 Correct 78 ms 70920 KB Output is correct
10 Incorrect 76 ms 71004 KB Output isn't correct
11 Halted 0 ms 0 KB -