oj.uz

Submission #693707

# Submission time Handle Problem Language Result Execution time Memory
693707 2023-02-03T07:18:53 Z saayan007 Cryptography (NOI20_crypto) C++17
16 / 100
 37 ms 7364 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

const ll mod = 1e9L + 7;
const ll mxn = 3e5L + 5;

ll n;
pl p[mxn];

ll mul(const ll &a, const ll &b) {
    ll c = (a % mod) * (b % mod);
    c %= mod;
    if(c < 0)
        c += mod;
    return c;
}

ll sum(const ll &a, const ll &b) {
    ll c = (a % mod) + (b % mod);
    c %= mod;
    if(c < 0)
        c += mod;
    return c;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    fur(i, 1, n) {
        cin >> p[i].fr;
        p[i].sc = i;
    }
    sort(p + 1, p + n + 1);
    ll a[n + 1];
    fur(i, 1, n) {
        a[p[i].sc] = i;
    }

    ll res = 1;
    ll k = a[1];
    fur(i, 1, n - 1) {
        res = mul(res, i);
    }
    res = mul(res, k - 1);
    res = sum(res, 1ll);
    cout << res << nl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 34 ms 7332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 7244 KB Output is correct
3 Correct 32 ms 7340 KB Output is correct
4 Correct 29 ms 7252 KB Output is correct
5 Correct 37 ms 7332 KB Output is correct
6 Correct 28 ms 7328 KB Output is correct
7 Correct 32 ms 7236 KB Output is correct
8 Correct 29 ms 7328 KB Output is correct
9 Correct 30 ms 7224 KB Output is correct
10 Correct 29 ms 7364 KB Output is correct
11 Correct 28 ms 7296 KB Output is correct
12 Correct 27 ms 7324 KB Output is correct
13 Correct 29 ms 7244 KB Output is correct
14 Correct 36 ms 7280 KB Output is correct
15 Correct 31 ms 7328 KB Output is correct
16 Correct 31 ms 7348 KB Output is correct
17 Correct 29 ms 7292 KB Output is correct
18 Correct 30 ms 7288 KB Output is correct
19 Correct 31 ms 7224 KB Output is correct
20 Correct 35 ms 7284 KB Output is correct
21 Correct 29 ms 7244 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 7244 KB Output is correct
3 Correct 32 ms 7340 KB Output is correct
4 Correct 29 ms 7252 KB Output is correct
5 Correct 37 ms 7332 KB Output is correct
6 Correct 28 ms 7328 KB Output is correct
7 Correct 32 ms 7236 KB Output is correct
8 Correct 29 ms 7328 KB Output is correct
9 Correct 30 ms 7224 KB Output is correct
10 Correct 29 ms 7364 KB Output is correct
11 Correct 28 ms 7296 KB Output is correct
12 Correct 27 ms 7324 KB Output is correct
13 Correct 29 ms 7244 KB Output is correct
14 Correct 36 ms 7280 KB Output is correct
15 Correct 31 ms 7328 KB Output is correct
16 Correct 31 ms 7348 KB Output is correct
17 Correct 29 ms 7292 KB Output is correct
18 Correct 30 ms 7288 KB Output is correct
19 Correct 31 ms 7224 KB Output is correct
20 Correct 35 ms 7284 KB Output is correct
21 Correct 29 ms 7244 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Incorrect 1 ms 340 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -