제출 #138622

#제출 시각아이디문제언어결과실행 시간메모리
138622KCSCLozinke (COCI17_lozinke)C++14
90 / 100
1073 ms16696 KiB
#include <bits/stdc++.h> using namespace std; const int DIM = 20005; string str[DIM]; map<string, int> mmp; void solve(int n, int &ans) { mmp.clear(); for (int i = 1; i <= n; ++i) { ans += mmp[str[i]]; set<string> mst; for (int p1 = 0; p1 < str[i].length(); ++p1) for (int p2 = p1; p2 < str[i].length(); ++p2) mst.insert(str[i].substr(p1, p2 - p1 + 1)); for (string s : mst) mmp[s]++; } } int main(void) { #ifdef HOME freopen("lozinke.in", "r", stdin); freopen("lozinke.out", "w", stdout); #endif int n; cin >> n; for (int i = 1; i <= n; ++i) cin >> str[i]; int ans = 0; solve(n, ans); reverse(str + 1, str + n + 1); solve(n, ans); cout << ans; return 0; }

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

lozinke.cpp: In function 'void solve(int, int&)':
lozinke.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int p1 = 0; p1 < str[i].length(); ++p1)
                    ~~~^~~~~~~~~~~~~~~~~
lozinke.cpp:15:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int p2 = p1; p2 < str[i].length(); ++p2)
                      ~~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...