# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102793 | CorneliuVadimTudor | Boat (APIO16_boat) | C++14 | 121 ms | 3972 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 MAXN 1000
#define MAXG 2000
struct Event{
int time, node, tip;
bool operator < (const Event &aux) const{
return time < aux.time;
}
};
std::vector <Event> V;
std::set <int> S;
std::vector <int> X;
const int MOD = 1000000007;
int d[1 + MAXG][1 + MAXN];
int C[1 + MAXN], D[1 + MAXN];
int inv[1 + MAXN];
inline int logPow(int a, int n){
int p = 1;
while(n){
if(n % 2) p = 1LL * p * a % MOD;
a = 1LL * a * a % MOD;
n /= 2;
}
return p;
}
int main(){
FILE*fi,*fo;
//fi = fopen("a.in","r");
//fo = fopen("a.out","w");
fi = stdin;
fo = stdout;
int n;
fscanf(fi,"%d", &n);
for(int i = 1; i <= n; i++){
int a, b;
fscanf(fi,"%d%d", &a, &b);
V.push_back({a, i, 1});
V.push_back({b + 1, i, -1});
}
std::sort(V.begin(), V.end());
for(int i = 1; i <= n; i++)
inv[i] = logPow(i, MOD - 2);
int j = 0, group = 0;
d[group][0] = 1;
for(int i = 0; i < V.size(); i = j){
j = i;
while(j < V.size() && V[j].time == V[i].time){
if(V[j].tip == 1) S.insert(V[j].node);
else S.erase(V[j].node);
j++;
}
if(!S.size()) continue;
X.clear();
for(auto y: S) X.push_back(y);
int len = V[j].time - V[i].time;
C[0] = 1;
int lim = std::min((int)X.size(), len);
for(int p = 1; p <= lim; p++){
C[p] = 1LL * C[p - 1] * (len - p + 1) % MOD;
C[p] = 1LL * C[p] * inv[p] % MOD;
}
for(int x = 0; x <= X.size(); x++){
int Cxp = 1, lim = std::min(x, len);
D[x] = 0;
for(int p = 1; p <= lim; p++){
Cxp = 1LL * Cxp * (x - p + 1) % MOD;
Cxp = 1LL * Cxp * inv[p];
D[x] = (D[x] + 1LL * C[p] * Cxp) % MOD;
}
}
group++;
int first = 0;
for(int prev = 0; prev <= n; prev++){
while(first < X.size() && X[first] <= prev) first++;
int ind = first;
int x = 0;
while(ind < X.size()){
x++;
d[group][X[ind]] = (d[group][X[ind]] + 1LL * d[group - 1][prev] * D[x]) % MOD;
ind++;
}
}
int ind = 0;
int prev = d[group][X[ind]];
ind++;
while(ind < X.size()){
int aux = d[group][X[ind]];
d[group][X[ind]] = (d[group][X[ind]] - prev + MOD) % MOD;
prev = aux;
ind++;
}
for(int prev = 0; prev <= n; prev++)
d[group][prev] = (d[group][prev] + d[group - 1][prev]) % MOD;
}
int ans = 0;
for(int prev = 1; prev <= n; prev++)
ans = (ans + d[group][prev]) % MOD;
fprintf(fo,"%lld", ans);
return 0;
}
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... |