Submission #2150345
Source Code Expand
#include<bits/stdc++.h> using namespace std; int N,Q; int fid[100010]; bool in[100010]; int main() { scanf("%d%d",&N,&Q); in[1] = in[2] = true; int now = 1; for(int i = 1; i <= N; i++)fid[i] = i; for(int i = 0; i < Q; i++) { int a,b; scanf("%d%d",&a,&b); swap(fid[a],fid[b]); if(now == a)now = b; else if(now == b)now = a; in[fid[now + 1]] = in[fid[now - 1]] = true; } int ans = 0; for(int i = 1; i <= N; i++)if(in[i])ans++; printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | G - Magician |
User | unit |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 580 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&N,&Q); ^ ./Main.cpp:17:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&a,&b); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 18 ms | 640 KB |
subtask1_02.txt | AC | 18 ms | 640 KB |
subtask1_03.txt | AC | 18 ms | 640 KB |
subtask1_04.txt | AC | 18 ms | 640 KB |
subtask1_05.txt | AC | 18 ms | 640 KB |
subtask1_06.txt | AC | 18 ms | 640 KB |
subtask1_07.txt | AC | 18 ms | 640 KB |
subtask1_08.txt | AC | 18 ms | 640 KB |
subtask1_09.txt | AC | 18 ms | 640 KB |
subtask1_10.txt | AC | 18 ms | 640 KB |
subtask1_11.txt | AC | 18 ms | 640 KB |
subtask1_12.txt | AC | 18 ms | 640 KB |
subtask1_13.txt | AC | 18 ms | 640 KB |
subtask1_14.txt | AC | 18 ms | 640 KB |
subtask1_15.txt | AC | 18 ms | 640 KB |
subtask1_16.txt | AC | 18 ms | 640 KB |
subtask1_17.txt | AC | 18 ms | 640 KB |
subtask1_18.txt | AC | 18 ms | 640 KB |
subtask1_19.txt | AC | 18 ms | 640 KB |