# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573748 | Hanksburger | Boat (APIO16_boat) | C++17 | 758 ms | 4548 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 int long long
using namespace std;
const int mod=1e9+7;
int dp[1005][505], inv[505], a[505], b[505], c[1005];
set<int> s;
int f(int x, int y)
{
if (!y)
return 1;
int res=f(x, y/2);
if (y&1)
return res*res%mod*x%mod;
else
return res*res%mod;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m=0;
cin >> n;
for (int i=1; i<=n; i++)
inv[i]=f(i, mod-2);
for (int i=1; i<=n; i++)
{
cin >> a[i] >> b[i];
s.insert(a[i]);
s.insert(b[i]+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... |