Submission #854364

#	Time	Username	Problem	Language	Result	Execution time	Memory
854364		mychecksedad	The Collection Game (BOI21_swaps)	C++17	Compilation error	0 ms	0 KiB

swaps

#include<swap.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
/**
 * schedules to compare the art in rooms i and j during your next visit to
 * the museum (1 ≤ i, j ≤ N, i ≠ j). Immediately after a call to this function,
 * the museum can decide to swap the art collections of rooms i and j.
 */
void schedule(int a, int b);

/**
 * visits the museum and performs all scheduled comparisons. This function
 * returns an array with exactly one entry for each scheduled comparison
 * since your last visit to the museum (that is, for each call to schedule
 * since the last call to visit or the beginning of the program).
 * The entry at index k is 1 if the art in room i has a higher aesthetic
 * value than in room j, and 0 otherwise. Here, i and j are the rooms
 * from the (k + 1)-th scheduled comparison.
 */
vector<int> visit();

/**
 * publishes your list of all the rooms of the museum ordered by decreasing
 * aesthetic value. r must be an array of length N with its i-th entry being
 * the room with the (i + 1)-th most aesthetic art collection at the end of
 * your last visit to the museum. You have to call this function exactly once;
 * your program will be automatically terminated afterwards.
 */
void answer(std::vector<int>);

vector<int> B;

void solv(int l, int r){
	sort(B.begin() + l - 1, B.begin() + r, [&](const int &x, const int &y){
		schedule(x, y);
		vector<int> f = visit();
		return !f[0];
	});
}

void solve(int N, int V){
	for(int i = 1; i <= N; ++i) B.pb(i);
	solv(1, N);
	answer(B);
}

Compilation message (stderr)

swaps.cpp:1:9: fatal error: swap.h: No such file or directory
    1 | #include<swap.h>
      |         ^~~~~~~~
compilation terminated.