Submission #645883

#	Time	Username	Problem	Language	Result	Execution time	Memory
645883		TimDee	NoM (RMI21_nom)	C++17	9 / 100	448 ms	312 KiB

Main

#include <bits/stdc++.h>
using namespace std;

//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")

#define forn(i,n) for (int i=0; i<n; ++i)

void solve() {
	int n,m; cin>>n>>m;
	if (n>5) return;
	vector<int>s;
	forn(i,2*n) s.push_back(i+1);
	int ans=0;

	int need=1;

	bitset<6> a[5];

	forn(i,2*n) need*=i+1;
	while (need--) {
		int paiu=1;
		
		forn(i,5) a[i].reset();
		forn(i,2*n) {
			if (a[i%m][s[i]%n]) {paiu=0; break;}
			a[i%m].set(s[i]%n);
		}

		ans+=paiu;
		next_permutation(s.begin(), s.end());
	}
	cout<<ans;
}

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 18
• Subtask 5: 0 / 48