oj.uz

Submission #699582

# Submission time Handle Problem Language Result Execution time Memory
699582 2023-02-17T12:50:51 Z Abrar_Al_Samit Boat (APIO16_boat) C++17
58 / 100
 2000 ms 69052 KB 
#include<bits/stdc++.h>
using namespace std;

const int nax = 503;
const int mod = 1e9 + 7;
const int cax = 1e6 + 9;
const long long sux = 3345;

vector<int>ind[nax*2];
int a[nax], b[nax];
int n, m;
int dp[nax*2][nax];
int inv[nax];
vector<int>imp;

int add(int a, int b) {
  a += b;
  if(a>=mod) a -= mod;
  return a;
}
int mul(int a, int b) {
  return (a * 1LL * b) % mod;
}
int quickpow(int a, int b) {
  int ret = 1;
  while(b) {
    if(b&1) ret = mul(ret, a);
    a = mul(a, a);
    b >>= 1;
  }
  return ret;
}

int get(int x) {
  int &ret = inv[x];
  if(ret==-1) {
    ret = quickpow(x, mod-2);
  }
  return ret;
}
vector<pair<long long,int>>table[cax];
int C(int n, int r) {
  long long H = n * sux + r;
  int H2 = H % cax;
  for(auto x : table[H2]) {
    if(x.first==H) return x.second;
  }


  int ret = 1;
  for(int i=n-r+1; i<=n; ++i) {
    ret = mul(ret, i);
  }
  for(int i=1; i<=r; ++i) {
    ret = mul(ret, get(i));
  }
  table[H2].emplace_back(H, ret);
  return ret;
}

vector<pair<long long,int>>andp[cax];
int get(int len, int op) {
  long long H = len * sux + op;
  int H2 = H % cax;
  for(auto x : andp[H2]) {
    if(x.first==H) return x.second;
  }

  int ret = 0;
  for(int take=0; take<=min(op, len-1); ++take) {
    ret = add(ret, mul(C(op, take), C(len, take+1)));
  }

  andp[H2].emplace_back(H, ret);
  return ret;
}
int solve(int i, int prv) {
  if(i==m-1) return prv>0;
  int &ret = dp[i][prv];
  if(ret!=-1) return ret;
  ret = 0;

  ret = solve(i+1, prv);
  int len = imp[i+1]-imp[i];

  for(int mx=0, cur_op=0; mx<ind[i].size(); ++mx) {
    if(ind[i][mx]<=prv) continue;

    int cur = mul(solve(i+1, ind[i][mx]), get(len, cur_op));
    cur_op++;
    ret = add(ret, cur);
  }
  return ret;
}
void PlayGround() {
  cin>>n;
  set<int>pts;
  for(int i=1; i<=n; ++i) {
    cin>>a[i]>>b[i];
    pts.insert(a[i]);
    pts.insert(b[i]+1);
  }

  for(int x : pts) {
    imp.push_back(x);
  } 
  m = imp.size();
  for(int i=0; i<m; ++i) {
    for(int j=1; j<=n; ++j) {
      if(imp[i]>=a[j] && imp[i]<=b[j]) {
        ind[i].push_back(j);
      }
    }
  }
  memset(inv, -1, sizeof inv);
  memset(dp, -1, sizeof dp);
  cout<<solve(0, 0)<<'\n';


  // cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

Compilation message

boat.cpp: In function 'int solve(int, int)':
boat.cpp:86:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   for(int mx=0, cur_op=0; mx<ind[i].size(); ++mx) {
      |                           ~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 49364 KB Output is correct
2 Correct 28 ms 49384 KB Output is correct
3 Correct 28 ms 49388 KB Output is correct
4 Correct 28 ms 49380 KB Output is correct
5 Correct 30 ms 49452 KB Output is correct
6 Correct 28 ms 49476 KB Output is correct
7 Correct 28 ms 49356 KB Output is correct
8 Correct 28 ms 49440 KB Output is correct
9 Correct 29 ms 49468 KB Output is correct
10 Correct 28 ms 49376 KB Output is correct
11 Correct 29 ms 49568 KB Output is correct
12 Correct 28 ms 49404 KB Output is correct
13 Correct 28 ms 49476 KB Output is correct
14 Correct 28 ms 49364 KB Output is correct
15 Correct 29 ms 49476 KB Output is correct
16 Correct 24 ms 49328 KB Output is correct
17 Correct 25 ms 49232 KB Output is correct
18 Correct 26 ms 49272 KB Output is correct
19 Correct 26 ms 49244 KB Output is correct
20 Correct 25 ms 49228 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 49364 KB Output is correct
2 Correct 28 ms 49384 KB Output is correct
3 Correct 28 ms 49388 KB Output is correct
4 Correct 28 ms 49380 KB Output is correct
5 Correct 30 ms 49452 KB Output is correct
6 Correct 28 ms 49476 KB Output is correct
7 Correct 28 ms 49356 KB Output is correct
8 Correct 28 ms 49440 KB Output is correct
9 Correct 29 ms 49468 KB Output is correct
10 Correct 28 ms 49376 KB Output is correct
11 Correct 29 ms 49568 KB Output is correct
12 Correct 28 ms 49404 KB Output is correct
13 Correct 28 ms 49476 KB Output is correct
14 Correct 28 ms 49364 KB Output is correct
15 Correct 29 ms 49476 KB Output is correct
16 Correct 24 ms 49328 KB Output is correct
17 Correct 25 ms 49232 KB Output is correct
18 Correct 26 ms 49272 KB Output is correct
19 Correct 26 ms 49244 KB Output is correct
20 Correct 25 ms 49228 KB Output is correct
21 Correct 309 ms 50636 KB Output is correct
22 Correct 296 ms 50852 KB Output is correct
23 Correct 272 ms 50648 KB Output is correct
24 Correct 290 ms 50520 KB Output is correct
25 Correct 300 ms 50628 KB Output is correct
26 Correct 554 ms 51280 KB Output is correct
27 Correct 593 ms 51444 KB Output is correct
28 Correct 556 ms 51268 KB Output is correct
29 Correct 559 ms 51324 KB Output is correct
30 Correct 32 ms 49464 KB Output is correct
31 Correct 32 ms 49424 KB Output is correct
32 Correct 38 ms 49500 KB Output is correct
33 Correct 32 ms 49492 KB Output is correct
34 Correct 33 ms 49620 KB Output is correct
35 Correct 30 ms 49492 KB Output is correct
36 Correct 31 ms 49444 KB Output is correct
37 Correct 30 ms 49460 KB Output is correct
38 Correct 31 ms 49444 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 49804 KB Output is correct
2 Correct 29 ms 49620 KB Output is correct
3 Correct 32 ms 49748 KB Output is correct
4 Correct 30 ms 49760 KB Output is correct
5 Correct 32 ms 49836 KB Output is correct
6 Correct 40 ms 50056 KB Output is correct
7 Correct 48 ms 50036 KB Output is correct
8 Correct 39 ms 50132 KB Output is correct
9 Correct 41 ms 50052 KB Output is correct
10 Correct 43 ms 50184 KB Output is correct
11 Correct 33 ms 49840 KB Output is correct
12 Correct 29 ms 49644 KB Output is correct
13 Correct 31 ms 49784 KB Output is correct
14 Correct 31 ms 49724 KB Output is correct
15 Correct 32 ms 49740 KB Output is correct
16 Correct 28 ms 49516 KB Output is correct
17 Correct 27 ms 49544 KB Output is correct
18 Correct 29 ms 49436 KB Output is correct
19 Correct 27 ms 49456 KB Output is correct
20 Correct 27 ms 49492 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 49364 KB Output is correct
2 Correct 28 ms 49384 KB Output is correct
3 Correct 28 ms 49388 KB Output is correct
4 Correct 28 ms 49380 KB Output is correct
5 Correct 30 ms 49452 KB Output is correct
6 Correct 28 ms 49476 KB Output is correct
7 Correct 28 ms 49356 KB Output is correct
8 Correct 28 ms 49440 KB Output is correct
9 Correct 29 ms 49468 KB Output is correct
10 Correct 28 ms 49376 KB Output is correct
11 Correct 29 ms 49568 KB Output is correct
12 Correct 28 ms 49404 KB Output is correct
13 Correct 28 ms 49476 KB Output is correct
14 Correct 28 ms 49364 KB Output is correct
15 Correct 29 ms 49476 KB Output is correct
16 Correct 24 ms 49328 KB Output is correct
17 Correct 25 ms 49232 KB Output is correct
18 Correct 26 ms 49272 KB Output is correct
19 Correct 26 ms 49244 KB Output is correct
20 Correct 25 ms 49228 KB Output is correct
21 Correct 309 ms 50636 KB Output is correct
22 Correct 296 ms 50852 KB Output is correct
23 Correct 272 ms 50648 KB Output is correct
24 Correct 290 ms 50520 KB Output is correct
25 Correct 300 ms 50628 KB Output is correct
26 Correct 554 ms 51280 KB Output is correct
27 Correct 593 ms 51444 KB Output is correct
28 Correct 556 ms 51268 KB Output is correct
29 Correct 559 ms 51324 KB Output is correct
30 Correct 32 ms 49464 KB Output is correct
31 Correct 32 ms 49424 KB Output is correct
32 Correct 38 ms 49500 KB Output is correct
33 Correct 32 ms 49492 KB Output is correct
34 Correct 33 ms 49620 KB Output is correct
35 Correct 30 ms 49492 KB Output is correct
36 Correct 31 ms 49444 KB Output is correct
37 Correct 30 ms 49460 KB Output is correct
38 Correct 31 ms 49444 KB Output is correct
39 Correct 30 ms 49804 KB Output is correct
40 Correct 29 ms 49620 KB Output is correct
41 Correct 32 ms 49748 KB Output is correct
42 Correct 30 ms 49760 KB Output is correct
43 Correct 32 ms 49836 KB Output is correct
44 Correct 40 ms 50056 KB Output is correct
45 Correct 48 ms 50036 KB Output is correct
46 Correct 39 ms 50132 KB Output is correct
47 Correct 41 ms 50052 KB Output is correct
48 Correct 43 ms 50184 KB Output is correct
49 Correct 33 ms 49840 KB Output is correct
50 Correct 29 ms 49644 KB Output is correct
51 Correct 31 ms 49784 KB Output is correct
52 Correct 31 ms 49724 KB Output is correct
53 Correct 32 ms 49740 KB Output is correct
54 Correct 28 ms 49516 KB Output is correct
55 Correct 27 ms 49544 KB Output is correct
56 Correct 29 ms 49436 KB Output is correct
57 Correct 27 ms 49456 KB Output is correct
58 Correct 27 ms 49492 KB Output is correct
59 Correct 872 ms 61704 KB Output is correct
60 Correct 799 ms 61220 KB Output is correct
61 Correct 768 ms 60676 KB Output is correct
62 Correct 897 ms 61824 KB Output is correct
63 Correct 848 ms 61292 KB Output is correct
64 Execution timed out 2058 ms 69052 KB Time limit exceeded
65 Halted 0 ms 0 KB -