Submission #1016615

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

swaps

#include <bits/stdc++.h>
#include "swaps.h"
 
 
        using namespace std;
 
        vector<int> dcS(vector<int> A) {
            bool ok = false;
            int N = A.size();
            while(ok == false) {
                ok = true;
                for(int l = 0; l < N; l += 2) 
                    schedule(A[l], A[l + 1]);
                vector<int> K = visit();
                for(int l = 0, cur = 0; l < N; l += 2, cur++) {
                    if(K[cur] == 0) {
                        ok = false;
                        swap(A[l], A[l + 1]);
                    }
                }
 
                for(int l = 1; l < N; l += 2) 
                    schedule(A[l], A[l + 1]);
                K.clear(); K = visit();
                for(int l = 1, cur = 0; l < N; l += 2, cur++) {
                    if(K[cur] == 0) {
                        ok = false;
                        swap(A[l], A[l + 1]);
                    }
                }
            }
            return A;
        }
 
        void solve(int N, int V) {
            vector<int> res(N);
            for(int l = 0; l < N; l++)
                res[l] = l + 1;
            res = dcS(res);
            answer(res);
        }

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