Submission #2173903
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <cstdio> #include <vector> #include <queue> #include <set> #include <numeric> #include <cmath> using namespace std; typedef long long int lld; const lld mod = 1e9+7; const lld INF = 1e9; //const lld MAXN = 1e9; int main() { int n; cin >> n; vector<int> p(n); for(int i = 0; i < n; i++) { cin>>p[i]; } for(int i = 0; i < n; i++) { p[i]--; } int ans = 0; for(int i = 0; i < n; i++) { if (p[i] == i) { if (i == n-1) { int sw = p[i]; p[i] = p[i-1]; p[i-1] = sw; ans++; }else { int sw = p[i]; p[i] = p[i+1]; p[i+1] = sw; ans++; } } } cout << ans << endl; return 0; } // 12345 // 21345 // 21435 // 21453 // 21435 // 1234567 // 2134567 // 2143567 // 2143657 // 2143675
Submission Info
Submission Time | |
---|---|
Task | D - Derangement |
User | ykmaku |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 880 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 640 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 | 29 ms | 640 KB |
1_006.txt | AC | 29 ms | 640 KB |
1_007.txt | AC | 29 ms | 640 KB |
1_008.txt | AC | 29 ms | 640 KB |
1_009.txt | AC | 29 ms | 640 KB |
1_010.txt | AC | 29 ms | 640 KB |
1_011.txt | AC | 29 ms | 640 KB |
1_012.txt | AC | 29 ms | 640 KB |
1_013.txt | AC | 29 ms | 640 KB |
1_014.txt | AC | 29 ms | 640 KB |