Submission #895725
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <vector> #include <string> #include <algorithm> #include <stack> #include <queue> #include <set> #include <cmath> #include <map> using namespace std; #define MOD 1000000007 #define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD) typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec; int N, M, Q; int A[101010]; int cnt[101010]; set<int> poss[101010]; int main() { scanf("%d%d%d", &N, &M, &Q); for (int i = 0; i < Q; ++i) { scanf("%d", A + i); --A[i]; } for (int i = 0; i < Q; ++i) { ++cnt[A[i]]; poss[A[i]].insert(i); } set<int> rem; for (int i = 0; i < M; ++i) rem.insert(i); vector<int> req; for (int i = Q - 1; i >= 0; --i) { if (rem.count(A[i]) == 0) continue; if (0 && rem.size() > 0 && *(rem.begin()) == A[i]) { // you can ignore it } else { req.push_back(A[i]); } rem.erase(A[i]); } for (int i : rem) req.push_back(i); vector<bool> ok(req.size(), true); for (int i = 0; i < req.size() - 1; ++i) if (req[i] > req[i + 1]) ok[i] = false; for (int i = req.size() - 2; i >= 0; --i) ok[i] = ok[i] && ok[i + 1]; for (int i = 0; i < N; ++i) { int lp = Q; int fg = -1; for (int _j = 0; _j < req.size(); _j++) { int j = req[_j]; int nxtp = -1; auto pt = poss[j].upper_bound(lp); // printf("%d ", lp); if (pt == poss[j].begin()) { if (ok[_j]) break; else { puts("No"); return 0; } } else { nxtp = *(--pt); lp = nxtp; poss[j].erase(lp); } } // puts(""); } puts("Yes"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - LRU Puzzle |
User | semiexp |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 1661 Byte |
Status | AC |
Exec Time | 104 ms |
Memory | 15740 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:25:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d", &N, &M, &Q); ^ ./Main.cpp:27: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 | 8 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 | 84 ms | 15360 KB |
1_03.txt | AC | 87 ms | 15360 KB |
1_04.txt | AC | 87 ms | 15360 KB |
1_05.txt | AC | 86 ms | 15360 KB |
1_06.txt | AC | 65 ms | 15104 KB |
1_07.txt | AC | 62 ms | 15104 KB |
1_08.txt | AC | 63 ms | 15104 KB |
1_09.txt | AC | 62 ms | 15104 KB |
1_10.txt | AC | 45 ms | 12544 KB |
1_11.txt | AC | 46 ms | 12544 KB |
1_12.txt | AC | 45 ms | 12544 KB |
1_13.txt | AC | 44 ms | 12544 KB |
1_14.txt | AC | 46 ms | 12544 KB |
1_15.txt | AC | 46 ms | 12544 KB |
1_16.txt | AC | 46 ms | 12544 KB |
1_17.txt | AC | 44 ms | 12544 KB |
1_18.txt | AC | 71 ms | 14592 KB |
1_19.txt | AC | 73 ms | 13184 KB |
1_20.txt | AC | 67 ms | 14592 KB |
1_21.txt | AC | 104 ms | 15612 KB |
1_22.txt | AC | 74 ms | 15232 KB |
1_23.txt | AC | 89 ms | 14588 KB |
1_24.txt | AC | 67 ms | 15104 KB |
1_25.txt | AC | 84 ms | 14204 KB |
1_26.txt | AC | 42 ms | 10112 KB |
1_27.txt | AC | 35 ms | 10112 KB |
1_28.txt | AC | 45 ms | 10240 KB |
1_29.txt | AC | 46 ms | 10240 KB |
1_30.txt | AC | 64 ms | 14096 KB |
1_31.txt | AC | 66 ms | 14496 KB |
1_32.txt | AC | 57 ms | 13184 KB |
1_33.txt | AC | 86 ms | 14592 KB |
1_34.txt | AC | 49 ms | 11648 KB |
1_35.txt | AC | 57 ms | 12416 KB |
1_36.txt | AC | 42 ms | 11264 KB |
1_37.txt | AC | 66 ms | 12544 KB |
1_38.txt | AC | 79 ms | 14208 KB |
1_39.txt | AC | 69 ms | 14336 KB |
1_40.txt | AC | 66 ms | 14976 KB |
1_41.txt | AC | 101 ms | 15740 KB |
1_42.txt | AC | 39 ms | 10112 KB |
1_43.txt | AC | 41 ms | 10112 KB |
1_44.txt | AC | 40 ms | 10112 KB |
1_45.txt | AC | 55 ms | 10112 KB |
1_46.txt | AC | 52 ms | 11008 KB |
1_47.txt | AC | 56 ms | 12160 KB |
1_48.txt | AC | 51 ms | 11776 KB |
1_49.txt | AC | 89 ms | 14972 KB |
1_50.txt | AC | 54 ms | 10240 KB |
1_51.txt | AC | 56 ms | 10112 KB |
1_52.txt | AC | 48 ms | 10496 KB |
1_53.txt | AC | 46 ms | 10240 KB |
1_54.txt | AC | 74 ms | 14332 KB |
1_55.txt | AC | 64 ms | 12288 KB |
1_56.txt | AC | 65 ms | 15104 KB |
1_57.txt | AC | 91 ms | 15100 KB |
1_58.txt | AC | 32 ms | 10112 KB |
1_59.txt | AC | 37 ms | 10112 KB |
1_60.txt | AC | 33 ms | 10112 KB |
1_61.txt | AC | 34 ms | 10112 KB |
1_62.txt | AC | 45 ms | 11776 KB |
1_63.txt | AC | 60 ms | 15232 KB |
1_64.txt | AC | 37 ms | 11520 KB |
1_65.txt | AC | 72 ms | 14592 KB |
1_66.txt | AC | 39 ms | 10112 KB |
1_67.txt | AC | 38 ms | 10112 KB |
1_68.txt | AC | 38 ms | 10112 KB |
1_69.txt | AC | 33 ms | 10112 KB |
1_70.txt | AC | 70 ms | 15100 KB |
1_71.txt | AC | 60 ms | 14204 KB |