# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1002235 | amine_aroua | The Collection Game (BOI21_swaps) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define pb push_back
#define nl '\n'
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i, x, y) for(int i = x;i<=y;i++)
#define forn(i, y, x) for(int i = y; i >= x; i--)
void schedule(int i, int j);
std::vector<int> visit();
void answer(std::vector<int> v);
void solve(int n, int v)
{
forr(i , 1 , n)
{
forr(j , i + 1 , n){
schedule(i , j);
}
}
visit();
vector<int> ret;
forr(i , 1 , n)
ret.pb(i);
answer(ret);
}