# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
444038 | 2021-07-13T03:50:25 Z | yungyao | The Collection Game (BOI21_swaps) | C++17 | 0 ms | 0 KB |
using namespace std; #include <iostream> #include <algorithm> #include <queue> #include <stack> #include <map> #include <set> #include <utility> #include <vector> #include <memory.h> typedef long long LL; typedef pair<int,int> pii; #define F first #define S second #define mkp make_pair #define iter(x) x.begin(),x.end() #define MEM(s,e) memset(s,e,sizeof(s)) const int maxn = 0; #include <swaps.h> void solve(int n,int v){ for (int i=1;i<n;++i){ for (int j=i;j<n;++j){ schedule(j,j+1); } visit(); } vector <int> ret(n); for (int i=0;i<n;++i) ret[i] = i+1; return ret; }