Submission #1557881
Source Code Expand
#include<stdio.h> #include<map> #include<cmath> #include<stdlib.h> #include<algorithm> #include<set> #include<vector> #include<queue> using namespace std; typedef pair<int,int> pii; typedef long long ll; const int MX = 100005; int N; int D[MX]; int main() { scanf("%d", &N); int ans = 0, cnt = 0, a; for(int i = 1; i <= N; i++){ scanf("%d", &a); if( a == i ) cnt++; else ans += (cnt+1) / 2, cnt = 0; }ans += (cnt+1) / 2; printf("%d\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | D - Derangement |
User | zigui |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 490 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:22:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:25:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a); ^
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 | 128 KB |
0_001.txt | AC | 1 ms | 128 KB |
0_002.txt | AC | 0 ms | 128 KB |
0_003.txt | AC | 0 ms | 128 KB |
1_004.txt | AC | 0 ms | 128 KB |
1_005.txt | AC | 9 ms | 128 KB |
1_006.txt | AC | 9 ms | 128 KB |
1_007.txt | AC | 9 ms | 128 KB |
1_008.txt | AC | 9 ms | 128 KB |
1_009.txt | AC | 9 ms | 128 KB |
1_010.txt | AC | 9 ms | 128 KB |
1_011.txt | AC | 9 ms | 128 KB |
1_012.txt | AC | 10 ms | 128 KB |
1_013.txt | AC | 10 ms | 128 KB |
1_014.txt | AC | 9 ms | 128 KB |