Submission #6496893

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using LL = long long; using PII = pair<LL, LL>; using VI = vector<LL>; using VVI = vector<VI>;
using VB = vector<bool>; using VS = vector<string>; using VP = vector<PII>;
#define VV(T)        vector<vector<T>>
#define PB           push_back
#define MP           make_pair
#define SZ(a)        LL((a).size())
#define EACH(x, c)   for (auto x : (c))
#define ALL(c)       (c).begin(), (c).end()
#define REVERSE(c)   reverse(ALL(c))
#define SORT(c)      stable_sort(ALL(c))
#define RSORT(c)     stable_sort((c).rbegin(), (c).rend())
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n)    FOR(i, 0, n)
#define $(x)         {cout << #x << " = " << (x) << endl;}

#define SSORT(c)     stable_sort(ALL(c), [] (auto& x, auto& y) {return x.second < y.second;});




void solve(LL N, LL K, vector<LL> A){
    VVI results;   // of 1st, 2nd, ..., until returns to an empty set

    VI B(A);

    REP(k, K) {
        /*cout << "B\n";
        REP(i, SZ(B)) {
            cout << B[i] << " ";
        }
        cout << endl;*/
        VB masked(SZ(B));
        unordered_map<LL, LL> c;   // number, position + 1
        REP(i, SZ(B)) {
            //$(i);
            if (c.count(B[i]) == 0) {
                c[B[i]] = i + 1;
            } else {
                FOR(j, c[B[i]] - 1, i + 1) {
                    masked[j] = true;
                }
                unordered_map<LL, LL> d;
                REP(j, c[B[i]] - 1) {
                    if (!masked[j]) {
                        d[B[j]] = j + 1;
                    }
                }
                c = d;
            }
            /*cout << "c\n";
            EACH(cc, c) {
                cout << cc.first << ":" << cc.second << " ";
            }
            cout << endl;*/
        }
        VP x;
        EACH(cc, c) {
            x.PB(cc);
            //$(cc.first);
        }
        SSORT(x);
        VI result;
        //$(k);
        //cout << "result\n";
        REP(i, SZ(x)) {
            //cout << "hoge\n";
            result.PB(x[i].first);
            //cout << result[i] << " ";
        }
        /*cout << "c\n";
          cout << endl;
          $(SZ(c));*/
        if (SZ(c) == 0) {   // period == k + 1
            /*cout << "d\n";
              cout << "0!\n";*/
            if (k == 0) {
                return;
            }
            VI r(results[K % (k + 1) - 1]);
            REP(i, SZ(r)) {
                cout << r[i] << " ";
            }
            cout << endl;
            return;
            //cout << "0!" << endl;
        }
        //cout << "1\n";
        results.PB(result);
        //cout << "2\n";
        REP(i, SZ(A)) {
            result.PB(A[i]);
        }
        B = result;
    }
    VI r(results[SZ(results) - 1]);
    REP(i, SZ(r)) {
        cout << r[i] << " ";
    }
    cout << endl;
}

int main(){
    LL N;
    scanf("%lld",&N);
    LL K;
    scanf("%lld",&K);
    vector<LL> A(N-1-0+1);
    for(int i = 0 ; i < N-1-0+1 ; i++){
        scanf("%lld",&A[i]);
    }
    solve(N, K, move(A));
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:106:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&N);
                     ^
./Main.cpp:108:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&K);
                     ^
./Main.cpp:111:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&A[i]);
                            ^

Judge Result