oj.uz

Submission #499868

# Submission time Handle Problem Language Result Execution time Memory
499868 2021-12-29T20:51:26 Z Carmel_Ab1 Osumnjičeni (COCI21_osumnjiceni) C++17
110 / 110
 960 ms 61056 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}
void compress(vpi& a){
    vi s;
    int n=a.size();
    for(int i=0; i<n; i++){
        s.pb(a[i].first);
        s.pb(a[i].second);
    }
    sort(all(s));
    umap<int,int>conv;
    for(int i=0; i<2*n; i++)
        conv[s[i]]=i;
    for(int i=0; i<n; i++)
        a[i]={conv[a[i].first],conv[a[i].second]};
}
struct seg{
    int l,r,m;
    seg* lp,*rp;

    int mx=-1,prop=-1;

    seg(int l,int  r):l(l),r(r),m((l+r)/2){
        if(l+1<r){
            lp=new seg(l,m);
            rp=new seg(m,r);
        }
    }

    void apply(int x){
        mx=max(mx,x);
        prop=max(prop,x);
    }
    void push(){
        if(l+1==r)return;
        lp->apply(prop);
        rp->apply(prop);
        prop=-1;
    }

    void upd(int a,int b,int x){
        if(r<=a || b<=l)
            return;
        else if(a<=l && r<=b){
            apply(x);
            return;
        }
        push();
        lp->upd(a,b,x);
        rp->upd(a,b,x);
        mx=max(mx,lp->mx);
        mx=max(mx,rp->mx);
    }
    int qur(int a,int b){
        if(r<=a || b<=l)
            return -1;
        else if(a<=l && r<=b)
            return mx;
        push();
        return max(lp->qur(a,b),rp->qur(a,b));
    }
};
void solve() {
    int n;
    cin >> n ;
    vpi a(n);
    read(a);
    compress(a);
    int lg=18;

    vvi dp(n,vi(lg,-1));
    seg s(0,2*n+1);
    for(int i=0; i<n; i++){
        if(i)
            dp[i][0]=dp[i-1][0];
        dp[i][0]=max(dp[i][0],s.qur(a[i].first,a[i].second+1));

        s.upd(a[i].first,a[i].second+1,i);
    }

    for(int j=1; j<lg; j++)
        for(int i=0; i<n; i++) {
            if(i)
                dp[i][j]=dp[i-1][j];
            if(dp[i][j-1]!=-1)
                dp[i][j]=max(dp[i][j],dp[dp[i][j-1]][j-1]);
        }


    int q;
    cin >> q;
    while(q--){
        int l,r;
        cin >> l >> r;
        l--,r--;

        int ans=0;

        for(int i=lg-1; 0<=i; i--)
            if(dp[r][i]>=l)
                ans+=(1<<i),r=dp[r][i];
        for(int i=0; i<lg; i++)
            if(dp[r][i]<=l){
                ans+=(1<<i);
                break;
            }
        cout << ans << "\n";
    }
}

Compilation message

Main.cpp: In function 'void usaco(std::string)':
Main.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:59:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:178:9: warning: 's.seg::rp' may be used uninitialized in this function [-Wmaybe-uninitialized]
  178 |         rp->apply(prop);
      |         ^~
Main.cpp:213:9: note: 's.seg::rp' was declared here
  213 |     seg s(0,2*n+1);
      |         ^
Main.cpp:178:9: warning: 's.seg::lp' may be used uninitialized in this function [-Wmaybe-uninitialized]
  178 |         rp->apply(prop);
      |         ^~
Main.cpp:213:9: note: 's.seg::lp' was declared here
  213 |     seg s(0,2*n+1);
      |         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 650 ms 57052 KB Output is correct
2 Correct 642 ms 56224 KB Output is correct
3 Correct 635 ms 56320 KB Output is correct
4 Correct 629 ms 57100 KB Output is correct
5 Correct 700 ms 59588 KB Output is correct
6 Correct 220 ms 54060 KB Output is correct
7 Correct 173 ms 55084 KB Output is correct
8 Correct 180 ms 55724 KB Output is correct
9 Correct 218 ms 56992 KB Output is correct
10 Correct 191 ms 55152 KB Output is correct
11 Correct 535 ms 58372 KB Output is correct
12 Correct 463 ms 54880 KB Output is correct
13 Correct 466 ms 54640 KB Output is correct
14 Correct 496 ms 58408 KB Output is correct
15 Correct 467 ms 56900 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 197 ms 57844 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1788 KB Output is correct
2 Correct 9 ms 1680 KB Output is correct
3 Correct 9 ms 1612 KB Output is correct
4 Correct 9 ms 1740 KB Output is correct
5 Correct 9 ms 1612 KB Output is correct
6 Correct 6 ms 1800 KB Output is correct
7 Correct 8 ms 1612 KB Output is correct
8 Correct 8 ms 1740 KB Output is correct
9 Correct 7 ms 1612 KB Output is correct
10 Correct 5 ms 1612 KB Output is correct
11 Correct 9 ms 1740 KB Output is correct
12 Correct 8 ms 1612 KB Output is correct
13 Correct 7 ms 1612 KB Output is correct
14 Correct 7 ms 1740 KB Output is correct
15 Correct 7 ms 1740 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 5 ms 1740 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1788 KB Output is correct
2 Correct 9 ms 1680 KB Output is correct
3 Correct 9 ms 1612 KB Output is correct
4 Correct 9 ms 1740 KB Output is correct
5 Correct 9 ms 1612 KB Output is correct
6 Correct 6 ms 1800 KB Output is correct
7 Correct 8 ms 1612 KB Output is correct
8 Correct 8 ms 1740 KB Output is correct
9 Correct 7 ms 1612 KB Output is correct
10 Correct 5 ms 1612 KB Output is correct
11 Correct 9 ms 1740 KB Output is correct
12 Correct 8 ms 1612 KB Output is correct
13 Correct 7 ms 1612 KB Output is correct
14 Correct 7 ms 1740 KB Output is correct
15 Correct 7 ms 1740 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 5 ms 1740 KB Output is correct
18 Correct 74 ms 2572 KB Output is correct
19 Correct 66 ms 2368 KB Output is correct
20 Correct 105 ms 2628 KB Output is correct
21 Correct 79 ms 2460 KB Output is correct
22 Correct 70 ms 2500 KB Output is correct
23 Correct 69 ms 2456 KB Output is correct
24 Correct 73 ms 2592 KB Output is correct
25 Correct 69 ms 2496 KB Output is correct
26 Correct 73 ms 2552 KB Output is correct
27 Correct 68 ms 2364 KB Output is correct
28 Correct 49 ms 1952 KB Output is correct
29 Correct 48 ms 1988 KB Output is correct
30 Correct 49 ms 2032 KB Output is correct
31 Correct 50 ms 1980 KB Output is correct
32 Correct 50 ms 2100 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 55 ms 2604 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 675 ms 59732 KB Output is correct
2 Correct 657 ms 58468 KB Output is correct
3 Correct 664 ms 54512 KB Output is correct
4 Correct 645 ms 53948 KB Output is correct
5 Correct 612 ms 55528 KB Output is correct
6 Correct 177 ms 54572 KB Output is correct
7 Correct 174 ms 54052 KB Output is correct
8 Correct 178 ms 54616 KB Output is correct
9 Correct 186 ms 54064 KB Output is correct
10 Correct 198 ms 58544 KB Output is correct
11 Correct 448 ms 54356 KB Output is correct
12 Correct 533 ms 59692 KB Output is correct
13 Correct 448 ms 54260 KB Output is correct
14 Correct 478 ms 55900 KB Output is correct
15 Correct 526 ms 59256 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 179 ms 55396 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 650 ms 57052 KB Output is correct
2 Correct 642 ms 56224 KB Output is correct
3 Correct 635 ms 56320 KB Output is correct
4 Correct 629 ms 57100 KB Output is correct
5 Correct 700 ms 59588 KB Output is correct
6 Correct 220 ms 54060 KB Output is correct
7 Correct 173 ms 55084 KB Output is correct
8 Correct 180 ms 55724 KB Output is correct
9 Correct 218 ms 56992 KB Output is correct
10 Correct 191 ms 55152 KB Output is correct
11 Correct 535 ms 58372 KB Output is correct
12 Correct 463 ms 54880 KB Output is correct
13 Correct 466 ms 54640 KB Output is correct
14 Correct 496 ms 58408 KB Output is correct
15 Correct 467 ms 56900 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 197 ms 57844 KB Output is correct
18 Correct 11 ms 1788 KB Output is correct
19 Correct 9 ms 1680 KB Output is correct
20 Correct 9 ms 1612 KB Output is correct
21 Correct 9 ms 1740 KB Output is correct
22 Correct 9 ms 1612 KB Output is correct
23 Correct 6 ms 1800 KB Output is correct
24 Correct 8 ms 1612 KB Output is correct
25 Correct 8 ms 1740 KB Output is correct
26 Correct 7 ms 1612 KB Output is correct
27 Correct 5 ms 1612 KB Output is correct
28 Correct 9 ms 1740 KB Output is correct
29 Correct 8 ms 1612 KB Output is correct
30 Correct 7 ms 1612 KB Output is correct
31 Correct 7 ms 1740 KB Output is correct
32 Correct 7 ms 1740 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 5 ms 1740 KB Output is correct
35 Correct 74 ms 2572 KB Output is correct
36 Correct 66 ms 2368 KB Output is correct
37 Correct 105 ms 2628 KB Output is correct
38 Correct 79 ms 2460 KB Output is correct
39 Correct 70 ms 2500 KB Output is correct
40 Correct 69 ms 2456 KB Output is correct
41 Correct 73 ms 2592 KB Output is correct
42 Correct 69 ms 2496 KB Output is correct
43 Correct 73 ms 2552 KB Output is correct
44 Correct 68 ms 2364 KB Output is correct
45 Correct 49 ms 1952 KB Output is correct
46 Correct 48 ms 1988 KB Output is correct
47 Correct 49 ms 2032 KB Output is correct
48 Correct 50 ms 1980 KB Output is correct
49 Correct 50 ms 2100 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 55 ms 2604 KB Output is correct
52 Correct 675 ms 59732 KB Output is correct
53 Correct 657 ms 58468 KB Output is correct
54 Correct 664 ms 54512 KB Output is correct
55 Correct 645 ms 53948 KB Output is correct
56 Correct 612 ms 55528 KB Output is correct
57 Correct 177 ms 54572 KB Output is correct
58 Correct 174 ms 54052 KB Output is correct
59 Correct 178 ms 54616 KB Output is correct
60 Correct 186 ms 54064 KB Output is correct
61 Correct 198 ms 58544 KB Output is correct
62 Correct 448 ms 54356 KB Output is correct
63 Correct 533 ms 59692 KB Output is correct
64 Correct 448 ms 54260 KB Output is correct
65 Correct 478 ms 55900 KB Output is correct
66 Correct 526 ms 59256 KB Output is correct
67 Correct 0 ms 204 KB Output is correct
68 Correct 179 ms 55396 KB Output is correct
69 Correct 908 ms 56684 KB Output is correct
70 Correct 960 ms 59952 KB Output is correct
71 Correct 951 ms 55448 KB Output is correct
72 Correct 907 ms 58568 KB Output is correct
73 Correct 936 ms 57696 KB Output is correct
74 Correct 512 ms 60624 KB Output is correct
75 Correct 483 ms 56192 KB Output is correct
76 Correct 536 ms 61056 KB Output is correct
77 Correct 507 ms 56176 KB Output is correct
78 Correct 457 ms 56800 KB Output is correct
79 Correct 634 ms 60148 KB Output is correct
80 Correct 535 ms 55624 KB Output is correct
81 Correct 579 ms 55256 KB Output is correct
82 Correct 587 ms 58560 KB Output is correct
83 Correct 584 ms 55684 KB Output is correct
84 Correct 0 ms 204 KB Output is correct
85 Correct 298 ms 56428 KB Output is correct