Submission #945383

#TimeUsernameProblemLanguageResultExecution timeMemory
945383yeediotNecklace (Subtask 4) (BOI19_necklace4)C++14
0 / 15
166 ms612 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);} #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } struct line{ int a,b; int operator()(const int x)const{ return a*x+b; } }; bool check(line l1,line l2,line l3){ return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a); } vector<int> kmp(string s){ vector<int>res(sz(s)); for(int i=1,j=0;i<sz(s);i++){ while(j and s[i]!=s[j])j=res[j-1]; if(s[i]==s[j])j++; res[i]=j; } return res; } signed main(){ setio(); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); string s,t; cin>>s>>t; int n=sz(s),m=sz(t); tuple<int,int,int>ans={0,0,0}; for(int i=0;i<n;i++){ string s1=s.substr(0,i),s2=s.substr(i,n-i); reverse(all(s1)); string t1=t,t2=t; reverse(all(t2)); vector<int>p1=kmp(s1+'#'+t1),p2=kmp(s2+'#'+t2); for(int j=0;j<m;j++){ int x=p2[j+sz(s2)+1],y=p1[m-j-1+sz(s1)]; debug(j,x,y); ans=max(ans,{x+y,i-y,j-x+1}); } } reverse(all(t)); for(int i=0;i<n;i++){ string s1=s.substr(0,i),s2=s.substr(i,n-i); reverse(all(s1)); string t1=t,t2=t; reverse(all(t2)); vector<int>p1=kmp(s1+'#'+t1),p2=kmp(s2+'#'+t2); for(int j=0;j<m;j++){ int x=p2[j+sz(s2)+1],y=p1[m-j-1+sz(s1)]; debug(i,j,x,y); ans=max(ans,{x+y,i-y,m-(j+y)-1}); } } cout<<get<0>(ans)<<'\n'<<get<1>(ans)<<' '<<get<2>(ans)<<'\n'; } /* input: zxyabcd ztcdabxy */

Compilation message (stderr)

necklace.cpp: In function 'void setIO(std::string)':
necklace.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
necklace.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...