# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793026 | algorithm16 | Boat (APIO16_boat) | C++14 | 2073 ms | 12116 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<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int n,a[505],b[505],dp[1505][2][505][2],inv[505],mod=1e9+7;
vector <int> v,v1;
vector <vector<int> > v2;
int sum(int a,int b) {
return (a+b)%mod;
}
int mul(int a,int b) {
return ((long long)a*b)%mod;
}
int exp(int a,int b) {
if(!b) return 1;
int ret=exp(a,b/2);
if(b%2==0) return mul(ret,ret);
return mul(mul(ret,ret),a);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i=0;i<n;i++) {
cin >> a[i] >> b[i];
v.push_back(a[i]);
v.push_back(b[i]);
v.push_back(b[i]+1);
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... |