# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
661326 | 2022-11-25T13:56:09 Z | Trisanu_Das | Lozinke (COCI17_lozinke) | C++17 | 345 ms | 32196 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; string a[n]; set<string> s; map<string, int> mp; for(int i = 0; i < n; i++){ cin >> a[i]; for(int j = 0; j < a[i].size(); j++){ string ss; for(int k = j; k < a[i].size(); k++){ ss += a[i][k]; s.insert(ss); } } } int ans = 0; for(string ss : s) mp[ss]++; for(auto ss : mp) ans += ss.second; cout << ans - n << '\n'; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Incorrect | 1 ms | 340 KB | Output isn't correct |
4 | Incorrect | 1 ms | 340 KB | Output isn't correct |
5 | Incorrect | 6 ms | 1108 KB | Output isn't correct |
6 | Incorrect | 9 ms | 980 KB | Output isn't correct |
7 | Incorrect | 17 ms | 2640 KB | Output isn't correct |
8 | Incorrect | 25 ms | 4260 KB | Output isn't correct |
9 | Incorrect | 51 ms | 4172 KB | Output isn't correct |
10 | Incorrect | 128 ms | 14312 KB | Output isn't correct |
11 | Incorrect | 81 ms | 7736 KB | Output isn't correct |
12 | Incorrect | 320 ms | 32196 KB | Output isn't correct |
13 | Incorrect | 142 ms | 4552 KB | Output isn't correct |
14 | Incorrect | 235 ms | 28964 KB | Output isn't correct |
15 | Incorrect | 345 ms | 31956 KB | Output isn't correct |
16 | Incorrect | 116 ms | 1404 KB | Output isn't correct |
17 | Incorrect | 39 ms | 1108 KB | Output isn't correct |
18 | Incorrect | 28 ms | 980 KB | Output isn't correct |
19 | Incorrect | 190 ms | 16184 KB | Output isn't correct |
20 | Incorrect | 55 ms | 1228 KB | Output isn't correct |