oj.uz

답안 #949849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949849 2024-03-19T18:51:08 Z Baizho Boat (APIO16_boat) C++14
31 / 100
 1337 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e7)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int add(int x) {
    if(x > mod) return x - mod;
    return x;
}

int n, a[505], b[505], dp[1000005], pref[1000005];
map<int, int> pos;
 
void Baizho() {
    cin>>n;
    vector<int> vec;
    for(int i = 1; i <= n; i ++) {
        cin>>a[i]>>b[i];
        for(int j = a[i]; j <= b[i]; j ++) {
            vec.pb(j);
        }
    }
    sort(all(vec));
    vec.erase(unique(all(vec)), vec.end());
    for(int i = 0; i < vec.size(); i ++) pos[vec[i]] = i + 1;
    for(int i = 1; i <= n; i ++) {
        int from = pos[a[i]], to = pos[b[i]];
        for(int j = to; j >= from; j --) {
            dp[j] = add(dp[j] + pref[j - 1] + 1);
        }
        for(int j = from; j <= vec.size(); j ++) pref[j] = add(pref[j - 1] + dp[j]);
    }
    cout<<pref[vec.size()]<<"\n";   
}
 
signed main() {     
//  Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
    // precalc();
    
    int ttt = 1;
   // cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

boat.cpp: In function 'void Baizho()':
boat.cpp:56:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int i = 0; i < vec.size(); i ++) pos[vec[i]] = i + 1;
      |                    ~~^~~~~~~~~~~~
boat.cpp:62:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for(int j = from; j <= vec.size(); j ++) pref[j] = add(pref[j - 1] + dp[j]);
      |                           ~~^~~~~~~~~~~~~
boat.cpp: In function 'void Freopen(std::string)':
boat.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 472 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 36 ms 6352 KB Output is correct
22 Correct 36 ms 6608 KB Output is correct
23 Correct 34 ms 6096 KB Output is correct
24 Correct 37 ms 5076 KB Output is correct
25 Correct 37 ms 4816 KB Output is correct
26 Correct 38 ms 6612 KB Output is correct
27 Correct 44 ms 6096 KB Output is correct
28 Correct 37 ms 5584 KB Output is correct
29 Correct 38 ms 4816 KB Output is correct
30 Correct 1337 ms 58312 KB Output is correct
31 Correct 1312 ms 57660 KB Output is correct
32 Correct 1318 ms 58692 KB Output is correct
33 Correct 1290 ms 56872 KB Output is correct
34 Correct 1293 ms 57576 KB Output is correct
35 Correct 1240 ms 54976 KB Output is correct
36 Correct 1307 ms 56840 KB Output is correct
37 Correct 1285 ms 57636 KB Output is correct
38 Correct 1271 ms 55544 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 415 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 472 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 36 ms 6352 KB Output is correct
22 Correct 36 ms 6608 KB Output is correct
23 Correct 34 ms 6096 KB Output is correct
24 Correct 37 ms 5076 KB Output is correct
25 Correct 37 ms 4816 KB Output is correct
26 Correct 38 ms 6612 KB Output is correct
27 Correct 44 ms 6096 KB Output is correct
28 Correct 37 ms 5584 KB Output is correct
29 Correct 38 ms 4816 KB Output is correct
30 Correct 1337 ms 58312 KB Output is correct
31 Correct 1312 ms 57660 KB Output is correct
32 Correct 1318 ms 58692 KB Output is correct
33 Correct 1290 ms 56872 KB Output is correct
34 Correct 1293 ms 57576 KB Output is correct
35 Correct 1240 ms 54976 KB Output is correct
36 Correct 1307 ms 56840 KB Output is correct
37 Correct 1285 ms 57636 KB Output is correct
38 Correct 1271 ms 55544 KB Output is correct
39 Runtime error 415 ms 524288 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -