Submission #645558

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
645558	2022-09-27T10:43:09 Z	Vanilla	NoM (RMI21_nom)	C++17	9 / 100	500 ms	296 KB

Main

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

int main() {
    int n,m;
    cin >> n >> m;
    vector <int> v(2 * n);
    for (int i = 0; i < n * 2; i++){
        v[i] = i;
    }
    int rs = 0;
    do {
        bool f = 1;
        int p[2 * n] = {};
        for (int i = 0; i < n * 2; i++){
            p[v[i]] = i;
        }
        for (int i = 0; i < n; i++){
            if (abs(p[i] - p[i + n]) % m == 0) f = 0;
        }
        rs+=f;
    } while (next_permutation(v.begin(), v.end()));
    cout << rs << "\n";
}

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	2 ms	212 KB	Output is correct
9	Correct	160 ms	296 KB	Output is correct
10	Correct	159 ms	276 KB	Output is correct

Subtask #2

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	2 ms	212 KB	Output is correct
9	Correct	160 ms	296 KB	Output is correct
10	Correct	159 ms	276 KB	Output is correct
11	Execution timed out	1093 ms	212 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	2 ms	212 KB	Output is correct
9	Correct	160 ms	296 KB	Output is correct
10	Correct	159 ms	276 KB	Output is correct
11	Execution timed out	1093 ms	212 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	2 ms	212 KB	Output is correct
9	Correct	160 ms	296 KB	Output is correct
10	Correct	159 ms	276 KB	Output is correct
11	Execution timed out	1093 ms	212 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 48.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	2 ms	212 KB	Output is correct
8	Correct	2 ms	212 KB	Output is correct
9	Correct	160 ms	296 KB	Output is correct
10	Correct	159 ms	276 KB	Output is correct
11	Execution timed out	1093 ms	212 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-