# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699580 | Abrar_Al_Samit | Boat (APIO16_boat) | C++17 | 2085 ms | 21968 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 nax = 503;
const int mod = 1e9 + 7;
long long sux = 3345;
vector<int>ind[nax*2];
int a[nax], b[nax];
int n, m;
int dp[nax*2][nax];
int inv[nax];
vector<int>imp;
int add(int a, int b) {
a += b;
if(a>=mod) a -= mod;
return a;
}
int mul(int a, int b) {
return (a * 1LL * b) % mod;
}
int quickpow(int a, int b) {
int ret = 1;
while(b) {
if(b&1) ret = mul(ret, a);
a = mul(a, a);
b >>= 1;
}
return ret;
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... |