Submission #472780

#	Time	Username	Problem	Language	Result	Execution time	Memory
472780		_L__	Lozinke (COCI17_lozinke)	C++17	100 / 100	889 ms	16452 KiB

lozinke

// This code is written by _L__
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update>;
#define endl '\n'
#define F_word ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll mod = 1e9+7, N = 1e5+300, inf = 1e18;
const ld E = 1e-6;
#define ff first
#define ss second

int main(void){
    F_word;
    int n; cin >> n;
    string arr[n];
    map<string, int> freq;
    for(int i = 0; i < n; ++i){
        cin >> arr[i];
        map<string, bool> shown;
        for(int j = 0; j < arr[i].size(); ++j){
            string s = "";
            for(int k = j; k < arr[i].size(); ++k){
                s += arr[i][k];
                if(!shown[s]){freq[s]++;shown[s] = 1;}
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < arr[i].size(); ++j){
            string s = "";
            for(int k = j; k < arr[i].size(); ++k){
                s += arr[i][k];
                freq[s]--;
            }
        }
        //if(freq[arr[i]]) cout << arr[i] << endl; 
        ans += freq[arr[i]];
        for(int j = 0; j < arr[i].size(); ++j){
            string s = "";
            for(int k = j; k < arr[i].size(); ++k){
                s += arr[i][k];
                freq[s]++;
            }
        }
    }
    cout << ans << endl;
}

Compilation message (stderr)

lozinke.cpp: In function 'int main()':
lozinke.cpp:25:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for(int j = 0; j < arr[i].size(); ++j){
      |                        ~~^~~~~~~~~~~~~~~
lozinke.cpp:27:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             for(int k = j; k < arr[i].size(); ++k){
      |                            ~~^~~~~~~~~~~~~~~
lozinke.cpp:35:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int j = 0; j < arr[i].size(); ++j){
      |                        ~~^~~~~~~~~~~~~~~
lozinke.cpp:37:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             for(int k = j; k < arr[i].size(); ++k){
      |                            ~~^~~~~~~~~~~~~~~
lozinke.cpp:44:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for(int j = 0; j < arr[i].size(); ++j){
      |                        ~~^~~~~~~~~~~~~~~
lozinke.cpp:46:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             for(int k = j; k < arr[i].size(); ++k){
      |                            ~~^~~~~~~~~~~~~~~

• Subtask 1: 100 / 100