Submission #894295


Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <queue>
#include <math.h>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <bitset>
#include <list>
#include <ctype.h>
#include <cassert>
#include <stack>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <ctime>
#include <functional>
#include <ctime>
#include <limits>
#include <tuple>
#include <complex>
#include <numeric>

using namespace std;

#define snd second
#define fst first
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define left _left
#define right _right

const ld pi = acos(-1.0l);

template<typename T>
T abs(T x) {
    return x > 0 ? x : -x;
}

template<typename T>
T sqr(T x) {
    return x * x;
}

template<typename T>
bool chmin(T &x, T y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template<typename T>
bool chmax(T &x, T y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

template<typename U, typename V>
ostream &operator<<(ostream &s, const pair<U, V> &x) {
    s << "(" << x.fst << ", " << x.snd << ")";
    return s;
}

template<typename U>
ostream &operator<<(ostream &s, const vector<U> &x) {
    s << "[";
    bool was = false;
    for (auto it : x) {
        if (was) {
            s << ", ";
        }
        was = true;
        s << it;
    }
    s << "]";
    return s;
}

template<typename U>
ostream &operator<<(ostream &s, const set<U> &x) {
    s << "{";
    bool was = false;
    for (auto it : x) {
        if (was) {
            s << ", ";
        }
        was = true;
        s << it;
    }
    s << "}";
    return s;
}

template<int sz>
ostream operator<<(ostream &s, const bitset<sz> &x) {
    for (int i = 0; i < sz; i++) {
        s << x[i];
    }
    return s;
}


//-----------------------------------------------------------------------------

const int maxn = 1e5 + 5;
int cnt[maxn];

int main() {
    srand(time(NULL));

    retry:
#ifdef LOCAL
    // gen();

    freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
#else
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
#endif

    int n, m;
    scanf("%d %d", &n, &m);
    int q;
    scanf("%d", &q);
    vector<int> a(q);
    for (int i = 0; i < q; i++) {
        scanf("%d", &a[i]);
    }
    reverse(a.begin(), a.end());
    map<int,int> was;
    int v = 1;

    for (int &x : a) {
        if (!was.count(x)) {
            was[x] = v++;
        }
        x = was[x];
    }
    for (int i = 1; i <= m; i++) {
        if (!was.count(i)) {
            was[i] = v++;
        }
    }



    int g = 0;
    cnt[0] = n;
    for (int x : a) {
        if (cnt[x - 1]) {
            cnt[x - 1]--;
            cnt[x]++;
            chmax(g, x);
        } else {
            if (g >= x) {

            } else {
                cout << "No" << endl;
                return 0;
            }
        }
    }

    for (int i = 1; i <= m; i++) {
        int x = was[i];
        if (cnt[x - 1]) {
            cnt[x] += cnt[x - 1];
            cnt[x - 1] = 0;
            chmax(g, x);
        } else {
            if (g >= x) {

            } else {
                cout << "No" << endl;
                return 0;
            }
        }
    }

    if (cnt[v - 1] == n) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}

Submission Info

Submission Time
Task E - LRU Puzzle
User avolchek
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 3696 Byte
Status AC
Exec Time 87 ms
Memory 5760 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:135:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
                           ^
./Main.cpp:137:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
                    ^
./Main.cpp:140:27: 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
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 3 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 60 ms 5760 KB
1_03.txt AC 62 ms 5760 KB
1_04.txt AC 62 ms 5760 KB
1_05.txt AC 62 ms 5760 KB
1_06.txt AC 85 ms 5760 KB
1_07.txt AC 86 ms 5760 KB
1_08.txt AC 86 ms 5760 KB
1_09.txt AC 87 ms 5760 KB
1_10.txt AC 45 ms 3200 KB
1_11.txt AC 45 ms 3200 KB
1_12.txt AC 46 ms 3200 KB
1_13.txt AC 45 ms 3200 KB
1_14.txt AC 47 ms 3200 KB
1_15.txt AC 47 ms 3200 KB
1_16.txt AC 47 ms 3200 KB
1_17.txt AC 47 ms 3200 KB
1_18.txt AC 52 ms 4992 KB
1_19.txt AC 53 ms 3456 KB
1_20.txt AC 53 ms 4864 KB
1_21.txt AC 74 ms 5504 KB
1_22.txt AC 57 ms 5504 KB
1_23.txt AC 61 ms 4608 KB
1_24.txt AC 52 ms 5632 KB
1_25.txt AC 59 ms 4096 KB
1_26.txt AC 19 ms 640 KB
1_27.txt AC 14 ms 640 KB
1_28.txt AC 23 ms 768 KB
1_29.txt AC 24 ms 768 KB
1_30.txt AC 38 ms 4224 KB
1_31.txt AC 39 ms 4352 KB
1_32.txt AC 34 ms 3456 KB
1_33.txt AC 42 ms 4480 KB
1_34.txt AC 34 ms 2048 KB
1_35.txt AC 42 ms 2944 KB
1_36.txt AC 30 ms 1792 KB
1_37.txt AC 47 ms 2688 KB
1_38.txt AC 55 ms 4352 KB
1_39.txt AC 54 ms 4608 KB
1_40.txt AC 50 ms 5504 KB
1_41.txt AC 71 ms 5632 KB
1_42.txt AC 17 ms 640 KB
1_43.txt AC 18 ms 640 KB
1_44.txt AC 19 ms 640 KB
1_45.txt AC 16 ms 640 KB
1_46.txt AC 26 ms 1408 KB
1_47.txt AC 29 ms 2432 KB
1_48.txt AC 30 ms 2176 KB
1_49.txt AC 44 ms 4864 KB
1_50.txt AC 23 ms 768 KB
1_51.txt AC 19 ms 640 KB
1_52.txt AC 25 ms 1024 KB
1_53.txt AC 24 ms 768 KB
1_54.txt AC 60 ms 4736 KB
1_55.txt AC 30 ms 2432 KB
1_56.txt AC 72 ms 5504 KB
1_57.txt AC 49 ms 4992 KB
1_58.txt AC 13 ms 640 KB
1_59.txt AC 15 ms 640 KB
1_60.txt AC 13 ms 640 KB
1_61.txt AC 13 ms 640 KB
1_62.txt AC 24 ms 2304 KB
1_63.txt AC 57 ms 5632 KB
1_64.txt AC 21 ms 2048 KB
1_65.txt AC 36 ms 4608 KB
1_66.txt AC 12 ms 640 KB
1_67.txt AC 12 ms 640 KB
1_68.txt AC 12 ms 640 KB
1_69.txt AC 12 ms 640 KB
1_70.txt AC 58 ms 5376 KB
1_71.txt AC 37 ms 4480 KB