oj.uz

답안 #23037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23037 2017-05-02T05:22:09 Z ngkan146 Boat (APIO16_boat) C++
9 / 100
 0 ms 2420 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = (ll) 1e9+7;
ll n, a[505], b[505];
vector <ll> mjk;
ll dp[50005];
ll len(ll l1,ll r1,ll l2,ll r2){
   return max(0ll, min(r1,r2) - max(l1,l2) + 1);
}
int main(){
   scanf("%lld",&n);
   for(int i=1;i<=n;i++)
      scanf("%lld %lld",&a[i],&b[i]),
      mjk.push_back(a[i]),
      mjk.push_back(b[i]);
   mjk.push_back(0ll);
   mjk.push_back((ll)1e9+1);
   sort(mjk.begin(),mjk.end());
   mjk.resize(unique(mjk.begin(),mjk.end()) - mjk.begin());
   dp[0] = 1;
   for(int i=1;i<=n;i++){
      ll cnt = 0;
      for(int j=0;j<mjk.size()-1;j++){
         ll tmp = cnt + dp[j];
         dp[j] = (dp[j] + len(mjk[j], mjk[j+1]-1, a[i], b[i]) * cnt) % mod;
         cnt = tmp;
      }
   }
   ll ans = 0;
   for(int i=1;i<mjk.size()-1;i++)
      ans = (ans + dp[i]) % mod;
   cout << ans;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int j=0;j<mjk.size()-1;j++){
                    ^
boat.cpp:31:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i=1;i<mjk.size()-1;i++)
                 ^
boat.cpp:12:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",&n);
                    ^
boat.cpp:16:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       mjk.push_back(b[i]);
                          ^

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2420 KB Output is correct
2 Correct 0 ms 2420 KB Output is correct
3 Correct 0 ms 2420 KB Output is correct
4 Correct 0 ms 2420 KB Output is correct
5 Correct 0 ms 2420 KB Output is correct
6 Correct 0 ms 2420 KB Output is correct
7 Correct 0 ms 2420 KB Output is correct
8 Correct 0 ms 2420 KB Output is correct
9 Correct 0 ms 2420 KB Output is correct
10 Correct 0 ms 2420 KB Output is correct
11 Correct 0 ms 2420 KB Output is correct
12 Correct 0 ms 2420 KB Output is correct
13 Correct 0 ms 2420 KB Output is correct
14 Correct 0 ms 2420 KB Output is correct
15 Correct 0 ms 2420 KB Output is correct
16 Correct 0 ms 2420 KB Output is correct
17 Correct 0 ms 2420 KB Output is correct
18 Correct 0 ms 2420 KB Output is correct
19 Correct 0 ms 2420 KB Output is correct
20 Correct 0 ms 2420 KB Output is correct
21 Incorrect 0 ms 2420 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2420 KB Output is correct
2 Correct 0 ms 2420 KB Output is correct
3 Correct 0 ms 2420 KB Output is correct
4 Correct 0 ms 2420 KB Output is correct
5 Correct 0 ms 2420 KB Output is correct
6 Correct 0 ms 2420 KB Output is correct
7 Correct 0 ms 2420 KB Output is correct
8 Correct 0 ms 2420 KB Output is correct
9 Correct 0 ms 2420 KB Output is correct
10 Correct 0 ms 2420 KB Output is correct
11 Correct 0 ms 2420 KB Output is correct
12 Correct 0 ms 2420 KB Output is correct
13 Correct 0 ms 2420 KB Output is correct
14 Correct 0 ms 2420 KB Output is correct
15 Correct 0 ms 2420 KB Output is correct
16 Correct 0 ms 2420 KB Output is correct
17 Correct 0 ms 2420 KB Output is correct
18 Correct 0 ms 2420 KB Output is correct
19 Correct 0 ms 2420 KB Output is correct
20 Correct 0 ms 2420 KB Output is correct
21 Incorrect 0 ms 2420 KB Output isn't correct
22 Halted 0 ms 0 KB -