Submission #399412

#	Time	Username	Problem	Language	Result	Execution time	Memory
399412		egorlifar	The Collection Game (BOI21_swaps)	C++17	100 / 100	7 ms	420 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";



vector<int> r;
vector<pair<int, int> > q;
 

void add(int i, int j) {
  	schedule(r[i], r[j]);
  	q.pb(mp(i, j));
}
 

void myVist() {
  	if (sz(q) == 0) {
    	return;
	}
  	vector<int> res = visit();
  	for (int i = 0; i < sz(res); i++) {
    	if (!res[i]) {
     		swap(r[q[i].first], r[q[i].second]);
    	}
	}	
 	q.clear();
}


void solve(int n, int v) {
	for (int i = 1; i <= n; i++) {
    	r.pb(i);
	}
  	for (int k = 2; k <= 2 * n; k <<= 1) {
    	for (int i = 0; i < n; i++) {
	      	int l = i ^ (k - 1);
	      	if (i < l && l < n) {
	        	add(i, l);
	      	}
    	}
    	myVist();
    	for (int j = k >> 2; j > 0; j >>= 1) {
      		for (int i = 0; i < n; i++) {
        		int l = i ^ j;
        		if (i < l && l < n) {
          			add(i, l);
        		}
      		}
      		myVist();
    	}
  	}
  	answer(r);
}	

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 3 / 3
• Subtask 4: 2 / 2
• Subtask 5: 9 / 9
• Subtask 6: 6 / 6
• Subtask 7: 9 / 9
• Subtask 8: 6 / 6
• Subtask 9: 21 / 21
• Subtask 10: 14 / 14
• Subtask 11: 9 / 9
• Subtask 12: 6 / 6