Submission #1594783


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double 
#define vpi vector<pair <int, int> >
#define vi vector<int>
#define vl vector<ll>
#define vpl vector<pair<ll, ll> >
#define pb push_back
#define mp make_pair
#define all(p) (p).begin(), (p).end()
#define fi first
#define se second
#define mem(a) memset(a, 0 , sizeof(a))
#define mod 1e9+7
#define inf 100000000007
#define N 100002
vi a(N);

int main(){
	ios_base::sync_with_stdio(NULL),cin.tie(NULL),cout.tie(NULL);
	int n, ma=0;
	cin >> n;
	
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}

	if(a[1] == 1){
		a[2] += a[1];
		a[1] = a[2] - a[1];
		a[2] -= a[1];
		ma++;
	}
	for(int i = 2; i < n; ++i) {
		if(a[i] == i) {
			ma++;
			if(a[i+1] != i) {
				a[i+1] += a[i];
				a[i] = a[i+1] - a[i];
				a[i+1] -= a[i];
			}
			else {
				a[i] += a[i-1];
				a[i-1] = a[i] - a[i-1];
				a[i] -= a[i-1];
			}
		}
	}
	if(a[n] == n) {
		ma++;
		a[n] += a[n-1];
		a[n-1] = a[n] - a[n-1];
		a[n] -= a[n-1];

	}

	cout << ma << "\n";
	return 0;
}

Submission Info

Submission Time
Task D - Derangement
User GodKira
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1091 Byte
Status AC
Exec Time 9 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 15
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 640 KB
0_001.txt AC 1 ms 640 KB
0_002.txt AC 1 ms 640 KB
0_003.txt AC 1 ms 640 KB
1_004.txt AC 1 ms 640 KB
1_005.txt AC 9 ms 640 KB
1_006.txt AC 9 ms 640 KB
1_007.txt AC 9 ms 640 KB
1_008.txt AC 9 ms 640 KB
1_009.txt AC 9 ms 640 KB
1_010.txt AC 9 ms 640 KB
1_011.txt AC 9 ms 640 KB
1_012.txt AC 9 ms 640 KB
1_013.txt AC 9 ms 640 KB
1_014.txt AC 9 ms 640 KB