oj.uz

Submission #47463

# Submission time Handle Problem Language Result Execution time Memory
47463 2018-05-03T09:57:40 Z Talant Asceticism (JOI18_asceticism) C++17
4 / 100
 56 ms 788 KB 
#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long

using namespace std;

const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;

int n,k;
int a[N];
int ans;

main() {
      cin >> n >> k;

      if (n <= 10) {
            for (int i = 1; i <= n; i ++)
                  a[i] = i;

            do {
                  int c = 0;
                  for (int i = 2; i <= n; i ++) {
                        if (a[i - 1] > a[i])
                              c ++;
                  }
                  if (c == k - 1)
                        ans ++;

            }while(next_permutation(a + 1,a + n + 1));
            cout << ans << endl;
      }
}

Compilation message

asceticism.cpp:20:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 54 ms 616 KB Output is correct
3 Correct 56 ms 664 KB Output is correct
4 Correct 51 ms 664 KB Output is correct
5 Correct 53 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 7 ms 772 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 788 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 54 ms 616 KB Output is correct
3 Correct 56 ms 664 KB Output is correct
4 Correct 51 ms 664 KB Output is correct
5 Correct 53 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 7 ms 772 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 788 KB Output is correct
11 Incorrect 2 ms 788 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 54 ms 616 KB Output is correct
3 Correct 56 ms 664 KB Output is correct
4 Correct 51 ms 664 KB Output is correct
5 Correct 53 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 7 ms 772 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 788 KB Output is correct
11 Incorrect 2 ms 788 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 54 ms 616 KB Output is correct
3 Correct 56 ms 664 KB Output is correct
4 Correct 51 ms 664 KB Output is correct
5 Correct 53 ms 696 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 7 ms 772 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 784 KB Output is correct
10 Correct 2 ms 788 KB Output is correct
11 Incorrect 2 ms 788 KB Output isn't correct
12 Halted 0 ms 0 KB -