| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 637088 |
2022-08-31T13:05:49 Z |
IWTIM |
Boat (APIO16_boat) |
C++17 |
|
2000 ms |
10364 KB |
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define int long long
const int N = 1005, mod = 1e9 + 7;
int t,n,a[N],b[N],pr[N][N],dp[N][N],inv[N],fq[N],ch[N][N],chh[N][N],sum[N][N];
unordered_map <int, int> shes;
vector <int> v;
int f_p(int base, int power) {
int result = 1;
while (power > 0) {
if (power % 2) result = (result * base) % mod;
base = (base * base) % mod;
power /= 2;
}
return result;
}
int C(int n, int k) {
if (n < k) return 0;
if (n == 0 && k == 0) return 1;
int pas = 1;
for (int i = n; i >= n - k + 1; i--){
pas *= i;
pas %= mod;
}
pas *= inv[k];pas %= mod;
return pas;
}
int check(int le, int ri, int a, int b) {
return (max(a,le) <= min(b,ri));
}
main() {
std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n;
for (int i = 1; i <= n; i++) {
cin>>a[i]>>b[i];
v.pb(a[i]);
v.pb(b[i] + 1);
}
fq[0] = 1; inv[0] = 1;
for (int i = 1; i < N; i++) {
fq[i] = fq[i - 1] * i % mod;
}
inv[N - 1] = f_p(fq[N - 1], mod - 2);
for (int i = N - 2; i >= 1; i--) {
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end())-v.begin());
vector <pii> seg;
vector <int> szz;
seg.pb({-1,-1});
for (int i = 1; i < v.size(); i++) {
seg.pb({v[i - 1], v[i] - 1});
szz.pb(v[i] - v[i - 1]);
}
sort(szz.begin(), szz.end());
szz.resize(unique(szz.begin(), szz.end())-szz.begin());
dp[0][0] = 1;
pr[0][0] = 1;
ch[0][0] = 1;
ch[1][1] = ch[1][0] = 1;
for (int i = 2; i <= n; i++) {
ch[i][0] = 1;
for (int j = 1; j <= i; j++) {
ch[i][j] = (ch[i - 1][j] + ch[i - 1][j - 1]) % mod;
}
}
int raod = 0;
for (int sz : szz) { raod++; shes[sz] = raod;
for (int cnt = 1; cnt <= n; cnt++) {
chh[shes[sz]][cnt] = C(sz, cnt);
for (int cn = 1; cn <= cnt; cn++) {
sum[shes[sz]][cnt] += chh[shes[sz]][cn] * ch[cnt - 1][cn - 1] % mod;
sum[shes[sz]][cnt] %= mod;
}
}
}
int ans = 0;
for (int i = 1; i < seg.size(); i++) pr[0][i] = 1;//, cout<<seg[i].f<<" "<<seg[i].s<<endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < seg.size(); j++) {
int le = seg[j].f; int ri = seg[j].s;
if (check(le,ri,a[i],b[i])) {
int cnt = 1;
int sh = shes[ri - le + 1];
for (int prless = i - 1; prless >= 0; prless--) {
dp[i][j] += sum[sh][cnt] * pr[prless][j - 1] % mod;
dp[i][j] %= mod;
if ((check(le,ri,a[prless],b[prless]))) cnt++;
}
}
ans += dp[i][j]; ans %= mod;
pr[i][j] = (dp[i][j] + pr[i][j - 1]); pr[i][j] %= mod;
}
}
cout<<ans<<"\n";
}
Compilation message
boat.cpp:209:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
209 | main() {
| ^~~~
boat.cpp: In function 'int main()':
boat.cpp:231:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
231 | for (int i = 1; i < v.size(); i++) {
| ~~^~~~~~~~~~
boat.cpp:258:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
258 | for (int i = 1; i < seg.size(); i++) pr[0][i] = 1;//, cout<<seg[i].f<<" "<<seg[i].s<<endl;
| ~~^~~~~~~~~~~~
boat.cpp:260:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
260 | for (int j = 1; j < seg.size(); j++) {
| ~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2085 ms |
10364 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2085 ms |
10364 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
44 ms |
3648 KB |
Output is correct |
| 2 |
Correct |
45 ms |
3592 KB |
Output is correct |
| 3 |
Correct |
45 ms |
3772 KB |
Output is correct |
| 4 |
Correct |
45 ms |
3740 KB |
Output is correct |
| 5 |
Correct |
47 ms |
3700 KB |
Output is correct |
| 6 |
Correct |
46 ms |
3780 KB |
Output is correct |
| 7 |
Correct |
46 ms |
3664 KB |
Output is correct |
| 8 |
Correct |
46 ms |
3748 KB |
Output is correct |
| 9 |
Correct |
44 ms |
3720 KB |
Output is correct |
| 10 |
Correct |
45 ms |
3660 KB |
Output is correct |
| 11 |
Correct |
46 ms |
3728 KB |
Output is correct |
| 12 |
Correct |
45 ms |
3640 KB |
Output is correct |
| 13 |
Correct |
45 ms |
3632 KB |
Output is correct |
| 14 |
Correct |
45 ms |
3664 KB |
Output is correct |
| 15 |
Correct |
44 ms |
3660 KB |
Output is correct |
| 16 |
Correct |
21 ms |
2516 KB |
Output is correct |
| 17 |
Correct |
22 ms |
2556 KB |
Output is correct |
| 18 |
Correct |
21 ms |
2576 KB |
Output is correct |
| 19 |
Correct |
19 ms |
2488 KB |
Output is correct |
| 20 |
Correct |
22 ms |
2588 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2085 ms |
10364 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
