제출 #994109

#제출 시각아이디문제언어결과실행 시간메모리
994109vjudge1Rima (COCI17_rima)C++17
28 / 140
241 ms148672 KiB
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 10; int n, sz; string S[N]; int dp[N * 10]; bool have[N * 10]; vector<pair<char, int>> g[N * 10]; void add(string s){ int cur = 0; for (int i = 0; i < s.size(); i ++){ int nxt = 0; for (auto [c, v] : g[cur]){ if (c == s[i]){ nxt = v; break; } } if (nxt){ cur = nxt; } else{ for (int j = i; j < s.size(); j ++){ sz++; g[cur].push_back({s[j], sz}); cur = sz; } break; } } have[cur] = 1; } void print(){ for (int i = 0; i <= sz; i ++){ cout << "current node = " << i << endl; for (auto [c, v] : g[i]){ cout << "child " << v << " with char " << c << endl; } } } int main(){ cin >> n; for (int i = 0; i < n; i ++){ cin >> S[i]; reverse(S[i].begin(), S[i].end()); add(S[i]); } int ans = 0; // print(); // cout << endl; for (int i = sz; i >= 0; i --){ // cout << "current node = " << i << endl; int mx1 = 0; int mx2 = 0; for (auto [c, v] : g[i]){ // cout << "going to " << v << " with char " << c << endl; if (have[v]){ if (mx2 < dp[v]) mx2 = dp[v]; if (mx1 < mx2) swap(mx1, mx2); } } dp[i] = mx1 + mx2 + have[i]; ans = max(ans, dp[i]); // cout << "Answer = " << dp[i] << endl; } cout << ans << endl; }

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

rima.cpp: In function 'void add(std::string)':
rima.cpp:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i = 0; i < s.size(); i ++){
      |                     ~~^~~~~~~~~~
rima.cpp:26:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             for (int j = i; j < s.size(); j ++){
      |                             ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...