제출 #315208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
315208		Kesatria_Komodo	Lozinke (COCI17_lozinke)	C++17	100 / 100	312 ms	15548 KiB

lozinke

#include <iostream>
#include <unordered_map>
using namespace std;
int main(){
    int N , ans = 0;
    unordered_map<string , int> mp;
    cin >> N;
    string arr[N];
    for (int i = 0 ; i < N ; i++)
        cin >> arr[i] , ++mp[arr[i]];

    for  (int i = 0 ; i < N ; i++){
        unordered_map<string , bool> computed;
        for (int k = 0 ; k < arr[i].size() ; k++){
            string now = "";
            for (int l = k ; l < arr[i].size() ; l++){
                now.push_back(arr[i][l]);
                bool &it = computed[now];
                if (it)
                    continue;
                it = 1 , ans += mp[now];
            }
        }
    }
    cout << ans - N << endl;
}

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

lozinke.cpp: In function 'int main()':
lozinke.cpp:14:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         for (int k = 0 ; k < arr[i].size() ; k++){
      |                          ~~^~~~~~~~~~~~~~~
lozinke.cpp:16:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |             for (int l = k ; l < arr[i].size() ; l++){
      |                              ~~^~~~~~~~~~~~~~~

• Subtask 1: 100 / 100