oj.uz

답안 #140685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
140685 2019-08-04T13:38:27 Z AlexPascu007 Lozinke (COCI17_lozinke) C++
100 / 100
 262 ms 2552 KB 
#include <iostream>
#include <map>
#include <string>
#include <set>
#include <algorithm>
using namespace std;
map<string, int> m;
string s[20010],sc;
set<string> st;
int cmp(string a,string b) {
    if (a.size()!=b.size())
        return a.size()<b.size();
    else
        return a<b;
}
int n,i,j,k,sol;
int main() {
    cin>>n;
    for (i=1;i<=n;i++)
        cin>>s[i];
    sort(s+1,s+n+1,cmp);
    for (i=1;i<=n;i++) {
        st.clear();
        for (j=0;j<s[i].size();j++) {
            sc.erase(sc.begin(),sc.end());
            for (k=j;k<s[i].size();k++) {
                sc.push_back(s[i][k]);
                st.insert(sc);
            }
        }
        for (set<string>:: iterator it=st.begin();it!=st.end();it++)
            if (m.find(*it)!=m.end())
                sol+=m[*it];
            if (m.find(s[i])==m.end())
                m[s[i]]=1;
            else
                m[s[i]]++;
    }
    int l=1;
    for (i=2;i<=n;i++) {
        if (s[i]==s[i-1])
            l++;
        else
            l=1;
        sol+=l-1;
    }
    cout<<sol;
    return 0;
}

Compilation message

lozinke.cpp: In function 'int main()':
lozinke.cpp:24:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j=0;j<s[i].size();j++) {
                  ~^~~~~~~~~~~~
lozinke.cpp:26:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (k=j;k<s[i].size();k++) {
                      ~^~~~~~~~~~~~
lozinke.cpp:31:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         for (set<string>:: iterator it=st.begin();it!=st.end();it++)
         ^~~
lozinke.cpp:34:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
             if (m.find(s[i])==m.end())
             ^~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 892 KB Output is correct
2 Correct 3 ms 888 KB Output is correct
3 Correct 3 ms 888 KB Output is correct
4 Correct 4 ms 988 KB Output is correct
5 Correct 11 ms 1016 KB Output is correct
6 Correct 18 ms 1016 KB Output is correct
7 Correct 21 ms 1144 KB Output is correct
8 Correct 25 ms 1144 KB Output is correct
9 Correct 97 ms 1528 KB Output is correct
10 Correct 126 ms 1528 KB Output is correct
11 Correct 152 ms 1912 KB Output is correct
12 Correct 240 ms 1916 KB Output is correct
13 Correct 242 ms 2312 KB Output is correct
14 Correct 225 ms 2552 KB Output is correct
15 Correct 262 ms 2168 KB Output is correct
16 Correct 198 ms 1272 KB Output is correct
17 Correct 81 ms 1272 KB Output is correct
18 Correct 62 ms 1144 KB Output is correct
19 Correct 221 ms 2140 KB Output is correct
20 Correct 129 ms 1272 KB Output is correct