Submission #558002

#	Time	Username	Problem	Language	Result	Execution time	Memory
558002		AdamGS	The Collection Game (BOI21_swaps)	C++17	21 / 100	494 ms	564 KiB

swaps

#include "swaps.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=507;
int T[LIM];
void solve(int n, int v) {
	rep(i, n) T[i]=i;
	while(v--) {
		vector<pair<int,int>>V;
		for(int i=v%2; i+1<n; i+=2) {
			schedule(T[i]+1, T[i+1]+1);
			V.pb({i, i+1});
		}
		vector<int>P=visit();
		rep(i, P.size()) if(!P[i]) swap(T[V[i].st], T[V[i].nd]);
	}
	vector<int>ans;
	rep(i, n) rep(j, n) if(T[j]==i) ans.pb(i+1);
	answer(ans);
}

Compilation message (stderr)

swaps.cpp: In function 'void solve(int, int)':
swaps.cpp:6:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
swaps.cpp:22:3: note: in expansion of macro 'rep'
   22 |   rep(i, P.size()) if(!P[i]) swap(T[V[i].st], T[V[i].nd]);
      |   ^~~

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