답안 #992528

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992528	2024-06-04T14:45:49 Z	Abito	NoM (RMI21_nom)	C++17	0 / 100	1 ms	456 KB

Main

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=20;
int n,m,b[N];
pair<int,int> a[N];
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>m;
    for (int i=1;i<=n;i++) a[i]={i,1};
    for (int i=1+n;i<=n*2;i++) a[i]={i-n,2};
    sort(a+1,a+1+2*n);
    int ans=0;
    do{
        //for (int i=1;i<=2*n;i++) cout<<a[i].F<<' ';
        //cout<<endl;
        memset(b,0,sizeof(b));
        bool ok=true;
        for (int i=1;i<=2*n;i++){
            if (b[a[i].F]) ok&=((i-b[a[i].F])%m);
            else b[a[i].F]=i;
        }ans+=ok;
    }while (next_permutation(a+1,a+1+2*n));
    cout<<ans<<endl;
    return 0;
}

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	1 ms	348 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #2

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	1 ms	348 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	1 ms	348 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #4

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	1 ms	348 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #5

0 / 48.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Incorrect	1 ms	348 KB	Output isn't correct
7	Halted	0 ms	0 KB	-