# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
116851 | 2019-06-14T02:44:11 Z | nhimnam120 | Lozinke (COCI17_lozinke) | C++14 | 1000 ms | 4336 KB |
#include<bits/stdc++.h> #define fi first #define se second using namespace std; map<string, long long> cnt; vector<pair<long long,string> > inpp; set<string> inp; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); long long n; cin >> n; for(int i=0;i<n;i++){ string a; cin >> a; cnt[a]++; inp.insert(a); } long long ans=0; for(auto x: inp){ inpp.push_back({x.size(),x}); } sort(inpp.begin(),inpp.end()); for(int i=0;i<inpp.size();i++){ long long pos=0; string a=inpp[i].se; ans=ans+(cnt[a]*(cnt[a]-1)); while(inpp[pos].fi<inpp[i].fi){ string b=inpp[pos].se; for(int k=0;k<inpp[i].fi-inpp[pos].fi+1;k++){ if(a[k]==b[0]){ long long test=0; for(int j=0;j<inpp[pos].fi;j++){ if(a[k+j]!=b[j]){ test=1; break; } } if(test==0){ ans=ans+cnt[a]*cnt[b]; break; } } } pos++; } } cout << ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 3 ms | 384 KB | Output is correct |
5 | Correct | 11 ms | 512 KB | Output is correct |
6 | Correct | 20 ms | 784 KB | Output is correct |
7 | Correct | 28 ms | 768 KB | Output is correct |
8 | Correct | 16 ms | 640 KB | Output is correct |
9 | Correct | 296 ms | 1760 KB | Output is correct |
10 | Correct | 281 ms | 1888 KB | Output is correct |
11 | Correct | 693 ms | 2616 KB | Output is correct |
12 | Correct | 531 ms | 2748 KB | Output is correct |
13 | Execution timed out | 1074 ms | 3184 KB | Time limit exceeded |
14 | Execution timed out | 1064 ms | 4336 KB | Time limit exceeded |
15 | Execution timed out | 1064 ms | 3252 KB | Time limit exceeded |
16 | Correct | 21 ms | 768 KB | Output is correct |
17 | Correct | 4 ms | 384 KB | Output is correct |
18 | Correct | 4 ms | 384 KB | Output is correct |
19 | Execution timed out | 1066 ms | 3132 KB | Time limit exceeded |
20 | Correct | 45 ms | 768 KB | Output is correct |