Submission #1562079
Source Code Expand
#include <iostream>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
// #include <unordered_map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;
#ifdef DEBUG
#define NDEBUG
#endif
#undef NDEBUG
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define INTSPACE 11
char _buf[INTSPACE*1000000 + 3]; // ここ要確認
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
int solve(int N, vector<int>& a) {
rep(i, N) --a[i];
int sw = 0;
int i=0;
while (i < N-3) {
if (a[i] != i) { ++i; continue; }
if (a[i] == i) { ++sw; i+=2; }
}
assert(i==N-2 || i==N-3);
if (i == N-2) {
if (a[N-2] == N-2 || a[N-1] == N-1) ++sw;
} else if (i == N-3) {
if (a[i] == N-3) {
++sw;
if (a[N-1] == N-1) ++sw;
} else {
if (a[N-2] == N-2 || a[N-1] == N-1) ++sw;
}
}
return sw;
}
int main() {
int N = loadint();
vector<int> a;
loadvec(a, N);
int ans = solve(N, a);
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Derangement |
User |
naoya_t |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
2875 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
1152 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
0_002.txt |
AC |
1 ms |
256 KB |
0_003.txt |
AC |
1 ms |
256 KB |
1_004.txt |
AC |
1 ms |
256 KB |
1_005.txt |
AC |
4 ms |
1152 KB |
1_006.txt |
AC |
4 ms |
1152 KB |
1_007.txt |
AC |
4 ms |
1152 KB |
1_008.txt |
AC |
4 ms |
1152 KB |
1_009.txt |
AC |
4 ms |
1152 KB |
1_010.txt |
AC |
4 ms |
1152 KB |
1_011.txt |
AC |
4 ms |
1152 KB |
1_012.txt |
AC |
4 ms |
1152 KB |
1_013.txt |
AC |
5 ms |
1152 KB |
1_014.txt |
AC |
4 ms |
1152 KB |