# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
234378 |
2020-05-24T06:34:32 Z |
kartel |
Lozinke (COCI17_lozinke) |
C++14 |
|
1000 ms |
3712 KB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
string s[N];
int i, n, ans, j;
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
for (i = 1; i <= n; i++) cin >> s[i];
ans = 0;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i != j && s[j].find(s[i]) != -1) ans++;
cout << ans;
}
Compilation message
lozinke.cpp: In function 'int main()':
lozinke.cpp:47:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (i != j && s[j].find(s[i]) != -1) ans++;
~~~~~~~~~~~~~~~~^~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
3328 KB |
Output is correct |
2 |
Correct |
6 ms |
3456 KB |
Output is correct |
3 |
Correct |
7 ms |
3456 KB |
Output is correct |
4 |
Correct |
10 ms |
3456 KB |
Output is correct |
5 |
Correct |
28 ms |
3584 KB |
Output is correct |
6 |
Correct |
63 ms |
3456 KB |
Output is correct |
7 |
Correct |
81 ms |
3584 KB |
Output is correct |
8 |
Correct |
61 ms |
3576 KB |
Output is correct |
9 |
Execution timed out |
1098 ms |
3584 KB |
Time limit exceeded |
10 |
Execution timed out |
1094 ms |
3584 KB |
Time limit exceeded |
11 |
Execution timed out |
1085 ms |
3584 KB |
Time limit exceeded |
12 |
Execution timed out |
1084 ms |
3584 KB |
Time limit exceeded |
13 |
Execution timed out |
1089 ms |
3712 KB |
Time limit exceeded |
14 |
Execution timed out |
1092 ms |
3584 KB |
Time limit exceeded |
15 |
Execution timed out |
1091 ms |
3584 KB |
Time limit exceeded |
16 |
Execution timed out |
1089 ms |
3712 KB |
Time limit exceeded |
17 |
Execution timed out |
1099 ms |
3712 KB |
Time limit exceeded |
18 |
Execution timed out |
1082 ms |
3584 KB |
Time limit exceeded |
19 |
Execution timed out |
1089 ms |
3584 KB |
Time limit exceeded |
20 |
Execution timed out |
1093 ms |
3584 KB |
Time limit exceeded |