답안 #645877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
645877	2022-09-28T08:38:33 Z	TimDee	NoM (RMI21_nom)	C++17	0 / 100	500 ms	272 KB

Main

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

#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 steps=0;
	int ans=0;

	//next_permutation(s.begin(), s.end());
	int need=1;

	bitset<6> a[5];

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

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

int32_t main() {
	solve();
	return 0;
}

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	5 ms	212 KB	Output is correct
8	Correct	5 ms	212 KB	Output is correct
9	Execution timed out	504 ms	272 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #2

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	5 ms	212 KB	Output is correct
8	Correct	5 ms	212 KB	Output is correct
9	Execution timed out	504 ms	272 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	5 ms	212 KB	Output is correct
8	Correct	5 ms	212 KB	Output is correct
9	Execution timed out	504 ms	272 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	5 ms	212 KB	Output is correct
8	Correct	5 ms	212 KB	Output is correct
9	Execution timed out	504 ms	272 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 48.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	5 ms	212 KB	Output is correct
8	Correct	5 ms	212 KB	Output is correct
9	Execution timed out	504 ms	272 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-