Submission #1214999

#TimeUsernameProblemLanguageResultExecution timeMemory
1214999mychecksedadAsceticism (JOI18_asceticism)C++20
4 / 100
1094 ms332 KiB
/* Author : Mychecksdead */ #include<bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' #define ff first #define ss second #define pii pair<int,int> #define vi vector<int> const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30; int n, k; void solve(){ cin >> n >> k; vi v; for(int i = 1; i <= n; ++i){ v.pb(i-1); } int ans = 0; do{ int cnt = 0, cur = 0; vi pos(n); for(int i = 0; i < v.size(); ++i){ pos[v[i]] = i; } cnt = 1; for(int i = 1; i < n; ++i) cnt += pos[i] < pos[i - 1]; ans += cnt == k; }while(next_permutation(all(v))); cout << ans; } int main(){ cin.tie(0); ios::sync_with_stdio(0); int tt = 1, aa; // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); while(tt--){ solve(); en; } cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...