提出 #68600542

---

ソースコード 拡げる

//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
/*
░░░░░░░█▐▓▓░████▄▄▄█▀▄▓▓▓▌█
░░░░░▄█▌▀▄▓▓▄▄▄▄▀▀▀▄▓▓▓▓▓▌█
░░░▄█▀▀▄▓█▓▓▓▓▓▓▓▓▓▓▓▓▀░▓▌█
░░█▀▄▓▓▓███▓▓▓███▓▓▓▄░░▄▓▐█▌
░█▌▓▓▓▀▀▓▓▓▓███▓▓▓▓▓▓▓▄▀▓▓▐█
▐█▐██▐░▄▓▓▓▓▓▀▄░▀▓▓▓▓▓▓▓▓▓▌█▌
█▌███▓▓▓▓▓▓▓▓▐░░▄▓▓███▓▓▓▄▀▐█
█▐█▓▀░░▀▓▓▓▓▓▓▓▓▓██████▓▓▓▓▐█
▌▓▄▌▀░▀░▐▀█▄▓▓██████████▓▓▓▌█▌
▌▓▓▓▄▄▀▀▓▓▓▀▓▓▓▓▓▓▓▓█▓█▓█▓▓▌█▌
█▐▓▓▓▓▓▓▄▄▄▓▓▓▓▓▓█▓█▓█▓█▓▓▓▐█ йоу
 */
#include <iostream>
#include "queue"
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#include "random"
#ifndef __APPLE__
#include "bits/stdc++.h"
#endif
#define all(x) x.begin(), x.end()
using namespace std;

int N;
void upd(int &a, int b) {
    a = max(a, b);
}
int calc(vector<int> a, int k) {
    int n = a.size();
    vector<int> ind(N, -1);
    for (int i = 0; i < n; ++i) {
        a.push_back(a[i]);
        ind[a[i]] = i;
        //cout << a[i] << ' ';
    }
    //cout << '\n';
    vector<vector<int>> dp(n, vector<int>(n));
    for (int len = 1; len < n; ++len) {
        for (int i = 0; i + len < n; ++i) {

            //cout << i << ' ' << len << '\n';
            int j = i + len;
            upd(dp[i][j], dp[i + 1][j]);
            upd(dp[i][j], dp[i][j - 1]);
            for (int l = a[i] % k; l < N; l += k) {
                int p = ind[l];
                if (p != -1) {
                    if (i < p and p <= j) {
                        upd(dp[i][j], dp[i][p-1] + dp[p][j] + 1);
                    }
                }
            }
        }
    }

    //cerr << res << '\n';
    return dp[0][n-1];
}
void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> p(n * k);
    N = n * k;
    for (int i = 0; i < p.size(); ++i) {
        cin >> p[i];
        p[i]--;
    }
    int res = 0;
    vector<int> seen(p.size());
    for (int i = 0; i < p.size(); ++i) {
        if (seen[i] == 0) {
            vector<int> clc;
            int v = i;
            while (seen[v] == 0) {
                seen[v] = 1;
                clc.push_back(v);
                v = p[v];
            }
            res += calc(clc, n);
        }
    }
    cout << res << '\n';
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}

/*
2 2 50
3 4 0 1 1 0 1 1
4 5 1 2 1 1 1 2
 1 5 3 2 4 1 5 3 2 4
 */

提出情報

コンパイルエラー

Main.cpp: In function ‘void solve()’:
Main.cpp:77:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   77 |     for (int i = 0; i < p.size(); ++i) {
      |                     ~~^~~~~~~~~~
Main.cpp:83:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   83 |     for (int i = 0; i < p.size(); ++i) {
      |                     ~~^~~~~~~~~~

ジャッジ結果