Submission #1316756
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
// #define DEBUG
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int n, Q; cin >> n >> Q;
Q++;
vi a(Q), b(Q); rep(i, Q - 1) cin >> a[i] >> b[i], a[i]--, b[i]--;
a[Q - 1] = b[Q - 1] = 0;
vi to(n); rep(i, n) to[i] = i;
rrep(i, Q){
swap(to[a[i]], to[b[i]]);
}
int pos = 0;
set<int> s;
rep(i, Q){
// magic
if(pos + 1 < n) s.insert(to[pos + 1]);
if(pos - 1 >=0) s.insert(to[pos - 1]);
// no magic
if(pos == a[i]) pos = b[i];
else if(pos == b[i]) pos = a[i];
swap(to[a[i]], to[b[i]]);
}
s.insert(pos);
cout << s.size() << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
G - Magician |
User |
nokoTaro |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2454 Byte |
Status |
AC |
Exec Time |
20 ms |
Memory |
1536 KB |
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 |
1408 KB |
subtask1_02.txt |
AC |
18 ms |
1408 KB |
subtask1_03.txt |
AC |
18 ms |
1408 KB |
subtask1_04.txt |
AC |
18 ms |
1408 KB |
subtask1_05.txt |
AC |
18 ms |
1536 KB |
subtask1_06.txt |
AC |
18 ms |
1408 KB |
subtask1_07.txt |
AC |
20 ms |
1408 KB |
subtask1_08.txt |
AC |
20 ms |
1408 KB |
subtask1_09.txt |
AC |
19 ms |
1408 KB |
subtask1_10.txt |
AC |
19 ms |
1408 KB |
subtask1_11.txt |
AC |
19 ms |
1408 KB |
subtask1_12.txt |
AC |
19 ms |
1408 KB |
subtask1_13.txt |
AC |
19 ms |
1408 KB |
subtask1_14.txt |
AC |
18 ms |
1408 KB |
subtask1_15.txt |
AC |
19 ms |
1408 KB |
subtask1_16.txt |
AC |
19 ms |
1408 KB |
subtask1_17.txt |
AC |
19 ms |
1408 KB |
subtask1_18.txt |
AC |
18 ms |
1408 KB |
subtask1_19.txt |
AC |
18 ms |
1408 KB |