Contest Duration: ~ (local time) (120 minutes)

Submission #8530445

Source Code Expand

Copy
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
using namespace std;
template <class T, class U> inline void chmin(T & a, U const & b) { a = min<T>(a, b); }

bool solve(int n, int m, int q, const vector<int> & a) {
// make the final sequence
vector<int> used(m);
vector<int> b;
REP_R (i, q) {
if (not used[a[i]]) {
used[a[i]] = true;
b.push_back(a[i]);
}
}
REP (i, m) {
if (not used[i]) {
b.push_back(i);
}
}

// remove the tail
int r = m - 1;
while (r - 1 >= 0 and b[r - 1] < b[r]) {
-- r;
}
if (r == 0) return true;

// count queries
vector<int> next(m, m);
REP (i, r) {
next[b[i]] = (i + 1 < r ? b[i + 1] : m);
}
vector<int> cnt(m + 1);
cnt[b[0]] = n;
REP_R (i, q) {
if (cnt[a[i]]) {
-- cnt[a[i]];
++ cnt[next[a[i]]];
}
}
return cnt[m] == n;
}

int main() {
int n, m; cin >> n >> m;
int q; cin >> q;
vector<int> a(q);
REP (i, q) {
cin >> a[i];
-- a[i];
}
cout << (solve(n, m, q, a) ? "Yes" : "No") << endl;
return 0;
}

#### Submission Info

Submission Time 2019-11-20 03:57:33+0900 E - LRU Puzzle kimiyuki C++14 (GCC 5.4.1) 1200 1274 Byte AC 33 ms 2296 KB

#### Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 1200 / 1200 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 1 ms 256 KB
0_01.txt 1 ms 256 KB
0_02.txt 1 ms 256 KB
0_03.txt 1 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 1 ms 256 KB
1_02.txt 17 ms 1660 KB
1_03.txt 18 ms 2296 KB
1_04.txt 17 ms 1660 KB
1_05.txt 18 ms 2296 KB
1_06.txt 30 ms 1660 KB
1_07.txt 31 ms 2296 KB
1_08.txt 30 ms 1660 KB
1_09.txt 30 ms 1660 KB
1_10.txt 29 ms 1532 KB
1_11.txt 33 ms 1532 KB
1_12.txt 29 ms 1532 KB
1_13.txt 29 ms 1532 KB
1_14.txt 29 ms 1532 KB
1_15.txt 30 ms 1532 KB
1_16.txt 29 ms 1532 KB
1_17.txt 29 ms 1532 KB
1_18.txt 31 ms 2168 KB
1_19.txt 31 ms 1660 KB
1_20.txt 32 ms 2040 KB
1_21.txt 31 ms 2296 KB
1_22.txt 31 ms 2296 KB
1_23.txt 31 ms 1912 KB
1_24.txt 30 ms 2296 KB
1_25.txt 31 ms 1784 KB
1_26.txt 22 ms 640 KB
1_27.txt 19 ms 640 KB
1_28.txt 25 ms 640 KB
1_29.txt 25 ms 640 KB
1_30.txt 25 ms 1912 KB
1_31.txt 25 ms 1912 KB
1_32.txt 24 ms 1660 KB
1_33.txt 30 ms 1912 KB
1_34.txt 29 ms 1024 KB
1_35.txt 30 ms 1404 KB
1_36.txt 28 ms 1024 KB
1_37.txt 30 ms 1404 KB
1_38.txt 31 ms 1912 KB
1_39.txt 31 ms 2040 KB
1_40.txt 30 ms 2296 KB
1_41.txt 31 ms 2296 KB
1_42.txt 21 ms 640 KB
1_43.txt 22 ms 640 KB
1_44.txt 22 ms 640 KB
1_45.txt 21 ms 640 KB
1_46.txt 26 ms 896 KB
1_47.txt 26 ms 1276 KB
1_48.txt 25 ms 1152 KB
1_49.txt 30 ms 2040 KB
1_50.txt 23 ms 640 KB
1_51.txt 21 ms 640 KB
1_52.txt 24 ms 768 KB
1_53.txt 25 ms 640 KB
1_54.txt 24 ms 1532 KB
1_55.txt 22 ms 1276 KB
1_56.txt 30 ms 2296 KB
1_57.txt 30 ms 2040 KB
1_58.txt 19 ms 640 KB
1_59.txt 20 ms 640 KB
1_60.txt 20 ms 640 KB
1_61.txt 19 ms 640 KB
1_62.txt 21 ms 1152 KB
1_63.txt 18 ms 2296 KB
1_64.txt 20 ms 1024 KB
1_65.txt 30 ms 1912 KB
1_66.txt 17 ms 640 KB
1_67.txt 17 ms 640 KB
1_68.txt 17 ms 640 KB
1_69.txt 19 ms 640 KB
1_70.txt 17 ms 1660 KB
1_71.txt 30 ms 1912 KB