Submission #895551
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using D = double; using uint = unsigned int; #ifdef WIN32 #define LLD "%I64d" #else #define LLD "%lld" #endif #define pb push_back #define mp make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se second const int maxn = 100005; bool was[maxn]; int a[maxn]; int pos[maxn]; set<int> need[maxn]; set<int> waiting; int ans[maxn], posans[maxn]; int n, m, q; set<pair<int, int>> wass; int main() { scanf("%d%d", &n, &m); scanf("%d", &q); for (int i = 0; i < q; i++) { scanf("%d", &a[i]); a[i]--; // scanf("%d", &a[m + i]); // a[m + i]--; } // q += m; for (int i = 0; i < m; i++) was[i] = false; for (int i = 0; i < n; i++) { need[a[q - 1]].insert(i); pos[i] = 0; } ans[0] = a[q - 1]; was[a[q - 1]] = true; int anslen = 1; for (int i = q - 1; i >= 0; i--) { if (need[a[i]].size() > 0) { int wh = *need[a[i]].begin(); need[a[i]].erase(need[a[i]].begin()); pos[wh]++; if (anslen > pos[wh]) need[ans[pos[wh]]].insert(wh); else waiting.insert(wh); continue; } if (was[a[i]]) continue; ans[anslen] = a[i]; anslen++; for (auto t : waiting) { need[a[i]].insert(t); } waiting.clear(); was[a[i]] = true; { int wh = *need[a[i]].begin(); need[a[i]].erase(need[a[i]].begin()); pos[wh]++; if (anslen > pos[wh]) need[ans[pos[wh]]].insert(wh); else waiting.insert(wh); } } // cout << anslen << endl; // for (int i = 0; i < anslen; i++) cout << ans[i] << ' '; // cout << endl; // for (int i = 0; i < n; i++) cout << pos[i] << ' '; // cout << endl; for (int i = 0; i < m; i++) posans[i] = m; for (int i = 0; i < anslen; i++) posans[ans[i]] = i; for (int i = 0; i < n; i++) if (pos[i] < anslen) { // cout << i << ' ' << pos[i] << endl; int cur = 0; while (pos[i] < anslen && cur < m) { // cout << cur << ' ' << posans[cur] << ' ' << pos[i] << endl; if (wass.count({pos[i], cur})) { pos[i] = anslen; break; } wass.insert({pos[i], cur}); if (posans[cur] > pos[i]) { printf("No\n"); return 0; } else if (posans[cur] == pos[i]) { pos[i]++; cur++; } else { cur++; } } if (pos[i] < anslen) { printf("No\n"); return 0; } } printf("Yes\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - LRU Puzzle |
User | KAN |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 2462 Byte |
Status | AC |
Exec Time | 98 ms |
Memory | 16128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:36:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &n, &m); ^ ./Main.cpp:37:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &q); ^ ./Main.cpp:40:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1200 / 1200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 7 ms | 4992 KB |
0_01.txt | AC | 7 ms | 4992 KB |
0_02.txt | AC | 7 ms | 4992 KB |
0_03.txt | AC | 7 ms | 4992 KB |
1_00.txt | AC | 7 ms | 4992 KB |
1_01.txt | AC | 7 ms | 4992 KB |
1_02.txt | AC | 56 ms | 10880 KB |
1_03.txt | AC | 57 ms | 10880 KB |
1_04.txt | AC | 57 ms | 10880 KB |
1_05.txt | AC | 57 ms | 10880 KB |
1_06.txt | AC | 95 ms | 16000 KB |
1_07.txt | AC | 93 ms | 16000 KB |
1_08.txt | AC | 98 ms | 16000 KB |
1_09.txt | AC | 94 ms | 16128 KB |
1_10.txt | AC | 25 ms | 5760 KB |
1_11.txt | AC | 25 ms | 5760 KB |
1_12.txt | AC | 25 ms | 5888 KB |
1_13.txt | AC | 22 ms | 5760 KB |
1_14.txt | AC | 27 ms | 5760 KB |
1_15.txt | AC | 27 ms | 5760 KB |
1_16.txt | AC | 29 ms | 5760 KB |
1_17.txt | AC | 23 ms | 5760 KB |
1_18.txt | AC | 61 ms | 10112 KB |
1_19.txt | AC | 27 ms | 5760 KB |
1_20.txt | AC | 59 ms | 9984 KB |
1_21.txt | AC | 30 ms | 6144 KB |
1_22.txt | AC | 58 ms | 9856 KB |
1_23.txt | AC | 28 ms | 5888 KB |
1_24.txt | AC | 63 ms | 10240 KB |
1_25.txt | AC | 28 ms | 5888 KB |
1_26.txt | AC | 16 ms | 5376 KB |
1_27.txt | AC | 16 ms | 5376 KB |
1_28.txt | AC | 18 ms | 5504 KB |
1_29.txt | AC | 17 ms | 5376 KB |
1_30.txt | AC | 17 ms | 5760 KB |
1_31.txt | AC | 17 ms | 5632 KB |
1_32.txt | AC | 17 ms | 5632 KB |
1_33.txt | AC | 18 ms | 5888 KB |
1_34.txt | AC | 47 ms | 9344 KB |
1_35.txt | AC | 44 ms | 8448 KB |
1_36.txt | AC | 49 ms | 9856 KB |
1_37.txt | AC | 38 ms | 7552 KB |
1_38.txt | AC | 47 ms | 8704 KB |
1_39.txt | AC | 28 ms | 6016 KB |
1_40.txt | AC | 56 ms | 10368 KB |
1_41.txt | AC | 29 ms | 6144 KB |
1_42.txt | AC | 16 ms | 5376 KB |
1_43.txt | AC | 16 ms | 5376 KB |
1_44.txt | AC | 16 ms | 5376 KB |
1_45.txt | AC | 16 ms | 5504 KB |
1_46.txt | AC | 17 ms | 5504 KB |
1_47.txt | AC | 17 ms | 5632 KB |
1_48.txt | AC | 18 ms | 5632 KB |
1_49.txt | AC | 18 ms | 5760 KB |
1_50.txt | AC | 47 ms | 9856 KB |
1_51.txt | AC | 39 ms | 8192 KB |
1_52.txt | AC | 49 ms | 9984 KB |
1_53.txt | AC | 22 ms | 5376 KB |
1_54.txt | AC | 48 ms | 10240 KB |
1_55.txt | AC | 41 ms | 8704 KB |
1_56.txt | AC | 51 ms | 10496 KB |
1_57.txt | AC | 24 ms | 5760 KB |
1_58.txt | AC | 16 ms | 5376 KB |
1_59.txt | AC | 16 ms | 5376 KB |
1_60.txt | AC | 16 ms | 5376 KB |
1_61.txt | AC | 15 ms | 5376 KB |
1_62.txt | AC | 16 ms | 5504 KB |
1_63.txt | AC | 16 ms | 5888 KB |
1_64.txt | AC | 16 ms | 5504 KB |
1_65.txt | AC | 18 ms | 5760 KB |
1_66.txt | AC | 57 ms | 10368 KB |
1_67.txt | AC | 55 ms | 10368 KB |
1_68.txt | AC | 56 ms | 10368 KB |
1_69.txt | AC | 54 ms | 10368 KB |
1_70.txt | AC | 56 ms | 10880 KB |
1_71.txt | AC | 57 ms | 10752 KB |