From b4f997aeffe40bd0c0f3732c366cd90553272f2c Mon Sep 17 00:00:00 2001 From: kalim-Asim Date: Tue, 24 Dec 2024 13:11:38 +0530 Subject: [PATCH 1/2] task3 solved --- Tasks/Task3_Uttu/kalim-Asim.cpp | 42 +++++++++++++++++++++++++++++++++ 1 file changed, 42 insertions(+) create mode 100644 Tasks/Task3_Uttu/kalim-Asim.cpp diff --git a/Tasks/Task3_Uttu/kalim-Asim.cpp b/Tasks/Task3_Uttu/kalim-Asim.cpp new file mode 100644 index 0000000..78aedb0 --- /dev/null +++ b/Tasks/Task3_Uttu/kalim-Asim.cpp @@ -0,0 +1,42 @@ +#include +using namespace std; + +#define MOD 1000000007 +#define int long long int +#define pb push_back +#define MAX LLONG_MAX +#define MIN LLONG_MIN +#define vi vector +#define mii map +#define pii pair +#define no cout << "NO\n" +#define yes cout << "YES\n" +#define sz(x) ((int)(x).size()) +#define all(x) (x).begin(), (x).end() +#define vin(a) for(int i = 0; i < (a).size(); ++i) cin >> a[i]; +#define vout(a) for(int i = 0; i < (a).size(); ++i) cout << a[i] << ' '; + +void solve() { + int n, x; + cin >> n >> x; + vi a(n); + vin(a); + vi v(a); + sort(all(v)); + bool ans = 1; + if (x >= n && !is_sorted(all(a))) + ans = 0; + + for(int i = n - x; i < min(n,x); i++) + ans &= v[i] == a[i]; + + if (ans) yes; + else no; +} + +signed main() { + int t = 1; + // cin >> t; + while (t--) solve(); + return 0; +} From 5b03e4ce726467057eefdbeda824ef5f4e9c0ee3 Mon Sep 17 00:00:00 2001 From: kalim-Asim Date: Tue, 24 Dec 2024 13:14:13 +0530 Subject: [PATCH 2/2] Update kalim-Asim.cpp --- Tasks/Task3_Uttu/kalim-Asim.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Tasks/Task3_Uttu/kalim-Asim.cpp b/Tasks/Task3_Uttu/kalim-Asim.cpp index 78aedb0..70a8ebb 100644 --- a/Tasks/Task3_Uttu/kalim-Asim.cpp +++ b/Tasks/Task3_Uttu/kalim-Asim.cpp @@ -27,7 +27,7 @@ void solve() { if (x >= n && !is_sorted(all(a))) ans = 0; - for(int i = n - x; i < min(n,x); i++) + for(int i = n - x; i < x; i++) ans &= v[i] == a[i]; if (ans) yes;