Submission #1559167
Source Code Expand
#include <iostream> #include <iomanip> #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <string> #include <vector> #include <stack> #include <queue> #include <set> #include <map> #include <functional> #include <utility> #include <tuple> #include <cctype> #define INF 0x3f3f3f3f #define MOD 1000000007 #define PI 4*atan(1.0) typedef long long ll; typedef long double ld; using namespace std; int dx[4]={0,0,-1,1}; int dy[4]={-1,1,0,0}; const int SIZE=100050; //int arr[SIZE]={}; //ここまでテンプレ int main(){ int N; cin>>N; int ans=0,ren=0; for(int i=0;i<N;i++){ int p; cin>>p; if(p==i+1) ren++; else{ ans+=(ren+1)/2; ren=0; } //cout<<ren<<endl; } ans+=(ren+1)/2; ren=0; cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Derangement |
User | takeo1116 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 838 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 256 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 | 36 ms | 256 KB |
1_006.txt | AC | 36 ms | 256 KB |
1_007.txt | AC | 36 ms | 256 KB |
1_008.txt | AC | 36 ms | 256 KB |
1_009.txt | AC | 35 ms | 256 KB |
1_010.txt | AC | 36 ms | 256 KB |
1_011.txt | AC | 35 ms | 256 KB |
1_012.txt | AC | 36 ms | 256 KB |
1_013.txt | AC | 36 ms | 256 KB |
1_014.txt | AC | 35 ms | 256 KB |