Submission #6588394


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/














int N, P[50], Q[50];
//---------------------------------------------------------------------------------------------------
bool check(int* v) {
	rep(i, 0, N) if (v[i] != i + 1) return false;
	return true;
}
//---------------------------------------------------------------------------------------------------
#define yes "YES"
#define no "NO"
string solve() {
	if (check(P)) return yes;

	rep(i, 0, N) rep(j, i + 1, N) {
		rep(k, 0, N) Q[k] = P[k];
		swap(Q[i], Q[j]);
		if (check(Q)) return yes;
	}

	return no;
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N;
	rep(i, 0, N) cin >> P[i];
	cout << solve() << endl;
}





Submission Info

Submission Time
Task B - 0 or 1 Swap
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 200
Code Size 2019 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All Sample
Score / Max Score 200 / 200 0 / 0
Status
AC × 16
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_0, testcase_1, testcase_10, testcase_11, testcase_2, testcase_3, testcase_4, testcase_5, testcase_6, testcase_7, testcase_8, testcase_9, testcase_add1
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_0 AC 1 ms 256 KB
testcase_1 AC 1 ms 256 KB
testcase_10 AC 1 ms 256 KB
testcase_11 AC 1 ms 256 KB
testcase_2 AC 1 ms 256 KB
testcase_3 AC 1 ms 256 KB
testcase_4 AC 1 ms 256 KB
testcase_5 AC 1 ms 256 KB
testcase_6 AC 1 ms 256 KB
testcase_7 AC 1 ms 256 KB
testcase_8 AC 1 ms 256 KB
testcase_9 AC 1 ms 256 KB
testcase_add1 AC 1 ms 256 KB