Submission #928053

#TimeUsernameProblemLanguageResultExecution timeMemory
928053xadLozinke (COCI17_lozinke)C++14
25 / 100
120 ms2136 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> #define nn "\n" #define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define intt int _; cin >> _; while (_--) #define emp push_back #define mod 1000000007 #define all(v) v.begin(), v.end() #define ld long double #define A first #define B second typedef long long ll; const ld eps = 1e-27; // diff between decimals 0.000000001 mt19937 mt(time(nullptr)); int fx[]={1,-1,0,0}, fy[]={0,0,1,-1}; int main() { /*freopen("measurement.in","r",stdin); freopen("measurement.out","w", stdout);*/ x_x int n; cin>>n; string ar[n]; map<string,int>mp; for (auto&i:ar) cin>>i, mp[i]++; ll ans=0; for (int i=0; i<n; i++ ){ mp[ar[i]]--; for (int j=1; j<=ar[i].size(); j++) { for (int k=0; (k+j)<=ar[i].size(); k++) { if (mp.find(ar[i].substr(k,j))!=mp.end()) ans+=mp[ar[i].substr(k,j)]; } } ++mp[ar[i]]; } cout<<ans; return 0; }

Compilation message (stderr)

lozinke.cpp: In function 'int main()':
lozinke.cpp:31:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for (int j=1; j<=ar[i].size(); j++) {
      |                       ~^~~~~~~~~~~~~~
lozinke.cpp:32:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             for (int k=0; (k+j)<=ar[i].size(); k++) {
      |                           ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...