/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 548.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Wrong Answer 1ms 516.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Wrong Answer 1ms 324.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 1;
const int mxn = 1e3 + 3, mod = 1e9 + 7;

int32_t main()
{
    //fast;
//   w(t)
//   {
       int n;
       cin >> n;
       int k;
       cin >> k;
       int ar[n + 1];
       for(int i = 1; i <= n; i++)cin >> ar[i];
       int idx = 0, xdi = 0;
       bool f = true, ff = true;
       for(int i = 1, j = n; i <= n; i++, j--)
       {
           if(f and ar[i] != i)f = false, idx = i;
           if(ff and ar[j] != j)ff = false, xdi = j;
       }
       int dis = xdi - idx + 1;
       if(dis <= k)
       {
           cout <<"YES" << endl;
           cout << idx <<" "<< xdi << endl;
       }
       else cout <<"NO" << endl;
   //}


}

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:02:10
Judged At
2024-11-05 15:02:10
Judged By
Score
9
Total Time
1ms
Peak Memory
548.0 KiB