oj.uz

답안 #558501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558501 2022-05-07T13:22:00 Z Sweezy Boat (APIO16_boat) C++17
9 / 100
 236 ms 6868 KB 
#include <bits/stdc++.h>
 
using namespace std;
#define int long long
 
template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
  
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
 
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, s, n) for (int i = s; i < (n); ++i)
#define pb push_back
#define sz(a) (int) (a.size())
 
const int mod = 1e9 + 7;

void solve() {
  int n;
  cin >> n;
  vector<int> a(n), b(n), cs;
  rep(i, n) {
    cin >> a[i] >> b[i];
    cs.pb(a[i]);
    cs.pb(b[i]);
  }
 
  sort(all(cs));
  cs.erase(unique(all(cs)), cs.end());
  map<int, int> mp;
  vector<int> l, r;
  rep(i, sz(cs)) {
    if ((i == 0 ? 0 : cs[i - 1]) + 1 <= cs[i] - 1) {
      l.pb((i == 0 ? 0 : cs[i - 1]) + 1);
      r.pb(cs[i] - 1);
    }
    mp[cs[i]] = sz(l);
    l.pb(cs[i]);
    r.pb(cs[i]);
  }
  rep(i, n) {
    a[i] = mp[a[i]];
    b[i] = mp[b[i]];
    // debug(a[i], b[i]);
  }

  auto add = [&] (int &a, int b) -> void {
    (a += b) %= mod;
  };
 
  auto mul = [&] (int a, int b) {
    return a * b % mod;
  };
 
  auto binpow = [&] (int a, int n) {
    int res = 1;
    while (n) {
      if (n % 2) {
        res = mul(res, a);
      }
      a = mul(a, a);
      n /= 2;
    }
    return res;
  };
 
  auto inv = [&] (int val) {
    return binpow(val, mod - 2);
  };
 
  vector<int> f(n + 1), rf(n + 1);
  f[0] = rf[0] = 1;
  reps(i, 1, n + 1) {
    f[i] = mul(f[i - 1], i);
    rf[i] = inv(f[i]);
  }
 
  auto choose = [&] (int n, int k) {
    int res = 1;
    reps(i, 1, k + 1) {
      res = mul(res, n - k + i);
    }
    return mul(res, rf[k]);
  };
 
  auto sub = [&] (int a, int b) {
    a -= b;
    if (a < 0) a += mod;
    return a;
  };
 
  int segs = sz(l), answer = 0;
  vector<vector<int>> dp(n, vector<int> (segs));
  rep(i, n) {
    reps(seg, a[i], b[i] + 1) {
      int len = r[seg] - l[seg] + 1;
      int cnt = 0;
      for (int j = i; j >= 0; j--) {
        if (a[j] <= seg && seg <= b[j]) {
          cnt++;
          if (cnt <= len) {
            add(dp[i][seg], mul((j && seg ? dp[j - 1][seg - 1] : 1), choose(len, cnt)));
          }
        }
      }
    }
    // debug(i, dp[i]);
    reps(j, 1, segs) {
      add(dp[i][j], dp[i][j - 1]);
    }
    add(answer, dp[i][b[i]]);
    rep(j, segs) {
      add(dp[i][j], (i ? dp[i - 1][j] : 1));
    }
  }

  cout << answer;

  // vector<vector<int>> C(sz(segs), vector<int> (n + 1)), Cs(n + 1, vector<int> (n + 1));
  // rep(i, sz(segs)) {
  //   rep(j, min(segs[i].second - segs[i].first + 1, n) + 1) {
  //     C[i][j] = choose(segs[i].second - segs[i].first + 1, j);
  //   }
  // }
  // rep(i, n + 1) {
  //   rep(j, i + 1) {
  //     Cs[i][j] = choose(i, j);
  //   }
  // }
 
 
  // vector<vector<int>> dp(n, vector<int> (sz(segs)));
  // auto p = dp;
  // rep(pos, sz(segs)) {
  //   if (segs[pos].first >= l[0] && segs[pos].second <= r[0]) {
  //     dp[0][pos] = segs[pos].second - segs[pos].first + 1;
  //   }
  // }
  // // debug(dp);
  // p[0][0] = dp[0][0];
  // reps(i, 1, sz(segs)) {
  //   p[0][i] = dp[0][i];
  //   add(p[0][i], p[0][i - 1]);
  // }
  // reps(i, 1, n) {
  //   rep(pos, sz(segs)) {
  //     if (segs[pos].first < l[i] || segs[pos].second > r[i]) continue;
  //     int len = segs[pos].second - segs[pos].first + 1;
  //     add(dp[i][pos], len);
  //     add(dp[i][pos], mul(len, p[i - 1][pos]));
  //   }
  //   p[i][0] = dp[i][0];
  //   reps(pos, 1, sz(segs)) {
  //     add(p[i][pos], p[i][pos - 1]);
  //     add(p[i][pos], dp[i][pos]);
  //   }
  //   rep(pos, sz(segs)) {
  //     add(p[i][pos], p[i - 1][pos]);
  //   }
  // }
 
  // int res = 0;
  // reps(i, 0, n) {
  //   rep(j, sz(segs)) {
  //     add(res, dp[i][j]);
  //   }
  // }
 
  // cout << res;
}
 
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}

Compilation message

boat.cpp: In function 'void solve()':
boat.cpp:170:8: warning: variable 'sub' set but not used [-Wunused-but-set-variable]
  170 |   auto sub = [&] (int a, int b) {
      |        ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4308 KB Output is correct
2 Correct 14 ms 4260 KB Output is correct
3 Correct 7 ms 4340 KB Output is correct
4 Correct 10 ms 4244 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 7 ms 4292 KB Output is correct
7 Correct 8 ms 4308 KB Output is correct
8 Correct 7 ms 4308 KB Output is correct
9 Correct 17 ms 4352 KB Output is correct
10 Correct 7 ms 4308 KB Output is correct
11 Correct 19 ms 4300 KB Output is correct
12 Correct 7 ms 4308 KB Output is correct
13 Correct 7 ms 4292 KB Output is correct
14 Correct 18 ms 4308 KB Output is correct
15 Correct 18 ms 4308 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 3 ms 1092 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 5 ms 1108 KB Output is correct
20 Correct 2 ms 1096 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4308 KB Output is correct
2 Correct 14 ms 4260 KB Output is correct
3 Correct 7 ms 4340 KB Output is correct
4 Correct 10 ms 4244 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 7 ms 4292 KB Output is correct
7 Correct 8 ms 4308 KB Output is correct
8 Correct 7 ms 4308 KB Output is correct
9 Correct 17 ms 4352 KB Output is correct
10 Correct 7 ms 4308 KB Output is correct
11 Correct 19 ms 4300 KB Output is correct
12 Correct 7 ms 4308 KB Output is correct
13 Correct 7 ms 4292 KB Output is correct
14 Correct 18 ms 4308 KB Output is correct
15 Correct 18 ms 4308 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 3 ms 1092 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 5 ms 1108 KB Output is correct
20 Correct 2 ms 1096 KB Output is correct
21 Incorrect 236 ms 6868 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4308 KB Output is correct
2 Correct 14 ms 4260 KB Output is correct
3 Correct 7 ms 4340 KB Output is correct
4 Correct 10 ms 4244 KB Output is correct
5 Correct 7 ms 4308 KB Output is correct
6 Correct 7 ms 4292 KB Output is correct
7 Correct 8 ms 4308 KB Output is correct
8 Correct 7 ms 4308 KB Output is correct
9 Correct 17 ms 4352 KB Output is correct
10 Correct 7 ms 4308 KB Output is correct
11 Correct 19 ms 4300 KB Output is correct
12 Correct 7 ms 4308 KB Output is correct
13 Correct 7 ms 4292 KB Output is correct
14 Correct 18 ms 4308 KB Output is correct
15 Correct 18 ms 4308 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 3 ms 1092 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 5 ms 1108 KB Output is correct
20 Correct 2 ms 1096 KB Output is correct
21 Incorrect 236 ms 6868 KB Output isn't correct
22 Halted 0 ms 0 KB -