oj.uz

Submission #47469

# Submission time Handle Problem Language Result Execution time Memory
47469 2018-05-03T10:39:46 Z Just_Solve_The_Problem Asceticism (JOI18_asceticism) C++11
4 / 100
 313 ms 648 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random rand() ^ (rand() << 5)

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

int n, k;
int a[N], b[N];
int dp[N];
int pr[N], used[N];

main() {
  scanf("%d %d", &n, &k);
  if (n > 10) return 0;
  for (int i = 1; i <= n; i++) {
    a[i] = i;
  }
  int ans = 0;
  do {
    int res = 0;
    int c = 1;
    while (c <= n) {
      for (int i = 1; i <= n; i++) {
        if (a[i] == c) {
          c++;
        }
      }
      res++;
    }
    if (res == k) {
      ans++;
    }
  } while (next_permutation(a + 1, a + n + 1));
  cout << ans;
}

Compilation message

asceticism.cpp:27:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
asceticism.cpp: In function 'int main()':
asceticism.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &k);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 307 ms 376 KB Output is correct
3 Correct 302 ms 428 KB Output is correct
4 Correct 313 ms 556 KB Output is correct
5 Correct 303 ms 564 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 27 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 648 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 307 ms 376 KB Output is correct
3 Correct 302 ms 428 KB Output is correct
4 Correct 313 ms 556 KB Output is correct
5 Correct 303 ms 564 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 27 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 648 KB Output is correct
11 Incorrect 2 ms 648 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 307 ms 376 KB Output is correct
3 Correct 302 ms 428 KB Output is correct
4 Correct 313 ms 556 KB Output is correct
5 Correct 303 ms 564 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 27 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 648 KB Output is correct
11 Incorrect 2 ms 648 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 307 ms 376 KB Output is correct
3 Correct 302 ms 428 KB Output is correct
4 Correct 313 ms 556 KB Output is correct
5 Correct 303 ms 564 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 27 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 648 KB Output is correct
11 Incorrect 2 ms 648 KB Output isn't correct
12 Halted 0 ms 0 KB -