oj.uz

답안 #569609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569609 2022-05-27T14:43:06 Z Abrar_Al_Samit 캥거루 (CEOI16_kangaroo) C++17
6 / 100
 2000 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;


void PlayGround() {
  int n, cs, cf;
  cin>>n>>cs>>cf;

  vector<int>a(n);
  iota(a.begin(), a.end(), 1);

  int cnt = 0;
  do {
    bool ok = 1;
    ok &= a[0]==cs && a[n-1]==cf;
    for(int i=1; i<n-1; ++i) {
      if(a[i-1]<a[i] && a[i]<a[i+1]) ok = 0;
      if(a[i-1]>a[i] && a[i]>a[i+1]) ok = 0;
    }
    cnt += ok;
  } while(next_permutation(a.begin(), a.end()));

  cout<<cnt<<'\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 2087 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 2087 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 2087 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -