Submission #1661850
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
const int MAX_N = 405;
typedef long long i64;
int C[MAX_N][4], N;
map<pair<pair<int, int>, pair<int, int> >, int> cnt;
void insert(int col[4]) {
static int t[4];
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) t[j] = col[(j + i) % 4];
cnt[make_pair(make_pair(t[0], t[1]), make_pair(t[2], t[3]))]++;
}
}
void substract(int col[4]) {
static int t[4];
for (int i = 0; i < 4; ++i) {
for (int j = 0; j < 4; ++j) t[j] = col[(j + i) % 4];
cnt[make_pair(make_pair(t[0], t[1]), make_pair(t[2], t[3]))]--;
}
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
for (int j = 0; j < 4; ++j)
scanf("%d", &C[i][j]);
i64 res = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j < i; ++j) {
substract(C[j]);
for (int d = 0; d < 4; ++d) {
static int t[4], A[4];
i64 num = 1;
for (int k = 0; k < 4; ++k) t[k] = C[j][((k + d) % 4) ^ 1];
for (int k = 0; k < 4; ++k) {
A[0] = C[i][(k + 1) % 4], A[1] = C[i][k];
A[3] = t[(k + 1) % 4], A[2] = t[k];
num *= cnt[make_pair(make_pair(A[0], A[1]), make_pair(A[2], A[3]))];
substract(A);
}
for (int k = 0; k < 4; ++k) {
A[0] = C[i][(k + 1) % 4], A[1] = C[i][k];
A[3] = t[(k + 1) % 4], A[2] = t[k];
insert(A);
}
res += num;
}
insert(C[j]);
}
insert(C[i]);
}
printf("%lld\n", res);
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:30:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
./Main.cpp:33:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &C[i][j]);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 900 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
1 ms |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
0_002.txt |
AC |
1 ms |
256 KB |
1_003.txt |
AC |
137 ms |
256 KB |
1_004.txt |
AC |
11 ms |
256 KB |
1_005.txt |
AC |
223 ms |
256 KB |
1_006.txt |
AC |
166 ms |
256 KB |
1_007.txt |
AC |
307 ms |
256 KB |
1_008.txt |
AC |
274 ms |
256 KB |
1_009.txt |
AC |
689 ms |
256 KB |
1_010.txt |
AC |
106 ms |
256 KB |
1_011.txt |
AC |
1439 ms |
896 KB |
1_012.txt |
AC |
9 ms |
640 KB |
1_013.txt |
TLE |
4218 ms |
228352 KB |
1_014.txt |
AC |
27 ms |
3456 KB |
1_015.txt |
TLE |
4223 ms |
301568 KB |
1_016.txt |
AC |
1092 ms |
88064 KB |
1_017.txt |
TLE |
4226 ms |
312320 KB |
1_018.txt |
TLE |
4223 ms |
302080 KB |
1_019.txt |
TLE |
4221 ms |
289408 KB |