Submission #733813

#TimeUsernameProblemLanguageResultExecution timeMemory
733813vjudge1Cryptography (NOI20_crypto)C++17
48 / 100
1070 ms6720 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; constexpr int mod = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } auto b = a; sort(b.begin(), b.end()); for (int i = 0; i < n; i++) { a[i] = lower_bound(b.begin(), b.end(), a[i]) - b.begin(); } vector<int> fac(n + 1); fac[0] = 1; for (int i = 1; i <= n; i++) { fac[i] = 1LL * fac[i - 1] * i % mod; } int ans = 1; for (int i = 0; i < n; i++) { ans = (ans + 1LL * (a[i] - i) * fac[n - i - 1] % mod) % mod; for (int j = i + 1; j < n; j++) { if (a[j] < a[i]) { a[j]++; } } } cout << ans << "\n"; return 6/22; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...