Submission #900384

#TimeUsernameProblemLanguageResultExecution timeMemory
900384KutanBoat (APIO16_boat)C++14
100 / 100
252 ms5700 KiB
// Cao Quang Hung #include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cwchar> #include <cwctype> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <atomic> #include <chrono> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> using namespace std; #define pb push_back #define eb emplace_back #define mp make_pair #define pii pair<int,int> #define pll pair<long long , long long> #define vi vector<int> #define vpii vector<pii> #define SZ(x) ((int)(x.size())) #define fi first #define se second #define IN(x,y) ((y).find((x))!=(y).end()) #define ALL(t) t.begin(),t.end() #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i) #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i) #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i)) #define dem(x) __builtin_popcount(x) #define Mask(x) (1LL << (x)) #define BIT(x, i) ((x) >> (i) & 1) #define ln '\n' #define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); ///mt19937 rnd(time(0)); const int INF = 1e9 , mod = 1e9 + 7; template <class T1, class T2> inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; } template <class T1 , class T2> inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;} template <class T> inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; } template <class T> inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; } template <class T> inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; } template <class T> inline T product (const T &x , const T &y) { return 1LL * x * y % mod; } #define PROB "a" void file(){ if(fopen(PROB".inp", "r")){ freopen(PROB".inp","r",stdin); freopen(PROB".out","w",stdout); } } void sinh_(){ // srand(time(0)); // freopen(PROB".inp" , "w" , stdout); // int n; } typedef long long ll; typedef double db; const int N = 500 + 5; int n, m; int a[N], b[N]; int c[N][N]; int C[N * 2][N]; int inv[N]; int dp[N][N * 2] = {}; vector<int> seg; void readip(){ cin >> n; REP(i, 1, n) { cin >> a[i] >> b[i]; seg.push_back(a[i] - 1); seg.push_back(b[i]); } sort(ALL(seg)); seg.erase(unique(ALL(seg)), seg.end()); m = seg.size() - 1; REP(i, 0, 500) { c[i][0] = 1; REP(j, 1, i) { c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]); if (c[i][j] >= mod) c[i][j] -= mod; } } REP(i, 0, 500) inv[i] = pw(i, mod - 2); REP(i, 1, m) { int len = seg[i] - seg[i - 1]; C[i][0] = 1; REP(j, 1, n) { C[i][j] = 1LL * product(C[i][j - 1] , len + j - 1) * inv[j] % mod; } } } void solve(){ REP(i, 0, m) dp[0][i] = 1; int res = 0; REP(i, 1, n) { REP(j, 1, m) { if (a[i] <= seg[j - 1] + 1 && seg[j] <= b[i]) { int cnt = 0; REPD(k, i, 1) { cnt += (a[k] <= seg[j - 1] + 1 && seg[j] <= b[k]); add(dp[i][j], product(dp[k - 1][j - 1], C[j][cnt])); } } if (j > 1) add(dp[i][j], dp[i][j - 1]); } add(res, dp[i][m]); } cout << res << ln; } int main(){ sinh_(); io_faster file(); int t = 1; // cin >> t; while (t--){ readip(); solve(); } }

Compilation message (stderr)

boat.cpp: In function 'void readip()':
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:149:5: note: in expansion of macro 'REP'
  149 |     REP(i, 1, n) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:158:5: note: in expansion of macro 'REP'
  158 |     REP(i, 0, 500) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:160:9: note: in expansion of macro 'REP'
  160 |         REP(j, 1, i) {
      |         ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:166:5: note: in expansion of macro 'REP'
  166 |     REP(i, 0, 500) inv[i] = pw(i, mod - 2);
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:168:5: note: in expansion of macro 'REP'
  168 |     REP(i, 1, m) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:171:9: note: in expansion of macro 'REP'
  171 |         REP(j, 1, n) {
      |         ^~~
boat.cpp: In function 'void solve()':
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:178:5: note: in expansion of macro 'REP'
  178 |     REP(i, 0, m) dp[0][i] = 1;
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:180:5: note: in expansion of macro 'REP'
  180 |     REP(i, 1, n) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:181:9: note: in expansion of macro 'REP'
  181 |         REP(j, 1, m) {
      |         ^~~
boat.cpp:93:29: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
boat.cpp:184:17: note: in expansion of macro 'REPD'
  184 |                 REPD(k, i, 1) {
      |                 ^~~~
boat.cpp: In function 'void file()':
boat.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
boat.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...