oj.uz

답안 #85414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
85414 2018-11-19T19:59:59 Z MohamedAhmed0 Lozinke (COCI17_lozinke) C++14
100 / 100
 528 ms 17624 KB 
/* Author : Mohamed Ahmed
   we should sort strings according to their size
   after that since that strings at most 10 letters so we can make map
   to store number of times that string occur and handle case if there's strings that equal
   and make another map to store number of times of substrings to handle case if there's two substrings equal
   and there's string equal to them so don't count it more than one and add to answer number of strings that same as this substring
   and after that increase number of times that current string appear
*/

#include <bits/stdc++.h>

using namespace std;

bool cmp(string &s , string &s1)
{
    return s.size() < s1.size() ;
}

int main()
{
    int n ;
    cin>>n ;
    string arr[n] ;
    for(int i = 0 ; i < n ; ++i)
        cin>>arr[i] ;
    sort(arr , arr + n , cmp) ;
    long long ans = 0ll ;
    map<string , int>mp ;
    for(int i = 0 ; i < n ; ++i)
    {
        string s = arr[i] ;
        map<string , int>mp2 ;
        ans += mp[s] ;
        for(int j = 0 ; j < s.size() ; ++j)
        {
            string s1 = "" ;
            for(int k = j ; k < s.size() ; ++k)
            {
                 s1 += s[k] ;
                 if(mp2[s1] != 1)
                    ans += mp[s1] * 1ll ;
                 mp2[s1] = 1 ;
            }
        }
        mp[s]++;
    }
    return cout<<ans , 0 ;
}

Compilation message

lozinke.cpp: In function 'int main()':
lozinke.cpp:34:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0 ; j < s.size() ; ++j)
                         ~~^~~~~~~~~~
lozinke.cpp:37:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k = j ; k < s.size() ; ++k)
                             ~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 13 ms 856 KB Output is correct
6 Correct 22 ms 864 KB Output is correct
7 Correct 26 ms 1560 KB Output is correct
8 Correct 49 ms 2732 KB Output is correct
9 Correct 113 ms 2764 KB Output is correct
10 Correct 228 ms 7952 KB Output is correct
11 Correct 183 ms 7952 KB Output is correct
12 Correct 528 ms 17224 KB Output is correct
13 Correct 338 ms 17224 KB Output is correct
14 Correct 338 ms 17224 KB Output is correct
15 Correct 520 ms 17624 KB Output is correct
16 Correct 390 ms 17624 KB Output is correct
17 Correct 92 ms 17624 KB Output is correct
18 Correct 66 ms 17624 KB Output is correct
19 Correct 335 ms 17624 KB Output is correct
20 Correct 162 ms 17624 KB Output is correct