oj.uz

Submission #949811

# Submission time Handle Problem Language Result Execution time Memory
949811 2024-03-19T18:08:03 Z Baizho Boat (APIO16_boat) C++14
31 / 100
 2000 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(3e7)+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], t[N], lv[N], rv[N], timer = 1;

void update(int v, int tl, int tr, int l, int r, int sum = 0) {
    if(tl > r || l > tr) return;
    if(tl == tr) {
        t[v] = add(t[v] + sum + 1);
        return;
    }
    int tm = (tl + tr) / 2;
    if(!lv[v] && !(tl > r || l > tm)) lv[v] = ++ timer;
    if(!rv[v] && !(tm + 1 > r || l > tr)) rv[v] = ++ timer;
    update(rv[v], tm + 1, tr, l, r, add(sum + t[lv[v]]));
    update(lv[v], tl, tm, l, r, sum);
    t[v] = add(t[lv[v]] + t[rv[v]]); 
}
 
void Baizho() {
    cin>>n;
    for(int i = 1; i <= n; i ++) {
        cin>>a[i]>>b[i];
        update(1, 1, 1e9, a[i], b[i]);
    }
    cout<<t[1]<<"\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 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 7 ms 600 KB Output is correct
22 Correct 7 ms 604 KB Output is correct
23 Correct 7 ms 604 KB Output is correct
24 Correct 7 ms 600 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 7 ms 348 KB Output is correct
28 Correct 8 ms 348 KB Output is correct
29 Correct 8 ms 348 KB Output is correct
30 Correct 18 ms 23644 KB Output is correct
31 Correct 19 ms 23276 KB Output is correct
32 Correct 18 ms 23644 KB Output is correct
33 Correct 19 ms 22876 KB Output is correct
34 Correct 17 ms 23288 KB Output is correct
35 Correct 17 ms 22104 KB Output is correct
36 Correct 18 ms 22864 KB Output is correct
37 Correct 18 ms 23132 KB Output is correct
38 Correct 17 ms 22360 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2656 ms 524288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 7 ms 600 KB Output is correct
22 Correct 7 ms 604 KB Output is correct
23 Correct 7 ms 604 KB Output is correct
24 Correct 7 ms 600 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 7 ms 348 KB Output is correct
28 Correct 8 ms 348 KB Output is correct
29 Correct 8 ms 348 KB Output is correct
30 Correct 18 ms 23644 KB Output is correct
31 Correct 19 ms 23276 KB Output is correct
32 Correct 18 ms 23644 KB Output is correct
33 Correct 19 ms 22876 KB Output is correct
34 Correct 17 ms 23288 KB Output is correct
35 Correct 17 ms 22104 KB Output is correct
36 Correct 18 ms 22864 KB Output is correct
37 Correct 18 ms 23132 KB Output is correct
38 Correct 17 ms 22360 KB Output is correct
39 Execution timed out 2656 ms 524288 KB Time limit exceeded
40 Halted 0 ms 0 KB -