oj.uz

답안 #645883

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
645883 2022-09-28T08:41:47 Z TimDee NoM (RMI21_nom) C++17
9 / 100
 448 ms 312 KB 
#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.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 0 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 4 ms 212 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 200 ms 212 KB Output is correct
10 Correct 448 ms 300 KB Output is correct

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 0 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 4 ms 212 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 200 ms 212 KB Output is correct
10 Correct 448 ms 300 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 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 0 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 4 ms 212 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 200 ms 212 KB Output is correct
10 Correct 448 ms 300 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 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 0 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 4 ms 212 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 200 ms 212 KB Output is correct
10 Correct 448 ms 300 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 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 0 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 4 ms 212 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 200 ms 212 KB Output is correct
10 Correct 448 ms 300 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -