提出 cf3e1277-8bac-458f-abd8-57c50c13e5f4

コード

#ifndef INCLUDE_MACRO
#define INCLUDE_MACRO
#include __FILE__

signed main() {
    inii(n, m);
    invi(kind, m);
    invi(ene, m);
    si se;
    mi ma;
    pi output = mp(-1, -1);
    int rinzi = 0;
    int mini = 50000000000000000LL;
    int count = 0;
    rep(i, m + 1) {
        if (se.size() >= n) {
            i--;
            if (mini > rinzi) {
                output = mp(count, i);
                mini = rinzi;
            }
            ma[kind.at(count)]--;
            if (ma[kind.at(count)] == 0) se.erase(kind.at(count));
            rinzi -= ene.at(count);
            count++;
        }
        else {
        if (i == m) {
            break;
        }
            se.insert(kind.at(i));
            ma[kind.at(i)]++;
            rinzi += ene.at(i);
        }
        //cout << rinzi space count space mini space se.size() << endl;
    }
    if (output.first == -1 && output.second == -1) {
        cout << -1 space - 1 << endl;
        return 0;
    }
    cout << output.first + 1 space output.second + 2 << endl;
    return 0;
}

#else

//#include <bits/stdc++.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <cmath> // sqrt
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <chrono> // Timer
#include <cassert>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>


using namespace std;

#define set_dxy vi dx(4); dx = {1, -1, 0, 0}; vi dy(4); dy = {0, 0, 1, -1}
#define ini(x) int x; cin >> x
#define ind(x) double x; cin >> x
#define ins(x) string x; cin >> x
#define inc(x) char x; cin >> x
#define inii(x, y) ini(x); ini(y)
#define inis(x, y) ini(x); ins(y)
#define insi(x, y) ins(x); ini(y)
#define inss(x, y) ins(x); ins(y)
#define iniii(x, y, z) inii(x, y); ini(z);
#define invi(vec, x); vi vec(x); rep(i, x){cin >> vec.at(i);}
#define endl "\n"
#define space << " " <<
#define under(N) fixed << setprecision(N)
#define abssort(aaa) sort(all(aaa)); ranges::sort(aaa,greater{},[](const auto a){return abs(a);}); reverse(all(aaa))
#define pi pair<int, int>
#define mp make_pair
#define mi map<int, int>
#define mis map<int, set<int>>
#define vi vector<int>
#define vd vector<double>
#define vc vector<char>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pi>
#define si set<int>
#define qi queue<int>
#define vvi vector<vi>
#define vvc vector<vc>
#define tat(v, i, j) v.at(i).at(j)
#define cy cout << "Yes" << endl
#define cn cout << "No" << endl
#define dame cout << -1 << endl
#define check cout << "check" << endl
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define doing(P) sort(all(P));do
#define did(P) while(next_permutation(all(P)))
#define rep(i, n) for (int i = 0; i < n; i++)
#define orep(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define nfor(i, a, b) for (int i = a; i < b; i++)
#define dfor(i, a, b) for (int i = a; i > b; i--)
#define allout(x) cout << "all:" << endl; for (auto aaa : x) {cout << aaa << " ";} cout << endl; cout << "----------end" << endl;
#define pairout(x) cout << "f:" << x.first << " s:" << x.second << endl; cout << "----------end" << endl;
#define tallout(x) cout << "tall:" << endl; for (auto aaa : x) {for (auto bbb : aaa) {cout << bbb << " ";} cout << endl;} cout << "----------end" << endl;
#define queout(q) cout << "queue:" << endl; while (!q.empty()) {cout << q.front() << " "; q.pop();} cout << endl; cout << "----------end" << endl;
#define topout(x) cout << "top:" << endl; while (!x.empty()) {cout << x.top() << " "; x.pop();} cout << endl; cout << "----------end" << endl;
#define allchar 'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'
#define ALLchar 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'
#define int int64_t
#define double long double
#define uint unsigned long long
#define modint const int mod = 998244353

uint abs_sqrt(uint n) {
    if (n == 0) return 0;
    uint rinzi = sqrt(n) - 1;
    return rinzi * (rinzi + 2) < n ? rinzi + 1 : rinzi;
}

class Timer {
    chrono::system_clock::time_point start;
public:
    Timer() : start(chrono::system_clock::now()) {}
    double count() {
        chrono::duration<double> Time_ = chrono::system_clock::now() - start;
        return Time_.count();
    }
    bool is_under(double x) {
        return (this->count()) < x;
    }
};

bool out_glid(int i, int j, int h, int w) {
    if (i < 0 || h <= i || j < 0 || w <= j) return true;
    else return false;
}



#endif

結果

問題	点数	言語	結果	実行時間	メモリ
F. Sliding	150	C++ (gcc)	AC	617 ms	29880 KiB

テストセット

テストセット	結果	得点	実行時間	メモリ
Subtask1	AC × 10	0	-1 ms	-1 KiB
Subtask2	AC × 10	0	-1 ms	-1 KiB

詳細結果

テストケース	結果	実行時間	メモリ
1_1.txt	AC	2 ms	3828 KiB
1_10.txt	AC	3 ms	3676 KiB
1_2.txt	AC	2 ms	3628 KiB
1_3.txt	AC	5 ms	3756 KiB
1_4.txt	AC	2 ms	3880 KiB
1_5.txt	AC	5 ms	3736 KiB
1_6.txt	AC	3 ms	3728 KiB
1_7.txt	AC	3 ms	3660 KiB
1_8.txt	AC	3 ms	3724 KiB
1_9.txt	AC	2 ms	3776 KiB
2_1.txt	AC	101 ms	9016 KiB
2_10.txt	AC	617 ms	24108 KiB
2_2.txt	AC	398 ms	29880 KiB
2_3.txt	AC	341 ms	28616 KiB
2_4.txt	AC	368 ms	19148 KiB
2_5.txt	AC	573 ms	23280 KiB
2_6.txt	AC	143 ms	10160 KiB
2_7.txt	AC	268 ms	16544 KiB
2_8.txt	AC	270 ms	24396 KiB
2_9.txt	AC	285 ms	15900 KiB