Submission #399033

#	Time	Username	Problem	Language	Result	Execution time	Memory
399033		galca	The Collection Game (BOI21_swaps)	C++14	0 / 100	1 ms	200 KiB

swaps

#include "swaps.h"
//#include <vector>
using namespace std;

void solve(int N, int V) {
   vector<int> res(N);
   for (int i=0; i<N; i++) {
	  res[i] = i+1;
   }  

   for (int k = 2; k <= N; k *= 2) {
      for (int j = k/2; j > 0; j /= 2) { 
         for (int i = 0; i < N; i++) {
             int ip = i ^ j; 
             if (ip > i) {
				 if ((i ^ k) < i) schedule(res[ip], res[i]);
				 else schedule(res[i], res[ip]);
             }
         }

		 vector<int> v = visit();

		 int idx = 0;
  		for (int i = 0; i < N; i++) {
		   int ip = i ^ j; 
           if (ip > i) {
			  if (v[idx++] == 0) {
				  int tmp = res[i];
				  res[i] = res[ip];
				  res[ip] = tmp; 
			  }
           }
		}
      }
   }
   answer(res);
}

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