| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 477348 |
2021-10-01T18:03:04 Z |
BThero |
Cards (LMIO19_korteles) |
C++17 |
|
1000 ms |
24312 KB |
#include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
int encode(char a, char b) {
return (a - 'A') * 26 + (b - 'A');
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector<string> arr(n);
vector<int> a(n), b(n), c(n), d(n);
for (int i = 0; i < n; i++) {
string x, y;
cin >> x >> y;
arr[i] = x + y;
a[i] = encode(arr[i][0], arr[i][1]);
b[i] = encode(arr[i][0], arr[i][2]);
c[i] = encode(arr[i][1], arr[i][3]);
d[i] = encode(arr[i][2], arr[i][3]);
}
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (a[i] == d[j] || b[i] == c[j] || c[i] == b[j] || d[i] == a[j]) {
ans++;
}
}
}
cout << ans << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
316 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
316 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
1 ms |
208 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
4 ms |
336 KB |
Output is correct |
| 8 |
Correct |
7 ms |
336 KB |
Output is correct |
| 9 |
Correct |
9 ms |
336 KB |
Output is correct |
| 10 |
Correct |
7 ms |
448 KB |
Output is correct |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1087 ms |
24312 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Execution timed out |
1096 ms |
2888 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
4 ms |
336 KB |
Output is correct |
| 4 |
Correct |
7 ms |
336 KB |
Output is correct |
| 5 |
Correct |
9 ms |
336 KB |
Output is correct |
| 6 |
Correct |
7 ms |
448 KB |
Output is correct |
| 7 |
Correct |
0 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
1 ms |
316 KB |
Output is correct |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct |
| 12 |
Execution timed out |
1087 ms |
24312 KB |
Time limit exceeded |
| 13 |
Halted |
0 ms |
0 KB |
- |
