Submission #898743
Source Code Expand
#include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <deque> #include <complex> #include <stack> #include <queue> #include <cstdio> #include <cctype> #include <cstring> #include <ctime> #include <iterator> #include <bitset> #include <numeric> #include <list> #include <iomanip> #include <cassert> #if __cplusplus >= 201103L #include <array> #include <tuple> #include <initializer_list> #include <unordered_set> #include <unordered_map> #include <forward_list> #define cauto const auto& #define ALL(v) begin(v),end(v) #else #define ALL(v) (v).begin(),(v).end() #endif using namespace std; namespace{ typedef long long LL; typedef pair<int,int> pii; typedef pair<LL,LL> pll; typedef vector<int> vint; typedef vector<vector<int> > vvint; typedef vector<long long> vll, vLL; typedef vector<vector<long long> > vvll, vvLL; #define VV(T) vector<vector< T > > template <class T> void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){ v.assign(a, vector<T>(b, t)); } template <class F, class T> void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #define REP(i,n) for(int i=0;i<int(n);++i) #define RALL(v) (v).rbegin(),(v).rend() #define MOD 1000000007LL #define EPS 1e-8 void mainmain(){ int n, m, q; scanf("%d%d%d", &n, &m, &q); vint as(q); for(int i = 0; i < q; ++i){ scanf("%d", &as[i]); --as[i]; } vint vis(m); vector<int> seq; for(int i = q; i--; ){ if(!vis[as[i]]){ vis[as[i]] = 1; seq.push_back(as[i]); } } for(int i = 0; i < m; ++i){ if(!vis[i]){ seq.push_back(i); } } vint rtbl(m); for(int i = 0; i < m; ++i){ rtbl[seq[i]] = i; } vint cnt(m + 1); cnt[0] = n; for(int i = q; i--; ){ int x = rtbl[as[i]]; if(cnt[x] > 0){ --cnt[x]; ++cnt[x + 1]; } } int minidx; for(minidx = 0; !cnt[minidx]; ++minidx); vis.assign(m, 0); vint seq2; for(int i = 0; i < minidx; ++i){ seq2.push_back(seq[i]); vis[seq[i]] = 1; } for(int i = 0; i < m; ++i){ if(!vis[i]){ seq2.push_back(i); } } puts(seq == seq2 ? "Yes" : "No"); } } int main() try{ // ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(4); mainmain(); } catch(...){}
Submission Info
Submission Time | |
---|---|
Task | E - LRU Puzzle |
User | climpet |
Language | C++14 (GCC 5.4.1) |
Score | 1200 |
Code Size | 2547 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 2936 KB |
Compile Error
./Main.cpp: In function ‘void {anonymous}::mainmain()’: ./Main.cpp:82: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:85:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &as[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 | 2 ms | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
0_02.txt | AC | 2 ms | 256 KB |
0_03.txt | AC | 2 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 2 ms | 256 KB |
1_02.txt | AC | 14 ms | 2936 KB |
1_03.txt | AC | 15 ms | 2936 KB |
1_04.txt | AC | 15 ms | 2936 KB |
1_05.txt | AC | 14 ms | 2936 KB |
1_06.txt | AC | 16 ms | 2936 KB |
1_07.txt | AC | 16 ms | 2936 KB |
1_08.txt | AC | 16 ms | 2936 KB |
1_09.txt | AC | 16 ms | 2936 KB |
1_10.txt | AC | 14 ms | 1788 KB |
1_11.txt | AC | 14 ms | 1788 KB |
1_12.txt | AC | 14 ms | 1788 KB |
1_13.txt | AC | 14 ms | 1788 KB |
1_14.txt | AC | 15 ms | 1788 KB |
1_15.txt | AC | 14 ms | 1788 KB |
1_16.txt | AC | 15 ms | 1788 KB |
1_17.txt | AC | 14 ms | 1788 KB |
1_18.txt | AC | 17 ms | 2808 KB |
1_19.txt | AC | 16 ms | 1916 KB |
1_20.txt | AC | 16 ms | 2680 KB |
1_21.txt | AC | 17 ms | 2936 KB |
1_22.txt | AC | 17 ms | 2936 KB |
1_23.txt | AC | 17 ms | 2552 KB |
1_24.txt | AC | 16 ms | 2936 KB |
1_25.txt | AC | 17 ms | 2424 KB |
1_26.txt | AC | 11 ms | 640 KB |
1_27.txt | AC | 11 ms | 640 KB |
1_28.txt | AC | 12 ms | 640 KB |
1_29.txt | AC | 12 ms | 768 KB |
1_30.txt | AC | 15 ms | 2552 KB |
1_31.txt | AC | 15 ms | 2552 KB |
1_32.txt | AC | 14 ms | 1916 KB |
1_33.txt | AC | 15 ms | 2552 KB |
1_34.txt | AC | 14 ms | 1280 KB |
1_35.txt | AC | 15 ms | 1660 KB |
1_36.txt | AC | 13 ms | 1152 KB |
1_37.txt | AC | 15 ms | 1660 KB |
1_38.txt | AC | 17 ms | 2552 KB |
1_39.txt | AC | 17 ms | 2680 KB |
1_40.txt | AC | 17 ms | 2936 KB |
1_41.txt | AC | 17 ms | 2936 KB |
1_42.txt | AC | 11 ms | 640 KB |
1_43.txt | AC | 11 ms | 640 KB |
1_44.txt | AC | 11 ms | 640 KB |
1_45.txt | AC | 11 ms | 640 KB |
1_46.txt | AC | 13 ms | 1152 KB |
1_47.txt | AC | 13 ms | 1532 KB |
1_48.txt | AC | 13 ms | 1408 KB |
1_49.txt | AC | 16 ms | 2680 KB |
1_50.txt | AC | 12 ms | 768 KB |
1_51.txt | AC | 11 ms | 640 KB |
1_52.txt | AC | 12 ms | 768 KB |
1_53.txt | AC | 12 ms | 768 KB |
1_54.txt | AC | 15 ms | 2680 KB |
1_55.txt | AC | 13 ms | 1532 KB |
1_56.txt | AC | 16 ms | 2936 KB |
1_57.txt | AC | 16 ms | 2680 KB |
1_58.txt | AC | 11 ms | 640 KB |
1_59.txt | AC | 11 ms | 640 KB |
1_60.txt | AC | 11 ms | 640 KB |
1_61.txt | AC | 11 ms | 640 KB |
1_62.txt | AC | 12 ms | 1408 KB |
1_63.txt | AC | 14 ms | 2936 KB |
1_64.txt | AC | 12 ms | 1280 KB |
1_65.txt | AC | 16 ms | 2680 KB |
1_66.txt | AC | 11 ms | 640 KB |
1_67.txt | AC | 11 ms | 640 KB |
1_68.txt | AC | 11 ms | 640 KB |
1_69.txt | AC | 11 ms | 640 KB |
1_70.txt | AC | 14 ms | 2808 KB |
1_71.txt | AC | 16 ms | 2552 KB |