제출 #716802

#제출 시각아이디문제언어결과실행 시간메모리
716802vjudge1회문 (APIO14_palindrome)C++17
컴파일 에러
0 ms0 KiB
#include <algorithm> #include <iostream> #include <iomanip> #include <bitset> #include <cmath> #include <queue> #include <map> #include <set> using namespace std; typedef long long ll; struct segment{int l, r, id; int size(){return r-l+1;}}; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define ent "\n" const int maxn = 1e5 + 100; const ll INF = (1ll<<61); const int MOD = 1e9 + 7; const int inf = (1<<30); const int maxl = 20; const int P = 31; int n; string s; vector<kk> g[maxn]; ll pref[maxn]; ll suf[maxn]; ll pw[maxn]; int ok(int l, int r){ ll num1 = pref[r] - pref[l-1] * pw[r - l + 1] % MOD; ll num2 = suf[l] - suf[r+1] * pw[r - l + 1] % MOD; if(num1 < 0) num1 += MOD; if(num2 < 0) num2 += MOD; return num1 == num2; } void test(){ cin >> s; n = s.size(); s = '#' + s; pw[0] = 1; for(int i = 1; i <= n; i++){ pref[i] = (pref[i-1] * P + s[i] - 'a' + 1) % MOD; pw[i] = (pw[i-1] * P) % MOD; } for(int i = n; i > 0; i--){ suf[i] = (suf[i + 1] * P + s[i] - 'a' + 1) % MOD; } for(int l = 1; l <= n; l++){ for(int r = l; r <= n; r++){ if(ok(l, r)){ g[r - l + 1].push_back((pref[r] - pref[l-1] * pw[r - l + 1] % MOD + MOD) % MOD); } } } ll ans = 0; for(int i = 1; i <= n; i++){ sort(g[i].begin(), g[i].end()); int cnt = 0; for(int j = 0; j < g[i].size(); j++){ if(j == 0 || g[i][j] != g[i][j-1]) cnt = 0; cnt++; ans = max(ans, 1ll * cnt * i); } } cout << ans; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); int t; t = 1; while(t--) test(); }

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

palindrome.cpp:27:8: error: 'kk' was not declared in this scope
   27 | vector<kk> g[maxn];
      |        ^~
palindrome.cpp:27:10: error: template argument 1 is invalid
   27 | vector<kk> g[maxn];
      |          ^
palindrome.cpp:27:10: error: template argument 2 is invalid
palindrome.cpp: In function 'void test()':
palindrome.cpp:55:30: error: request for member 'push_back' in 'g[((r - l) + 1)]', which is of non-class type 'int'
   55 |                 g[r - l + 1].push_back((pref[r] - pref[l-1] * pw[r - l + 1] % MOD + MOD) % MOD);
      |                              ^~~~~~~~~
palindrome.cpp:61:19: error: request for member 'begin' in 'g[i]', which is of non-class type 'int'
   61 |         sort(g[i].begin(), g[i].end());
      |                   ^~~~~
palindrome.cpp:61:33: error: request for member 'end' in 'g[i]', which is of non-class type 'int'
   61 |         sort(g[i].begin(), g[i].end());
      |                                 ^~~
palindrome.cpp:63:33: error: request for member 'size' in 'g[i]', which is of non-class type 'int'
   63 |         for(int j = 0; j < g[i].size(); j++){
      |                                 ^~~~
palindrome.cpp:64:30: error: invalid types 'int[int]' for array subscript
   64 |             if(j == 0 || g[i][j] != g[i][j-1]) cnt = 0;
      |                              ^
palindrome.cpp:64:41: error: invalid types 'int[int]' for array subscript
   64 |             if(j == 0 || g[i][j] != g[i][j-1]) cnt = 0;
      |                                         ^