提出 cb4fdf82-9c03-4b61-a48a-0fedc98acd04

コード

#ifndef MAIN
#define MAIN
#include __FILE__
#define mp make_pair

string toup(string s)
{
    rep(i, s.at(i)) {
        if (s.at(i) >= 'a' && s.at(i) <= 'z') {
            s.at(i) -= 32;
        }
    }
    return s;
}

string tolow(string s)
{
    rep(i, s.at(i)) {
        if (s.at(i) >= 'A' && s.at(i) <= 'Z') {
            s.at(i) += 32;
        }
    }
    return s;
}

bool isPalindrome(const std::string& str) {
    int left = 0;
    int right = str.size() - 1;
    while (left < right) {
        if (str[left] != str[right]) {
            return false;
        }
        ++left;
        --right;
    }
    return true;
}

void _main()
{
    cint(n,m);
    cvec(m,ii);
    cvec(m,ss);
    if(n==1){
        int ans=inf;
        rep(i,m){
            ans=min(ans,ss[i]);
        }
        cout<<ans<<endl;
        exit(0);
    }
    int usiro=0,mae=0, sum=ss[0], ans = inf, gatiansa=-1,gatiansb=-1;
    map<int, int> list;
    list[ii[0]]=1;
    while(!list.empty()){
        //cout<<mae<<" "<<usiro<<endl;    
        //for(auto x:list){
        //        cout<<x.first<<":"<<x.second<<endl;
        //}
        if(list.size()==n){
            if(ans>sum){
                gatiansa=usiro+1;
                gatiansb=mae+2;
                ans=sum;
            }
            list[ii[usiro]]--;
            if(list[ii[usiro]]==0){
                list.erase(ii[usiro]);
            }
            sum-=ss[usiro];
            usiro++;
        }
        else if(list.size()<n){
            if(mae==m-1){
                list.clear();
                //cout<<"cleared"<<endl;
            }
            else{
                mae++;
                sum+=ss[mae];
                if(list.count(ii[mae])){
                    list[ii[mae]]++;
                }
                else{
                    list[ii[mae]]=1;
                }
            }
        }
        else{
            //例外ケース、来ないでください（懇願）
            //↑たくさん来たわ
            cout<<"例外"<<endl;
            cout<<mae<<" "<<usiro<<" "<<ans<<" "<<sum<<endl;
            for(auto x:list){
                cout<<x.first<<":"<<x.second<<endl;
            }
            exit(0);
        }
    }
    cout<<gatiansa<<" "<<gatiansb<<endl;
}

#else
#define MAIN
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

#if __has_include(<bits/stdc++.h>)
#include <bits/stdc++.h>
#else
import std;
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using modint10 = modint1000000007;
using motint9 = modint998244353;
#endif
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<string> strvec;

constexpr ll mod10 = 1000000007;
constexpr ll mod9 = 998244353;
constexpr ll inf = 10000000000000000;

#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repf(i, s, n) for (int i = s; i < (int)(n); i++)
template <class... Args>
void __y_input(Args &...arg)
{
    (cin >> ... >> arg);
}

template <class... Args>
void __y_input_vec_1(int p, Args &...args)
{
    (cin >> ... >> args[p]);
}
template <class Arg>
void __y_input_vec_resize(int size, Arg& arg)
{
    arg.resize(size);
}
template <class... Args>
void __y_input_vec(int n, Args &...args)
{
    (__y_input_vec_resize(n, args), ...);
    rep(i, n)
    {
        (__y_input_vec_1(i, args), ...);
    }
}

#define cint(...)  \
    int __VA_ARGS__; \
    __y_input(__VA_ARGS__)

#define cdbl(...)     \
    double __VA_ARGS__; \
    __y_input(__VA_ARGS__)

#define cstr(...)     \
    string __VA_ARGS__; \
    __y_input(__VA_ARGS__)

#define cit(t, ...) \
    t __VA_ARGS__;    \
    __y_input(__VA_ARGS__)

#define cvec(n, ...)       \
    vector<int> __VA_ARGS__; \
    __y_input_vec(n, __VA_ARGS__)

#define cvect(t, n, ...) \
    vector<t> __VA_ARGS__; \
    __y_input_vec(n, __VA_ARGS__)

#define last cout << endl
#define yn(bl) (bl ? "Yes" : "No")

ostream& yesno(bool bl)
{
    cout << yn(bl);
    return cout;
}
typedef array<int, 2> xy;
typedef array<int, 3> xyz;

template <typename T>
inline void sort(T& vec)
{
    return sort(vec.begin(), vec.end());
}
template <typename T>
inline void rsort(T& vec)
{
    return sort(vec.rbegin(), vec.rend());
}

namespace __yc
{
    template <typename T>
    struct __set : public std::set<T>
    {
        inline void Merge(set<T>& other)
        {
            if (this->size() < other.size())
            {
                other.merge(*this);
                swap(*this, other);
            }
            else
            {
                this->merge(other);
            }
            return;
        }
    };
    template <typename T>
    struct set : public __set<T>
    {
        inline void merge(set<T>& other)
        {
            this->Merge(other);
        }
    };
}

#define set __yc::set

void _main();
signed main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    _main();
    return 0;
}

#endif

結果

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

テストセット

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

詳細結果

テストケース	結果	実行時間	メモリ
1_1.txt	AC	3 ms	3708 KiB
1_10.txt	AC	14 ms	3840 KiB
1_2.txt	AC	4 ms	3708 KiB
1_3.txt	AC	3 ms	3748 KiB
1_4.txt	AC	3 ms	3892 KiB
1_5.txt	AC	2 ms	3732 KiB
1_6.txt	AC	3 ms	3848 KiB
1_7.txt	AC	3 ms	3748 KiB
1_8.txt	AC	2 ms	3736 KiB
1_9.txt	AC	2 ms	3768 KiB
2_1.txt	AC	65 ms	6376 KiB
2_10.txt	AC	362 ms	12160 KiB
2_2.txt	AC	190 ms	20048 KiB
2_3.txt	AC	168 ms	19940 KiB
2_4.txt	AC	172 ms	9976 KiB
2_5.txt	AC	275 ms	11408 KiB
2_6.txt	AC	89 ms	5532 KiB
2_7.txt	AC	100 ms	10572 KiB
2_8.txt	AC	173 ms	16912 KiB
2_9.txt	AC	148 ms	6880 KiB