# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624382 | socpite | Boat (APIO16_boat) | C++14 | 2091 ms | 14352 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;
#define f first
#define s second
typedef long long ll;
const int maxn = 1005;
const int mod = 1e9+7;
int n;
pair<int, int> A[maxn];
vector<int> cp;
ll dp[maxn][2*maxn], pc[2*maxn][maxn], inv[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
inv[0] = inv[1] = 1;
for(int i = 2; i < maxn; i++)inv[i]=mod - inv[mod%i]*(mod/i)%mod;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> A[i].f >> A[i].s;
cp.push_back(A[i].f-1);
cp.push_back(A[i].s);
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... |