Submission #202589

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
2025892020-02-17 08:09:37pr3ponyBoat (APIO16_boat)C++14
100 / 100
438 ms4472 KiB
#include<bits/stdc++.h>
using namespace std;
const int N = 505, MOD = 1e9 + 7;
typedef long long ll;
vector<int> val;
typedef array<int, 2> ar;
ar p[N];
ll dp[2 * N][N], inv[N];
int main()
{
int n;
cin >> n;
val = {-1};
for (int i = 1; i <= n; ++i) {
cin >> p[i][0] >> p[i][1];
++p[i][1];
val.push_back(p[i][0]);
val.push_back(p[i][1]);
}
sort(val.begin(), val.end());
val.resize(unique(val.begin(), val.end()) - val.begin());
int w = val.size();
inv[1] = 1;
for (int i = 2; i <= n; ++i)
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
for (int i = 0; i < w; ++i)
dp[i][0] = 1;
for (int b = 1; b <= n; ++b) {
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...