제출 #639994

#제출 시각아이디문제언어결과실행 시간메모리
639994IWTIMSavez (COCI15_savez)C++17
컴파일 에러
0 ms0 KiB
# include <bits/stdc++.h> using namespace std; using ll = long long; using db = long double; // or double, if TL is tight using str = string; // yay python! // pairs using pii = pair<int,int>; using pl = pair<ll,ll>; using pd = pair<db,db>; #define mp make_pair #define f first #define s second #define tcT template<class T #define tcTU tcT, class U // ^ lol this makes everything look weird but I'll try it tcT> using V = vector<T>; tcT, size_t SZ> using AR = array<T,SZ>; using vi = V<int>; using vb = V<bool>; using vl = V<ll>; using vd = V<db>; using vs = V<str>; using vpi = V<pii>; using vpl = V<pl>; using vpd = V<pd>; // vectors // oops size(x), rbegin(x), rend(x) need C++17 #define sz(x) int((x).size()) #define bg(x) begin(x) #define all(x) bg(x), end(x) #define rall(x) x.rbegin(), x.rend() #define sor(x) sort(all(x)) #define rsz resize #define ins insert #define pb push_back #define eb emplace_back #define ft front() #define bk back() #define lb lower_bound #define ub upper_bound #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define rep(a) F0R(_,a) #define each(a,x) for (auto& a: x) const int mod = 998244353; const int MX = 2e5+5; const ll BIG = 1e18; // not too close to LLONG_MAX const db PI = acos((db)-1); const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!! mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>; struct DSU { vi e; void init(int N) { e = vi(N,-1); } int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } bool sameSet(int a, int b) { return get(a) == get(b); } int size(int x) { return -e[get(x)]; } bool unite(int x, int y) { // union by size x = get(x), y = get(y); if (x == y) return 0; if (e[x] > e[y]) swap(x,y); e[x] += e[y]; e[y] = x; return 1; } }; /* inline namespace Helpers { //////////// is_iterable // https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable // this gets used only when we can call begin() and end() on that type tcT, class = void> struct is_iterable : false_type {}; tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())), decltype(end(declval<T>())) > > : true_type {}; tcT> constexpr bool is_iterable_v = is_iterable<T>::value; //////////// is_readable tcT, class = void> struct is_readable : false_type {}; tcT> struct is_readable<T, typename std::enable_if_t< is_same_v<decltype(cin >> declval<T&>()), istream&> > > : true_type {}; tcT> constexpr bool is_readable_v = is_readable<T>::value; //////////// is_printable // // https://nafe.es/posts/2020-02-29-is-printable/ tcT, class = void> struct is_printable : false_type {}; tcT> struct is_printable<T, typename std::enable_if_t< is_same_v<decltype(cout << declval<T>()), ostream&> > > : true_type {}; tcT> constexpr bool is_printable_v = is_printable<T>::value; }*/ using ll = long long; using db = long double; // or double, if TL is tight using str = string; // yay python! // pairs using pii = pair<int,int>; using pl = pair<ll,ll>; using pd = pair<db,db>; #define mp make_pair #define f first #define s second #define tcT template<class T #define tcTU tcT, class U // ^ lol this makes everything look weird but I'll try it tcT> using V = vector<T>; tcT, size_t SZ> using AR = array<T,SZ>; using vi = V<int>; using vb = V<bool>; using vl = V<ll>; using vd = V<db>; using vs = V<str>; using vpi = V<pii>; using vpl = V<pl>; using vpd = V<pd>; // vectors // oops size(x), rbegin(x), rend(x) need C++17 #define sz(x) int((x).size()) #define bg(x) begin(x) #define all(x) bg(x), end(x) #define rall(x) x.rbegin(), x.rend() #define sor(x) sort(all(x)) #define rsz resize #define ins insert #define pb push_back #define eb emplace_back #define ft front() #define bk back() #define lb lower_bound #define ub upper_bound #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define rep(a) F0R(_,a) #define each(a,x) for (auto& a: x) template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>; /* inline namespace Helpers { //////////// is_iterable // https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable // this gets used only when we can call begin() and end() on that type tcT, class = void> struct is_iterable : false_type {}; tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())), decltype(end(declval<T>())) > > : true_type {}; tcT> constexpr bool is_iterable_v = is_iterable<T>::value; //////////// is_readable tcT, class = void> struct is_readable : false_type {}; tcT> struct is_readable<T, typename std::enable_if_t< is_same_v<decltype(cin >> declval<T&>()), istream&> > > : true_type {}; tcT> constexpr bool is_readable_v = is_readable<T>::value; //////////// is_printable // // https://nafe.es/posts/2020-02-29-is-printable/ tcT, class = void> struct is_printable : false_type {}; tcT> struct is_printable<T, typename std::enable_if_t< is_same_v<decltype(cout << declval<T>()), ostream&> > > : true_type {}; tcT> constexpr bool is_printable_v = is_printable<T>::value; }*/ #define int long long int t,n,a[MX],hs[MX],pw[MX],z[MX]; string s; map <int, int> mp; int f_p(int baz, int pou){ int otv = 1; while (pou > 0) { if (pou % 2) otv = (otv * baz) % mod; baz = (baz * baz) % mod; pou /= 2; } return otv; } int get(char ch) { return (ch - 'A' + 1); } int geth(int le, int ri) { return (hs[ri] - hs[le - 1] + mod)*f_p(pw[le], mod - 2) % mod; } main() { ios_base::sync_with_stdio(false), cin.tie(NULL),cout.tie(NULL); cin>>n; pw[0] = 1; for (int i = 1; i < N; i++) { pw[i] = pw[i - 1] * 31 % mod; } int ans = 1; for (int i = 1; i <= n; i++) { cin>>s; int curhs = 0; int sz = (int)s.size(); for (int j = 0; j < sz; j++) { curhs += pw[j]*get(s[j]); curhs %= mod; hs[j] = curhs; } int l = 0, r = 0; for (int j = 1; j < sz; j++) { if (j <= r) { z[j] = min(r - j + 1, z[j - l]); } while (j + z[j] < sz && s[z[j]] == s[z[j] + j]) { z[j]++; } if (j + z[j] - 1 > r) { l = j; r = j + z[j] - 1; } } z[0] = s.size(); int mx = 1; for (int i = 0; i < sz; i++) { if (z[i] == (int)sz - i) { mx = max(mx, mp[geth(i, sz - 1)] + 1); } } ans = max(ans, mx); mp[hs[sz - 1]] = mx; } cout<<ans<<"\n"; }

컴파일 시 표준 에러 (stderr) 메시지

savez.cpp:200:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  200 | main() {
      | ^~~~
savez.cpp: In function 'int main()':
savez.cpp:205:25: error: 'N' was not declared in this scope
  205 |     for (int i = 1; i < N; i++) {
      |                         ^
savez.cpp:108:12: error: reference to 'make_pair' is ambiguous
  108 | #define mp make_pair
      |            ^~~~~~~~~
savez.cpp:233:18: note: in expansion of macro 'mp'
  233 |     mx = max(mx, mp[geth(i, sz - 1)] + 1);
      |                  ^~
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from savez.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:567:5: note: candidates are: 'template<class _T1, class _T2> constexpr std::pair<typename std::__strip_reference_wrapper<typename std::decay<_Tp>::type>::__type, typename std::__strip_reference_wrapper<typename std::decay<_Tp2>::type>::__type> std::make_pair(_T1&&, _T2&&)'
  567 |     make_pair(_T1&& __x, _T2&& __y)
      |     ^~~~~~~~~
savez.cpp:108:12: note:                 'std::map<long long int, long long int> make_pair'
  108 | #define mp make_pair
      |            ^~~~~~~~~
savez.cpp:184:16: note: in expansion of macro 'mp'
  184 | map <int, int> mp;
      |                ^~
savez.cpp:108:12: error: reference to 'make_pair' is ambiguous
  108 | #define mp make_pair
      |            ^~~~~~~~~
savez.cpp:237:3: note: in expansion of macro 'mp'
  237 |   mp[hs[sz - 1]] = mx;
      |   ^~
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from savez.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:567:5: note: candidates are: 'template<class _T1, class _T2> constexpr std::pair<typename std::__strip_reference_wrapper<typename std::decay<_Tp>::type>::__type, typename std::__strip_reference_wrapper<typename std::decay<_Tp2>::type>::__type> std::make_pair(_T1&&, _T2&&)'
  567 |     make_pair(_T1&& __x, _T2&& __y)
      |     ^~~~~~~~~
savez.cpp:108:12: note:                 'std::map<long long int, long long int> make_pair'
  108 | #define mp make_pair
      |            ^~~~~~~~~
savez.cpp:184:16: note: in expansion of macro 'mp'
  184 | map <int, int> mp;
      |                ^~