# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199231 | anachor | Boat (APIO16_boat) | C++14 | 374 ms | 16248 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;
const int N = 1005, M = 1e9+7;
int l[N], r[N];
int st[N], len[N];
typedef long long LL;
LL dp[N][N];
LL sum[N][N];
LL power(LL a, LL p) {
if (p==0) return 1;
LL ans = power(a, p/2);
ans = (ans * ans)%M;
if (p%2) ans = (ans * a)%M;
return ans;
}
LL f[N][N];
LL inv[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
map<int, int> mp;
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... |