Submission #1721993
Source Code Expand
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define fi first #define se second #define mp make_pair #define pb push_back #define fbo find_by_order #define ook order_of_key typedef long long ll; typedef pair<ll,ll> ii; typedef vector<int> vi; typedef long double ld; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; typedef set<int>::iterator sit; typedef map<int,int>::iterator mit; typedef vector<int>::iterator vit; vector<int> vec; int freq[100001]; vi a; vi inv; bool visited[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, q; cin >> n >> m >> q; vec.resize(q); for(int i = 0; i < q; i++) { cin >> vec[i]; vec[i]--; } freq[0] = n; reverse(vec.begin(), vec.end()); for(int i = 0; i < q; i++) { if(!visited[vec[i]]) { visited[vec[i]] = 1; a.pb(vec[i]); } } for(int i = 0; i < m; i++) { if(!visited[i]) a.pb(i); } //cerr << a.size() << ' ' << n << '\n'; inv.resize(m); for(int i = 0; i < m; i++) { inv[a[i]] = i; } for(int i = 0; i < q; i++) { int f = inv[vec[i]]; if(freq[f]) { freq[f]--; freq[f+1]++; } } int idx = 0; for(int i = 0; i <= m; i++) { if(freq[i]) { idx = i; break; } } for(int i = idx; i < m - 1; i++) { if(a[i] >= a[i+1]) {cout << "No"; return 0;} } cout << "Yes"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - LRU Puzzle |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 1450 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 2040 KB |
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 | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 8 ms | 1528 KB |
1_03.txt | AC | 8 ms | 1528 KB |
1_04.txt | AC | 8 ms | 1528 KB |
1_05.txt | AC | 8 ms | 1528 KB |
1_06.txt | AC | 11 ms | 2040 KB |
1_07.txt | AC | 10 ms | 2040 KB |
1_08.txt | AC | 10 ms | 2040 KB |
1_09.txt | AC | 11 ms | 2040 KB |
1_10.txt | AC | 10 ms | 1404 KB |
1_11.txt | AC | 10 ms | 1404 KB |
1_12.txt | AC | 10 ms | 1404 KB |
1_13.txt | AC | 10 ms | 1404 KB |
1_14.txt | AC | 10 ms | 1404 KB |
1_15.txt | AC | 10 ms | 1404 KB |
1_16.txt | AC | 10 ms | 1404 KB |
1_17.txt | AC | 10 ms | 1404 KB |
1_18.txt | AC | 11 ms | 1912 KB |
1_19.txt | AC | 11 ms | 1532 KB |
1_20.txt | AC | 11 ms | 1784 KB |
1_21.txt | AC | 11 ms | 2040 KB |
1_22.txt | AC | 11 ms | 1912 KB |
1_23.txt | AC | 12 ms | 1656 KB |
1_24.txt | AC | 11 ms | 2040 KB |
1_25.txt | AC | 11 ms | 1656 KB |
1_26.txt | AC | 9 ms | 640 KB |
1_27.txt | AC | 8 ms | 640 KB |
1_28.txt | AC | 9 ms | 640 KB |
1_29.txt | AC | 9 ms | 768 KB |
1_30.txt | AC | 10 ms | 1404 KB |
1_31.txt | AC | 10 ms | 1404 KB |
1_32.txt | AC | 9 ms | 1276 KB |
1_33.txt | AC | 10 ms | 1404 KB |
1_34.txt | AC | 10 ms | 1024 KB |
1_35.txt | AC | 11 ms | 1404 KB |
1_36.txt | AC | 10 ms | 1024 KB |
1_37.txt | AC | 11 ms | 1276 KB |
1_38.txt | AC | 11 ms | 1656 KB |
1_39.txt | AC | 11 ms | 1784 KB |
1_40.txt | AC | 11 ms | 1912 KB |
1_41.txt | AC | 11 ms | 2040 KB |
1_42.txt | AC | 8 ms | 640 KB |
1_43.txt | AC | 8 ms | 640 KB |
1_44.txt | AC | 8 ms | 640 KB |
1_45.txt | AC | 9 ms | 640 KB |
1_46.txt | AC | 10 ms | 896 KB |
1_47.txt | AC | 10 ms | 1148 KB |
1_48.txt | AC | 10 ms | 896 KB |
1_49.txt | AC | 10 ms | 1528 KB |
1_50.txt | AC | 9 ms | 768 KB |
1_51.txt | AC | 9 ms | 640 KB |
1_52.txt | AC | 9 ms | 768 KB |
1_53.txt | AC | 9 ms | 768 KB |
1_54.txt | AC | 10 ms | 1400 KB |
1_55.txt | AC | 9 ms | 1148 KB |
1_56.txt | AC | 10 ms | 1656 KB |
1_57.txt | AC | 12 ms | 1528 KB |
1_58.txt | AC | 8 ms | 640 KB |
1_59.txt | AC | 8 ms | 640 KB |
1_60.txt | AC | 8 ms | 640 KB |
1_61.txt | AC | 8 ms | 640 KB |
1_62.txt | AC | 8 ms | 896 KB |
1_63.txt | AC | 8 ms | 1528 KB |
1_64.txt | AC | 8 ms | 896 KB |
1_65.txt | AC | 11 ms | 1528 KB |
1_66.txt | AC | 7 ms | 640 KB |
1_67.txt | AC | 7 ms | 640 KB |
1_68.txt | AC | 7 ms | 640 KB |
1_69.txt | AC | 8 ms | 640 KB |
1_70.txt | AC | 8 ms | 1528 KB |
1_71.txt | AC | 10 ms | 1404 KB |