提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114880	2023-10-24 09:55:15	rk42745417	I	cpp	25/25	AC	260

#include <iostream>
#include <algorithm>
#include <vector>
const int MOD = 127237991;

signed main() {
    int n;
    std::cin >> n;
    std::vector<int> arr = {0}, dp = {1};
    for (int _ = 0; _ < 5; _++) {
        std::vector<int> owo(n);
        for (int &a : owo)
            std::cin >> a;
        std::sort(owo.begin(), owo.end());
        int sum = 0;
        std::vector<int> cur_dp(n);
        size_t it = 0;
        for (int i = 0; i < n; i++) {
            while (it < arr.size() && arr[it] < owo[i])
                sum = (sum + dp[it++]) % MOD;
            cur_dp[i] = sum;
        }
        arr = owo;
        dp = cur_dp;
    }
    int sum = 0;
    for (int i = 0; i < n; i++)
        sum = (sum + dp[i]) % MOD;
    std::cout << sum << '\n';
}

sample1.txt AC 2
sample2.txt AC 2
sample3.txt AC 3
sample4.txt AC 8
sample5.txt AC 8
case1.txt AC 8
case2.txt AC 8
case3.txt AC 8
case4.txt AC 8
case5.txt AC 8
case6.txt AC 148
case7.txt AC 98
case8.txt AC 120
case9.txt AC 52
case10.txt AC 49
case11.txt AC 210
case12.txt AC 258
case13.txt AC 186
case14.txt AC 236
case15.txt AC 211
case16.txt AC 146
case17.txt AC 260
case18.txt AC 141
case19.txt AC 230
case20.txt AC 140
260 AC260 AC