/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 512.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 2ms 512.0 KiB
#4 Accepted 2ms 392.0 KiB
#5 Accepted 2ms 524.0 KiB
#6 Wrong Answer 1ms 536.0 KiB
#7 Accepted 1ms 320.0 KiB
#8 Wrong Answer 2ms 536.0 KiB

Code

// Link ->
// Author -> Efat Sikder, IUBAT
#include "bits/stdc++.h"
using namespace std;

typedef long long int ll;
typedef unsigned long long l1;
typedef double db;

#define pi acos(-1)
#define prDouble(x, y) fixed << setprecision(y) << x
#define lcm(a, b) ((a * b) / __gcd(a, b))
#define fast_io                       \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define mm(x, v) memset((x), v, sizeof(x));
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define nl << "\n"
#define debug(x) cout << #x << " = " << x nl
#define casePrint(ans, cn) cout << "Case " << cn << ": " << ans nl

void solve(int caseNumber)
{
    ll n, k;
    cin >> n >> k;
    vector<ll> v(n + 5);
    pair<ll, ll> range = {-1, -1};
    for (ll i = 1; i <= n; i++)
        cin >> v[i];
    bool ans = true;
    set<ll> s;
    for (ll i = 1; i < n;)
    {
        if (v[i] > v[i + 1])
        {
            for (ll j = 0; j < k; j++)
            {
                s.insert(v[i + j]);
            }
            if (range.first == -1)
                range = {i, i + k - 1};
            for (auto x : s)
            {
                v[i] = x;
                i++;
            }
            s.clear();
        }
        else
        {
            i++;
        }
    }
    for (ll i = 1; i < n; i++)
    {
        if (v[i] > v[i + 1])
        {
            ans = false;
            break;
        }
    }
    if (ans)
        cout << "YES\n";
    else
        cout << "NO\n";
    if (ans)
    {
        cout << range.first << " " << range.second nl;
    }
}

void init_code()
{
    fast_io;
}

signed main()
{
    init_code();
    int testcase = 1;
    // cin >> testcase;
    for (int caseNumber = 1; caseNumber <= testcase; ++caseNumber)
    {
        solve(caseNumber);
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1120 Stairway to the Skyline
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 15:09:17
Judged At
2024-11-11 02:31:22
Judged By
Score
15
Total Time
2ms
Peak Memory
536.0 KiB