# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404447 | CursedCode | Boat (APIO16_boat) | C++14 | 660 ms | 23340 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>
#define ll long long
const ll MOD=1000000007;
using namespace std;
ll n,k;
ll l[1005],r[1005],dp[1005][1005],val[1005],cnt[1005][1005],c[1005][1005],sum[1005][1005],len[1005],C[1005][1005];
unordered_map<ll,ll>um;
set<ll>s;
ll power(ll a, ll b){
if(b<=0)return 1;
ll g=power(a,b/2);
g=(g*g)%MOD;
if(b%2)g=(g*a)%MOD;
return g;
}
int main(){
cin >> n;
for(ll i=1;i<=n;i++){
cin >> l[i] >> r[i];
s.insert(l[i]);
s.insert(r[i]+1);
um[l[i]] = um[r[i] + 1] = 0;
}
for(auto i=s.begin();i!=s.end();++i){
um[*i]=++k;
val[k]=*i;
if(k>1) len[k-1]=val[k]-val[k-1];
}
for(ll i=0;i<=n;i++){
C[i][0]=1;
# | 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... |