Submission #894328


Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
#include <fstream>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
#include <numeric>

#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "rt", stdin);
#endif

    int n, m, q;
    cin >> n >> m >> q;
    vi qs(q);
    forn(i, q) cin >> qs[i];
    reverse(all(qs));
    vi vis(m), pos(m);
    vi pref;
    for (int x: qs) {
        --x;
        if (!vis[x]) pos[x] = pref.size(), pref.pb(x);
        ++vis[x];
        uin(vis[x], n);
        if (pos[x]) uin(vis[x], vis[pref[pos[x] - 1]]);
    }
    forn(i, m) if (!vis[i]) pref.pb(i);
    vi got;
    forn(i, pref.size()) if (vis[pref[i]] == n) got.pb(pref[i]);
    forn(i, m) if (vis[i] < n) got.pb(i);
    cout << (got == pref ? "Yes" : "No") << '\n';

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}

Submission Info

Submission Time
Task E - LRU Puzzle
User endagorion
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 1963 Byte
Status AC
Exec Time 15 ms
Memory 2552 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1200 / 1200
Status
AC × 4
AC × 76
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 3 ms 256 KB
0_03.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 12 ms 2552 KB
1_03.txt AC 12 ms 2552 KB
1_04.txt AC 12 ms 2552 KB
1_05.txt AC 12 ms 2552 KB
1_06.txt AC 14 ms 2552 KB
1_07.txt AC 14 ms 2552 KB
1_08.txt AC 15 ms 2552 KB
1_09.txt AC 14 ms 2552 KB
1_10.txt AC 13 ms 1660 KB
1_11.txt AC 13 ms 1660 KB
1_12.txt AC 13 ms 1660 KB
1_13.txt AC 13 ms 1660 KB
1_14.txt AC 13 ms 1660 KB
1_15.txt AC 13 ms 1660 KB
1_16.txt AC 13 ms 1660 KB
1_17.txt AC 13 ms 1660 KB
1_18.txt AC 15 ms 2424 KB
1_19.txt AC 14 ms 1660 KB
1_20.txt AC 15 ms 2424 KB
1_21.txt AC 15 ms 2552 KB
1_22.txt AC 15 ms 2552 KB
1_23.txt AC 15 ms 2296 KB
1_24.txt AC 15 ms 2552 KB
1_25.txt AC 15 ms 2168 KB
1_26.txt AC 10 ms 640 KB
1_27.txt AC 10 ms 640 KB
1_28.txt AC 11 ms 768 KB
1_29.txt AC 11 ms 768 KB
1_30.txt AC 13 ms 2296 KB
1_31.txt AC 13 ms 2296 KB
1_32.txt AC 12 ms 1660 KB
1_33.txt AC 14 ms 2296 KB
1_34.txt AC 12 ms 1280 KB
1_35.txt AC 13 ms 1532 KB
1_36.txt AC 12 ms 1152 KB
1_37.txt AC 13 ms 1532 KB
1_38.txt AC 15 ms 2296 KB
1_39.txt AC 15 ms 2296 KB
1_40.txt AC 15 ms 2552 KB
1_41.txt AC 15 ms 2552 KB
1_42.txt AC 10 ms 640 KB
1_43.txt AC 10 ms 640 KB
1_44.txt AC 10 ms 640 KB
1_45.txt AC 10 ms 640 KB
1_46.txt AC 12 ms 1024 KB
1_47.txt AC 12 ms 1404 KB
1_48.txt AC 12 ms 1280 KB
1_49.txt AC 14 ms 2424 KB
1_50.txt AC 10 ms 768 KB
1_51.txt AC 10 ms 640 KB
1_52.txt AC 11 ms 896 KB
1_53.txt AC 11 ms 768 KB
1_54.txt AC 13 ms 2424 KB
1_55.txt AC 11 ms 1532 KB
1_56.txt AC 14 ms 2552 KB
1_57.txt AC 14 ms 2424 KB
1_58.txt AC 9 ms 640 KB
1_59.txt AC 9 ms 640 KB
1_60.txt AC 9 ms 640 KB
1_61.txt AC 9 ms 640 KB
1_62.txt AC 11 ms 1280 KB
1_63.txt AC 12 ms 2552 KB
1_64.txt AC 10 ms 1152 KB
1_65.txt AC 14 ms 2296 KB
1_66.txt AC 9 ms 640 KB
1_67.txt AC 9 ms 640 KB
1_68.txt AC 9 ms 640 KB
1_69.txt AC 10 ms 640 KB
1_70.txt AC 12 ms 2552 KB
1_71.txt AC 14 ms 2296 KB