Submission #1363369

#	Time	Username	Problem	Language	Result	Execution time	Memory
1363369		xorshift	September (APIO24_september)	C++20	100 / 100	112 ms	12716 KiB

september

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vint = vector<int>;
using vll = vector<ll>;
using pint = pair<int, int>;
using vpint = vector<pint>;

#define fi first
#define se second 
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); i--)

int solve(int N, int M, vint F, vector<vint> S) {
	vector<vint> rS(M, vint(N));
    rep(i, M) {
        auto& v = S[i]; auto& rv = rS[i];
        rep(j, N-1) rv[v[j]] = j;
    }
    vector<vint> rF(N);
    rep(i, N) rF[i].push_back(i);
    rep(i, N) if (i != 0) rF[F[i]].push_back(i);

    int K = 0;
    int max_pos = 0;
    rep(i, N-1) {
        rep(j, M) {
            int cv = S[j][i];
            rep(k, M) {
                for (auto& c: rF[cv]) {
                    int c_pos = rS[k][c];
                    max_pos = max(max_pos, c_pos);
                }
            }
        }
        if (max_pos == i) K++;
    }
    return K;
}

• Subtask 1: 11 / 11
• Subtask 2: 14 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 5 / 5
• Subtask 6: 11 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 9 / 9
• Subtask 10: 16 / 16