oj.uz

Submission #699591

# Submission time Handle Problem Language Result Execution time Memory
699591 2023-02-17T13:01:56 Z Abrar_Al_Samit Boat (APIO16_boat) C++17
58 / 100
 2000 ms 69156 KB 
#include<bits/stdc++.h>
using namespace std;

const int nax = 503;
const int mod = 1e9 + 7;
const int cax = 1e6 + 3;
const long long sux = 103217;

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, to=min(op, len-1); take<=to; ++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 29 ms 49428 KB Output is correct
3 Correct 31 ms 49476 KB Output is correct
4 Correct 30 ms 49356 KB Output is correct
5 Correct 29 ms 49468 KB Output is correct
6 Correct 28 ms 49440 KB Output is correct
7 Correct 29 ms 49356 KB Output is correct
8 Correct 28 ms 49464 KB Output is correct
9 Correct 32 ms 49476 KB Output is correct
10 Correct 29 ms 49388 KB Output is correct
11 Correct 33 ms 49444 KB Output is correct
12 Correct 33 ms 49364 KB Output is correct
13 Correct 29 ms 49420 KB Output is correct
14 Correct 30 ms 49444 KB Output is correct
15 Correct 29 ms 49352 KB Output is correct
16 Correct 25 ms 49236 KB Output is correct
17 Correct 25 ms 49328 KB Output is correct
18 Correct 26 ms 49312 KB Output is correct
19 Correct 26 ms 49244 KB Output is correct
20 Correct 27 ms 49236 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 29 ms 49428 KB Output is correct
3 Correct 31 ms 49476 KB Output is correct
4 Correct 30 ms 49356 KB Output is correct
5 Correct 29 ms 49468 KB Output is correct
6 Correct 28 ms 49440 KB Output is correct
7 Correct 29 ms 49356 KB Output is correct
8 Correct 28 ms 49464 KB Output is correct
9 Correct 32 ms 49476 KB Output is correct
10 Correct 29 ms 49388 KB Output is correct
11 Correct 33 ms 49444 KB Output is correct
12 Correct 33 ms 49364 KB Output is correct
13 Correct 29 ms 49420 KB Output is correct
14 Correct 30 ms 49444 KB Output is correct
15 Correct 29 ms 49352 KB Output is correct
16 Correct 25 ms 49236 KB Output is correct
17 Correct 25 ms 49328 KB Output is correct
18 Correct 26 ms 49312 KB Output is correct
19 Correct 26 ms 49244 KB Output is correct
20 Correct 27 ms 49236 KB Output is correct
21 Correct 324 ms 50772 KB Output is correct
22 Correct 309 ms 50864 KB Output is correct
23 Correct 289 ms 50568 KB Output is correct
24 Correct 308 ms 50648 KB Output is correct
25 Correct 300 ms 50664 KB Output is correct
26 Correct 595 ms 51412 KB Output is correct
27 Correct 577 ms 51180 KB Output is correct
28 Correct 558 ms 51172 KB Output is correct
29 Correct 571 ms 51220 KB Output is correct
30 Correct 33 ms 49488 KB Output is correct
31 Correct 34 ms 49516 KB Output is correct
32 Correct 41 ms 49420 KB Output is correct
33 Correct 32 ms 49512 KB Output is correct
34 Correct 32 ms 49404 KB Output is correct
35 Correct 31 ms 49400 KB Output is correct
36 Correct 31 ms 49492 KB Output is correct
37 Correct 33 ms 49496 KB Output is correct
38 Correct 33 ms 49492 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 49748 KB Output is correct
2 Correct 30 ms 49724 KB Output is correct
3 Correct 38 ms 49740 KB Output is correct
4 Correct 32 ms 49796 KB Output is correct
5 Correct 34 ms 49788 KB Output is correct
6 Correct 40 ms 50128 KB Output is correct
7 Correct 41 ms 50116 KB Output is correct
8 Correct 41 ms 50060 KB Output is correct
9 Correct 48 ms 50124 KB Output is correct
10 Correct 45 ms 50092 KB Output is correct
11 Correct 32 ms 49772 KB Output is correct
12 Correct 30 ms 49752 KB Output is correct
13 Correct 32 ms 49720 KB Output is correct
14 Correct 31 ms 49728 KB Output is correct
15 Correct 31 ms 49732 KB Output is correct
16 Correct 32 ms 49492 KB Output is correct
17 Correct 30 ms 49524 KB Output is correct
18 Correct 29 ms 49424 KB Output is correct
19 Correct 28 ms 49424 KB Output is correct
20 Correct 28 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 29 ms 49428 KB Output is correct
3 Correct 31 ms 49476 KB Output is correct
4 Correct 30 ms 49356 KB Output is correct
5 Correct 29 ms 49468 KB Output is correct
6 Correct 28 ms 49440 KB Output is correct
7 Correct 29 ms 49356 KB Output is correct
8 Correct 28 ms 49464 KB Output is correct
9 Correct 32 ms 49476 KB Output is correct
10 Correct 29 ms 49388 KB Output is correct
11 Correct 33 ms 49444 KB Output is correct
12 Correct 33 ms 49364 KB Output is correct
13 Correct 29 ms 49420 KB Output is correct
14 Correct 30 ms 49444 KB Output is correct
15 Correct 29 ms 49352 KB Output is correct
16 Correct 25 ms 49236 KB Output is correct
17 Correct 25 ms 49328 KB Output is correct
18 Correct 26 ms 49312 KB Output is correct
19 Correct 26 ms 49244 KB Output is correct
20 Correct 27 ms 49236 KB Output is correct
21 Correct 324 ms 50772 KB Output is correct
22 Correct 309 ms 50864 KB Output is correct
23 Correct 289 ms 50568 KB Output is correct
24 Correct 308 ms 50648 KB Output is correct
25 Correct 300 ms 50664 KB Output is correct
26 Correct 595 ms 51412 KB Output is correct
27 Correct 577 ms 51180 KB Output is correct
28 Correct 558 ms 51172 KB Output is correct
29 Correct 571 ms 51220 KB Output is correct
30 Correct 33 ms 49488 KB Output is correct
31 Correct 34 ms 49516 KB Output is correct
32 Correct 41 ms 49420 KB Output is correct
33 Correct 32 ms 49512 KB Output is correct
34 Correct 32 ms 49404 KB Output is correct
35 Correct 31 ms 49400 KB Output is correct
36 Correct 31 ms 49492 KB Output is correct
37 Correct 33 ms 49496 KB Output is correct
38 Correct 33 ms 49492 KB Output is correct
39 Correct 32 ms 49748 KB Output is correct
40 Correct 30 ms 49724 KB Output is correct
41 Correct 38 ms 49740 KB Output is correct
42 Correct 32 ms 49796 KB Output is correct
43 Correct 34 ms 49788 KB Output is correct
44 Correct 40 ms 50128 KB Output is correct
45 Correct 41 ms 50116 KB Output is correct
46 Correct 41 ms 50060 KB Output is correct
47 Correct 48 ms 50124 KB Output is correct
48 Correct 45 ms 50092 KB Output is correct
49 Correct 32 ms 49772 KB Output is correct
50 Correct 30 ms 49752 KB Output is correct
51 Correct 32 ms 49720 KB Output is correct
52 Correct 31 ms 49728 KB Output is correct
53 Correct 31 ms 49732 KB Output is correct
54 Correct 32 ms 49492 KB Output is correct
55 Correct 30 ms 49524 KB Output is correct
56 Correct 29 ms 49424 KB Output is correct
57 Correct 28 ms 49424 KB Output is correct
58 Correct 28 ms 49492 KB Output is correct
59 Correct 920 ms 61604 KB Output is correct
60 Correct 829 ms 60932 KB Output is correct
61 Correct 829 ms 60620 KB Output is correct
62 Correct 930 ms 61848 KB Output is correct
63 Correct 873 ms 61272 KB Output is correct
64 Execution timed out 2067 ms 69156 KB Time limit exceeded
65 Halted 0 ms 0 KB -