제출 #418676

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
418676		abdzag	Necklace (Subtask 1-3) (BOI19_necklace1)	C++17	0 / 85	258 ms	204 KiB

necklace

#include<bits/stdc++.h>
//#include"tickets.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>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int inf = 1e9;

using namespace std;
string s;
string s2;
string s3;
ll compare(ll start, ll end) {
	bool ans = false;
	ll res = -1;
	rep(i, 0, s.size() - (end - start) + 1) {
		rep(j, 0, end-start) {
			bool done = true;
			rep(z, 0, end - start) {
				if (s2[start+((j+z) % (end - start))] != s[i + z]) {
					done = false;
					break;
				}
			}
			if (done) {
				ans = true;
				res = i;
				break;
			}
		}
		if (ans)break;

		rep(j, 0, end - start) {
			bool done = true;
			rep(z, 0, end - start) {
				if (s3[(start)+((j+z) % (end - start))] != s[i + z]) {
					done = false;
					break;
				}
			}
			if (done) {
				ans = true;
				res = i;
				break;
			}
		}
		if (ans)break;
	}
	return res;
}
int main() {
	cin.sync_with_stdio(false);
	cin >> s >> s2;
	s3 = s2;
	reverse(all(s3));
	pair<ll, pair<ll, ll>> res = make_pair(-inf, make_pair(-inf, -inf));
	rep(i,0,s.size()) {
		rep(j, i + 1, s.size()) {
			pair<ll, ll> best = make_pair(0, 0);
			ll val = compare(i, j);
			if (val != -1) {
				best = make_pair(j - i, val);
			}
			if (res.first < best.first) {
				res.first = best.first;
				res.second.first = i;
				res.second.second = best.second;
			}
		}
	}
	cout << res.first << endl;
	cout << res.second.first << " " << res.second.second << endl;
	return 0;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 20
• Subtask 3: 0 / 40