# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337348 | quocnguyen1012 | Cryptography (NOI20_crypto) | C++14 | 159 ms | 8164 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 3e5 + 5, mod = 1e9 + 7;
struct BIT {
int bit[maxn];
void upd(int i, int v) {
for (; i < maxn; i += i & -i)
bit[i] += v;
}
int query(int i) {
int ret = 0;
for (; i; i -= i & -i) {
ret += bit[i];
}
return ret;
}
}ft;
int N, a[maxn], fact[maxn];
vector<int> val;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("A.INP", "r", stdin);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |