Submission #1775319
Source Code Expand
#include <cstdio> #include <vector> #include <set> #include <cstdlib> using namespace std; #define mp make_pair //1-origin template <typename T> struct FenwickTree { vector<T> data; FenwickTree(int n) : data(n + 1, 0) {} //data[i] += x void add(int i, T x){ while (i <= (int)data.size()) { data[i] += x; i += i & -i; } } //[1, i) T sum(int i){ T res = 0; while (i > 0) { res += data[i]; i -= i & -i; } return res; } //[l, r) T sum(int l, int r) { return sum(r) - sum(l); } }; long long InversionNumber(const vector<int> &a) { FenwickTree<long long> ft(300030); long long res = 0; for (int i = 0; i < a.size(); i ++) { res += i - ft.sum(a[i]); ft.add(a[i], 1); } return res; } int main() { int n; scanf("%d", &n); vector<vector<int>> a(3, vector<int> (n)); for (int i = 0; i < 3; i ++) for (int j = 0; j < n; j ++) scanf("%d", &a[i][j]); vector<vector<int>> b(n, vector<int> (3)); for (int i = 0; i < 3; i ++) for (int j = 0; j < n; j ++) b[j][i] = a[i][j]; multiset<pair<pair<int, int>, int>> st; for (int i = 0; i < n; i ++) st.insert(mp(mp(b[i][0], b[i][1]), b[i][2])); for (int i = 1; i < 3 * n; i += 3) { int a = i, b = i + 1, c = i + 2; if (!((st.count(mp(mp(a, b), c)) == 0 && st.count(mp(mp(c, b), a)) == 1) || (st.count(mp(mp(a, b), c)) == 1 && st.count(mp(mp(c, b), a)) == 0))) { return !puts("No"); } } vector<int> c(n); for (int i = 0; i < n; i ++) { c[i] = b[i][1] / 3 + 1; if (b[i][0] > b[i][2]) c[i] *= -1; } vector<int> target(n); for (int i = 0; i < n; i ++) target[i] = i + 1; for (int i = 3; i < n; i += 4) { c[i] *= -1, target[i] *= -1; c[i - 1] *= -1, target[i - 1] *= -1; } set<int> evenst; for (int i = 0; i < n; i += 2) evenst.insert(abs(c[i])); for (int i = 0; i < n; i += 2) if (evenst.count(abs(target[i])) != 1) return !puts("No"); evenst.clear(); int flip_even = 0, flip_odd = 0; for (int i = 0; i < n; i += 2) evenst.insert(c[i]); for (int i = 0; i < n; i += 2) if (!evenst.count(target[i])) flip_even ++; set<int> oddst; for (int i = 1; i < n; i += 2) oddst.insert(c[i]); for (int i = 1; i < n; i += 2) if (!oddst.count(target[i])) flip_odd ++; vector<int> even, odd; for (int i = 0; i < n; i ++) { if (i & 1) odd.push_back(abs(c[i])); else even.push_back(abs(c[i])); } auto even_rev = InversionNumber(even); auto odd_rev = InversionNumber(odd); puts((flip_even % 2 == odd_rev % 2 && flip_odd % 2 == even_rev % 2) ? "Yes" : "No"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Rotate 3x3 |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 1500 |
Code Size | 3269 Byte |
Status | AC |
Exec Time | 176 ms |
Memory | 21708 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:45:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:47:88: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < 3; i ++) for (int j = 0; j < n; j ++) scanf("%d", &a[i][j]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1500 / 1500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt, 1_71.txt, 1_72.txt, 1_73.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 3 ms | 2644 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 3 ms | 2644 KB |
0_03.txt | AC | 3 ms | 2644 KB |
0_04.txt | AC | 3 ms | 2644 KB |
1_00.txt | AC | 176 ms | 21708 KB |
1_01.txt | AC | 72 ms | 13176 KB |
1_02.txt | AC | 73 ms | 13176 KB |
1_03.txt | AC | 72 ms | 13176 KB |
1_04.txt | AC | 73 ms | 13176 KB |
1_05.txt | AC | 169 ms | 21708 KB |
1_06.txt | AC | 72 ms | 13176 KB |
1_07.txt | AC | 72 ms | 13176 KB |
1_08.txt | AC | 72 ms | 13176 KB |
1_09.txt | AC | 123 ms | 16248 KB |
1_10.txt | AC | 3 ms | 2644 KB |
1_11.txt | AC | 2 ms | 2644 KB |
1_12.txt | AC | 3 ms | 2644 KB |
1_13.txt | AC | 3 ms | 2644 KB |
1_14.txt | AC | 3 ms | 2644 KB |
1_15.txt | AC | 3 ms | 2644 KB |
1_16.txt | AC | 3 ms | 2644 KB |
1_17.txt | AC | 3 ms | 2644 KB |
1_18.txt | AC | 3 ms | 2644 KB |
1_19.txt | AC | 3 ms | 2644 KB |
1_20.txt | AC | 2 ms | 2644 KB |
1_21.txt | AC | 3 ms | 2644 KB |
1_22.txt | AC | 3 ms | 2644 KB |
1_23.txt | AC | 3 ms | 2644 KB |
1_24.txt | AC | 3 ms | 2644 KB |
1_25.txt | AC | 3 ms | 2644 KB |
1_26.txt | AC | 155 ms | 21708 KB |
1_27.txt | AC | 158 ms | 21708 KB |
1_28.txt | AC | 158 ms | 21708 KB |
1_29.txt | AC | 160 ms | 21708 KB |
1_30.txt | AC | 160 ms | 21708 KB |
1_31.txt | AC | 167 ms | 21708 KB |
1_32.txt | AC | 169 ms | 21708 KB |
1_33.txt | AC | 158 ms | 21708 KB |
1_34.txt | AC | 159 ms | 21708 KB |
1_35.txt | AC | 161 ms | 21708 KB |
1_36.txt | AC | 161 ms | 21708 KB |
1_37.txt | AC | 162 ms | 21708 KB |
1_38.txt | AC | 157 ms | 21708 KB |
1_39.txt | AC | 159 ms | 21708 KB |
1_40.txt | AC | 156 ms | 21708 KB |
1_41.txt | AC | 158 ms | 21708 KB |
1_42.txt | AC | 154 ms | 21376 KB |
1_43.txt | AC | 159 ms | 21708 KB |
1_44.txt | AC | 156 ms | 21708 KB |
1_45.txt | AC | 151 ms | 21624 KB |
1_46.txt | AC | 161 ms | 21624 KB |
1_47.txt | AC | 158 ms | 21500 KB |
1_48.txt | AC | 158 ms | 21708 KB |
1_49.txt | AC | 160 ms | 21584 KB |
1_50.txt | AC | 151 ms | 21500 KB |
1_51.txt | AC | 145 ms | 20996 KB |
1_52.txt | AC | 152 ms | 21708 KB |
1_53.txt | AC | 149 ms | 21584 KB |
1_54.txt | AC | 149 ms | 21500 KB |
1_55.txt | AC | 146 ms | 21124 KB |
1_56.txt | AC | 149 ms | 21708 KB |
1_57.txt | AC | 154 ms | 21624 KB |
1_58.txt | AC | 72 ms | 13048 KB |
1_59.txt | AC | 104 ms | 16248 KB |
1_60.txt | AC | 76 ms | 13048 KB |
1_61.txt | AC | 72 ms | 13048 KB |
1_62.txt | AC | 73 ms | 13176 KB |
1_63.txt | AC | 145 ms | 20748 KB |
1_64.txt | AC | 102 ms | 16000 KB |
1_65.txt | AC | 152 ms | 21456 KB |
1_66.txt | AC | 70 ms | 12924 KB |
1_67.txt | AC | 74 ms | 12928 KB |
1_68.txt | AC | 108 ms | 16248 KB |
1_69.txt | AC | 107 ms | 16120 KB |
1_70.txt | AC | 103 ms | 16124 KB |
1_71.txt | AC | 109 ms | 16248 KB |
1_72.txt | AC | 149 ms | 21372 KB |
1_73.txt | AC | 152 ms | 21372 KB |