oj.uz

Submission #719087

# Submission time Handle Problem Language Result Execution time Memory
719087 2023-04-05T10:28:04 Z MohammadAghil Asceticism (JOI18_asceticism) C++17
4 / 100
 136 ms 452 KB 
      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
 using namespace std;
  typedef long long ll;
   typedef pair<ll, int> pp;
     #define per(i,r,l) for(int i = (r); i >= (l); i--)
       #define rep(i,l,r) for(int i = (l); i < (r); i++)
          #define all(x) begin(x), end(x)
             #define sz(x) (int)(x).size()
                 #define pb push_back
                     #define ss second
                          #define ff first
                                  void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
void IOS(){
     cin.tie(0) -> sync_with_stdio(0);
     #ifndef ONLINE_JUDGE
          #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
          // freopen("inp.txt", "r", stdin);
          // freopen("out.txt", "w", stdout);
     #else
          #define er(args ...) 0
     #endif
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 998244353, maxn = 1e3 + 5, maxm = 21, sq = 450, lg = 22, inf = ll(1e18) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll,md);return k*k%md*(b&1ll?a:1)%md;}

int slv(vector<int> a){
     int res = 1;
     rep(i,1,sz(a)){
          if(a[i] < a[i - 1]) res++;
     }
     return res;
}

int main(){ IOS();
     int n, k; cin >> n >> k;
     assert(n <= 10);
     vector<int> a(n);
     iota(all(a), 0);
     int ans = 0;
     do{
          ans += slv(a) == k;
     } while(next_permutation(all(a)));
     cout << ans << '\n';
     return 0-0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 136 ms 304 KB Output is correct
3 Correct 121 ms 300 KB Output is correct
4 Correct 130 ms 304 KB Output is correct
5 Correct 130 ms 308 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 136 ms 304 KB Output is correct
3 Correct 121 ms 300 KB Output is correct
4 Correct 130 ms 304 KB Output is correct
5 Correct 130 ms 308 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Runtime error 1 ms 452 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 136 ms 304 KB Output is correct
3 Correct 121 ms 300 KB Output is correct
4 Correct 130 ms 304 KB Output is correct
5 Correct 130 ms 308 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Runtime error 1 ms 452 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 136 ms 304 KB Output is correct
3 Correct 121 ms 300 KB Output is correct
4 Correct 130 ms 304 KB Output is correct
5 Correct 130 ms 308 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Runtime error 1 ms 452 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -