답안 #198013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
198013	2020-01-24T13:23:24 Z	quocnguyen1012	Boat (APIO16_boat)	C++14	100 / 100	881 ms	2632 KB

boat

#include <bits/stdc++.h>
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
using namespace std;
typedef long long ll;
 
const int mod = 1e9 + 7;
 
void add(int & a, int b)
{
  a += b;
  if (a >= mod) a -= mod;
  if (a < 0) a += mod;
}
 
int mul(int a, int b)
{
  return 1ll * a * b % mod;
}
 
int power(int a, int b)
{
  if (b == 0) return 1;
  int res = power(a, b / 2);
  if (b & 1) return 1ll * res * res % mod * a % mod;
  return 1ll * res * res % mod;
}
 
int f[505][1005];
int N, a[505], b[505], inv[505];
 
signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  if (fopen("A.INP", "r")){
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  }
  cin >> N;
  for (int i = 1; i < 505; ++i){
    inv[i] = power(i, mod - 2);
  }
  vector<int> seg;
  for (int i = 1; i <= N; ++i){
    cin >> a[i] >> b[i];
    seg.pb(a[i] - 1); seg.pb(b[i]);
  }
  sort(seg.begin(), seg.end()); seg.erase(unique(seg.begin(), seg.end()), seg.end());
  for (int i = 0; i < (int) seg.size(); ++i){
    f[0][i] = 1;
  }
  for (int i = 1; i <= N; ++i){
    a[i] = lower_bound(seg.begin(), seg.end(), a[i]) - seg.begin();
    b[i] = lower_bound(seg.begin(), seg.end(), b[i]) - seg.begin();
  }
  for (int i = 1; i <= N; ++i){
    f[i][0] = 1;
    for (int val = a[i]; val <= b[i]; ++val){
      int can = seg[val] - seg[val - 1];
      f[i][val] = mul(f[i - 1][val - 1], can);
      int cnt = 1, way = can - 1;
      for (int k = i - 1; k >= 1; --k){
        if (a[k] <= val && val <= b[k]){
          way = mul(way, can++);
          way = mul(way, inv[++cnt]);
          add(f[i][val], mul(f[k - 1][val - 1], way));
        }
      }
    }
    for (int j = 1; j < (int)seg.size(); ++j){
      add(f[i][j], f[i][j - 1]);
      add(f[i][j], f[i - 1][j]);
      add(f[i][j], -f[i - 1][j - 1]);
    }
  }
  add(f[N][int(seg.size()) - 1], -1);
  cout << f[N][int(seg.size()) - 1];
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("A.INP", "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
boat.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("A.OUT", "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	2296 KB	Output is correct
2	Correct	8 ms	2296 KB	Output is correct
3	Correct	7 ms	2296 KB	Output is correct
4	Correct	7 ms	2296 KB	Output is correct
5	Correct	7 ms	2296 KB	Output is correct
6	Correct	7 ms	2296 KB	Output is correct
7	Correct	8 ms	2424 KB	Output is correct
8	Correct	7 ms	2296 KB	Output is correct
9	Correct	7 ms	2300 KB	Output is correct
10	Correct	7 ms	2296 KB	Output is correct
11	Correct	7 ms	2296 KB	Output is correct
12	Correct	7 ms	2296 KB	Output is correct
13	Correct	7 ms	2296 KB	Output is correct
14	Correct	7 ms	2296 KB	Output is correct
15	Correct	7 ms	2284 KB	Output is correct
16	Correct	5 ms	2296 KB	Output is correct
17	Correct	5 ms	2296 KB	Output is correct
18	Correct	6 ms	2296 KB	Output is correct
19	Correct	5 ms	2296 KB	Output is correct
20	Correct	4 ms	2296 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	2296 KB	Output is correct
2	Correct	8 ms	2296 KB	Output is correct
3	Correct	7 ms	2296 KB	Output is correct
4	Correct	7 ms	2296 KB	Output is correct
5	Correct	7 ms	2296 KB	Output is correct
6	Correct	7 ms	2296 KB	Output is correct
7	Correct	8 ms	2424 KB	Output is correct
8	Correct	7 ms	2296 KB	Output is correct
9	Correct	7 ms	2300 KB	Output is correct
10	Correct	7 ms	2296 KB	Output is correct
11	Correct	7 ms	2296 KB	Output is correct
12	Correct	7 ms	2296 KB	Output is correct
13	Correct	7 ms	2296 KB	Output is correct
14	Correct	7 ms	2296 KB	Output is correct
15	Correct	7 ms	2284 KB	Output is correct
16	Correct	5 ms	2296 KB	Output is correct
17	Correct	5 ms	2296 KB	Output is correct
18	Correct	6 ms	2296 KB	Output is correct
19	Correct	5 ms	2296 KB	Output is correct
20	Correct	4 ms	2296 KB	Output is correct
21	Correct	474 ms	2380 KB	Output is correct
22	Correct	429 ms	2292 KB	Output is correct
23	Correct	386 ms	2472 KB	Output is correct
24	Correct	432 ms	2432 KB	Output is correct
25	Correct	437 ms	2424 KB	Output is correct
26	Correct	702 ms	2364 KB	Output is correct
27	Correct	719 ms	2472 KB	Output is correct
28	Correct	710 ms	2632 KB	Output is correct
29	Correct	707 ms	2604 KB	Output is correct
30	Correct	8 ms	2296 KB	Output is correct
31	Correct	8 ms	2296 KB	Output is correct
32	Correct	7 ms	2296 KB	Output is correct
33	Correct	8 ms	2296 KB	Output is correct
34	Correct	8 ms	2296 KB	Output is correct
35	Correct	10 ms	2296 KB	Output is correct
36	Correct	11 ms	2400 KB	Output is correct
37	Correct	10 ms	2296 KB	Output is correct
38	Correct	10 ms	2296 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	760 KB	Output is correct
2	Correct	5 ms	764 KB	Output is correct
3	Correct	6 ms	760 KB	Output is correct
4	Correct	6 ms	760 KB	Output is correct
5	Correct	7 ms	760 KB	Output is correct
6	Correct	10 ms	760 KB	Output is correct
7	Correct	10 ms	760 KB	Output is correct
8	Correct	10 ms	760 KB	Output is correct
9	Correct	10 ms	760 KB	Output is correct
10	Correct	10 ms	760 KB	Output is correct
11	Correct	6 ms	760 KB	Output is correct
12	Correct	5 ms	760 KB	Output is correct
13	Correct	6 ms	760 KB	Output is correct
14	Correct	6 ms	760 KB	Output is correct
15	Correct	6 ms	760 KB	Output is correct
16	Correct	5 ms	760 KB	Output is correct
17	Correct	5 ms	760 KB	Output is correct
18	Correct	5 ms	760 KB	Output is correct
19	Correct	5 ms	760 KB	Output is correct
20	Correct	5 ms	760 KB	Output is correct

Subtask #4
42.0 / 42.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	2296 KB	Output is correct
2	Correct	8 ms	2296 KB	Output is correct
3	Correct	7 ms	2296 KB	Output is correct
4	Correct	7 ms	2296 KB	Output is correct
5	Correct	7 ms	2296 KB	Output is correct
6	Correct	7 ms	2296 KB	Output is correct
7	Correct	8 ms	2424 KB	Output is correct
8	Correct	7 ms	2296 KB	Output is correct
9	Correct	7 ms	2300 KB	Output is correct
10	Correct	7 ms	2296 KB	Output is correct
11	Correct	7 ms	2296 KB	Output is correct
12	Correct	7 ms	2296 KB	Output is correct
13	Correct	7 ms	2296 KB	Output is correct
14	Correct	7 ms	2296 KB	Output is correct
15	Correct	7 ms	2284 KB	Output is correct
16	Correct	5 ms	2296 KB	Output is correct
17	Correct	5 ms	2296 KB	Output is correct
18	Correct	6 ms	2296 KB	Output is correct
19	Correct	5 ms	2296 KB	Output is correct
20	Correct	4 ms	2296 KB	Output is correct
21	Correct	474 ms	2380 KB	Output is correct
22	Correct	429 ms	2292 KB	Output is correct
23	Correct	386 ms	2472 KB	Output is correct
24	Correct	432 ms	2432 KB	Output is correct
25	Correct	437 ms	2424 KB	Output is correct
26	Correct	702 ms	2364 KB	Output is correct
27	Correct	719 ms	2472 KB	Output is correct
28	Correct	710 ms	2632 KB	Output is correct
29	Correct	707 ms	2604 KB	Output is correct
30	Correct	8 ms	2296 KB	Output is correct
31	Correct	8 ms	2296 KB	Output is correct
32	Correct	7 ms	2296 KB	Output is correct
33	Correct	8 ms	2296 KB	Output is correct
34	Correct	8 ms	2296 KB	Output is correct
35	Correct	10 ms	2296 KB	Output is correct
36	Correct	11 ms	2400 KB	Output is correct
37	Correct	10 ms	2296 KB	Output is correct
38	Correct	10 ms	2296 KB	Output is correct
39	Correct	6 ms	760 KB	Output is correct
40	Correct	5 ms	764 KB	Output is correct
41	Correct	6 ms	760 KB	Output is correct
42	Correct	6 ms	760 KB	Output is correct
43	Correct	7 ms	760 KB	Output is correct
44	Correct	10 ms	760 KB	Output is correct
45	Correct	10 ms	760 KB	Output is correct
46	Correct	10 ms	760 KB	Output is correct
47	Correct	10 ms	760 KB	Output is correct
48	Correct	10 ms	760 KB	Output is correct
49	Correct	6 ms	760 KB	Output is correct
50	Correct	5 ms	760 KB	Output is correct
51	Correct	6 ms	760 KB	Output is correct
52	Correct	6 ms	760 KB	Output is correct
53	Correct	6 ms	760 KB	Output is correct
54	Correct	5 ms	760 KB	Output is correct
55	Correct	5 ms	760 KB	Output is correct
56	Correct	5 ms	760 KB	Output is correct
57	Correct	5 ms	760 KB	Output is correct
58	Correct	5 ms	760 KB	Output is correct
59	Correct	495 ms	2552 KB	Output is correct
60	Correct	472 ms	2420 KB	Output is correct
61	Correct	430 ms	2520 KB	Output is correct
62	Correct	502 ms	2376 KB	Output is correct
63	Correct	513 ms	2504 KB	Output is correct
64	Correct	858 ms	2424 KB	Output is correct
65	Correct	854 ms	2312 KB	Output is correct
66	Correct	857 ms	2312 KB	Output is correct
67	Correct	871 ms	2472 KB	Output is correct
68	Correct	881 ms	2384 KB	Output is correct
69	Correct	396 ms	2384 KB	Output is correct
70	Correct	414 ms	2356 KB	Output is correct
71	Correct	386 ms	2424 KB	Output is correct
72	Correct	412 ms	2300 KB	Output is correct
73	Correct	405 ms	2268 KB	Output is correct
74	Correct	88 ms	2296 KB	Output is correct
75	Correct	83 ms	2296 KB	Output is correct
76	Correct	87 ms	2296 KB	Output is correct
77	Correct	87 ms	2296 KB	Output is correct
78	Correct	90 ms	2296 KB	Output is correct

답안 #198013

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 22.0 / 22.0

Subtask #3 27.0 / 27.0

Subtask #4 42.0 / 42.0

Subtask #1
9.0 / 9.0

Subtask #2
22.0 / 22.0

Subtask #3
27.0 / 27.0

Subtask #4
42.0 / 42.0