Submission #895322


Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>

#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <deque>
#include <string>

#include <algorithm>
#include <numeric>

#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>

#define pb push_back
#define pbk pop_back
#define mp make_pair
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define foreach(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); ++i)
#define len(a) ((int) (a).size())

#ifdef CUTEBMAING
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

using namespace std;

typedef long long int64;
typedef long double ld;
typedef unsigned long long lint;

const int inf = (1 << 30) - 1;
const int64 linf = (1ll << 62) - 1;
const int N = 1e6 + 100;

int n, m, q;
int a[N];

bool used[N];
vector<int> perm;

int it[N];
set<int> qt[N];
int pos[N];

int main() {
#ifdef XCODE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cin >> n >> m >> q;
    for (int i = 0; i < q; i++) {
        scanf("%d", &a[i]), a[i]--;
    }
    for (int i = q - 1; i >= 0; i--) {
        if (!used[a[i]]) {
            perm.pb(a[i]);
            used[a[i]] = true;
        }
    }
    for (int i = 0; i < len(perm); i++) {
        pos[perm[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        qt[it[i]].insert(i);
    }
    for (int i = q - 1; i >= 0; i--) {
        int cur = pos[a[i]];
        if (len(qt[cur]) == 0) {
            continue;
        }
        int start = *qt[cur].begin();
        qt[cur].erase(qt[cur].begin());
        qt[cur + 1].insert(start);
    }
    static int last[N];
    for (int i = 0; i < N; i++) {
        for (int j : qt[i]) {
            last[j] = i;
        }
    }
    int minLast = *min_element(last, last + n);
    static bool cused[N];
    for (int j = 0; j < minLast; j++) {
        cused[perm[j]] = true;
    }
    int it = 0;
    for (int j = minLast; j < len(perm); j++) {
        while (cused[it]) {
            it++;
        }
        if (it != perm[j]) {
            puts("No");
            return 0;
        }
        it++;
    }
    puts("Yes");
    return 0;
}

Submission Info

Submission Time
Task E - LRU Puzzle
User darinflar
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 2366 Byte
Status AC
Exec Time 111 ms
Memory 53496 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:64:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]), 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 54 ms 47232 KB
0_01.txt AC 54 ms 47104 KB
0_02.txt AC 54 ms 47104 KB
0_03.txt AC 55 ms 47104 KB
1_00.txt AC 54 ms 47104 KB
1_01.txt AC 54 ms 47104 KB
1_02.txt AC 110 ms 52608 KB
1_03.txt AC 111 ms 52608 KB
1_04.txt AC 111 ms 52608 KB
1_05.txt AC 110 ms 52608 KB
1_06.txt AC 100 ms 53496 KB
1_07.txt AC 98 ms 53496 KB
1_08.txt AC 97 ms 53496 KB
1_09.txt AC 98 ms 53496 KB
1_10.txt AC 69 ms 48124 KB
1_11.txt AC 69 ms 48124 KB
1_12.txt AC 69 ms 48124 KB
1_13.txt AC 67 ms 48124 KB
1_14.txt AC 69 ms 48124 KB
1_15.txt AC 70 ms 48124 KB
1_16.txt AC 69 ms 48124 KB
1_17.txt AC 67 ms 48124 KB
1_18.txt AC 71 ms 48504 KB
1_19.txt AC 71 ms 48252 KB
1_20.txt AC 71 ms 48504 KB
1_21.txt AC 71 ms 48632 KB
1_22.txt AC 71 ms 48504 KB
1_23.txt AC 71 ms 48252 KB
1_24.txt AC 71 ms 48504 KB
1_25.txt AC 71 ms 48252 KB
1_26.txt AC 63 ms 47488 KB
1_27.txt AC 63 ms 47488 KB
1_28.txt AC 64 ms 47616 KB
1_29.txt AC 64 ms 47616 KB
1_30.txt AC 64 ms 47872 KB
1_31.txt AC 64 ms 47872 KB
1_32.txt AC 63 ms 47744 KB
1_33.txt AC 65 ms 48000 KB
1_34.txt AC 71 ms 48000 KB
1_35.txt AC 70 ms 48124 KB
1_36.txt AC 69 ms 47872 KB
1_37.txt AC 70 ms 48000 KB
1_38.txt AC 71 ms 48380 KB
1_39.txt AC 71 ms 48376 KB
1_40.txt AC 70 ms 48508 KB
1_41.txt AC 71 ms 48504 KB
1_42.txt AC 63 ms 47488 KB
1_43.txt AC 63 ms 47488 KB
1_44.txt AC 63 ms 47488 KB
1_45.txt AC 63 ms 47488 KB
1_46.txt AC 64 ms 47616 KB
1_47.txt AC 64 ms 47744 KB
1_48.txt AC 64 ms 47744 KB
1_49.txt AC 65 ms 48000 KB
1_50.txt AC 69 ms 47616 KB
1_51.txt AC 70 ms 47616 KB
1_52.txt AC 68 ms 47744 KB
1_53.txt AC 68 ms 47616 KB
1_54.txt AC 69 ms 47616 KB
1_55.txt AC 70 ms 47616 KB
1_56.txt AC 69 ms 47872 KB
1_57.txt AC 70 ms 48000 KB
1_58.txt AC 62 ms 47488 KB
1_59.txt AC 62 ms 47488 KB
1_60.txt AC 62 ms 47488 KB
1_61.txt AC 63 ms 47488 KB
1_62.txt AC 63 ms 47616 KB
1_63.txt AC 63 ms 47616 KB
1_64.txt AC 63 ms 47488 KB
1_65.txt AC 65 ms 47872 KB
1_66.txt AC 105 ms 52608 KB
1_67.txt AC 105 ms 52608 KB
1_68.txt AC 104 ms 52608 KB
1_69.txt AC 105 ms 52608 KB
1_70.txt AC 105 ms 52608 KB
1_71.txt AC 106 ms 52736 KB