oj.uz

답안 #499866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
499866 2021-12-29T20:49:41 Z Carmel_Ab1 Osumnjičeni (COCI21_osumnjiceni) C++17
60 / 110
 1000 ms 60312 KB 
#include<bits/stdc++.h>
//#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:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
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(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:177:9: warning: 's.seg::rp' may be used uninitialized in this function [-Wmaybe-uninitialized]
  177 |         rp->apply(prop);
      |         ^~
Main.cpp:212:9: note: 's.seg::rp' was declared here
  212 |     seg s(0,2*n+1);
      |         ^
Main.cpp:177:9: warning: 's.seg::lp' may be used uninitialized in this function [-Wmaybe-uninitialized]
  177 |         rp->apply(prop);
      |         ^~
Main.cpp:212:9: note: 's.seg::lp' was declared here
  212 |     seg s(0,2*n+1);
      |         ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 655 ms 57304 KB Output is correct
2 Correct 744 ms 56588 KB Output is correct
3 Correct 659 ms 56684 KB Output is correct
4 Correct 661 ms 57304 KB Output is correct
5 Correct 769 ms 60036 KB Output is correct
6 Correct 179 ms 54440 KB Output is correct
7 Correct 180 ms 55376 KB Output is correct
8 Correct 203 ms 55896 KB Output is correct
9 Correct 196 ms 57400 KB Output is correct
10 Correct 187 ms 55408 KB Output is correct
11 Correct 485 ms 58656 KB Output is correct
12 Correct 473 ms 55072 KB Output is correct
13 Correct 445 ms 54888 KB Output is correct
14 Correct 519 ms 58724 KB Output is correct
15 Correct 472 ms 57112 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 183 ms 58040 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1732 KB Output is correct
2 Correct 10 ms 1612 KB Output is correct
3 Correct 9 ms 1612 KB Output is correct
4 Correct 10 ms 1772 KB Output is correct
5 Correct 10 ms 1804 KB Output is correct
6 Correct 6 ms 1820 KB Output is correct
7 Correct 6 ms 1616 KB Output is correct
8 Correct 7 ms 1876 KB Output is correct
9 Correct 7 ms 1644 KB Output is correct
10 Correct 5 ms 1712 KB Output is correct
11 Correct 7 ms 1784 KB Output is correct
12 Correct 8 ms 1712 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 9 ms 1776 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 1756 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1732 KB Output is correct
2 Correct 10 ms 1612 KB Output is correct
3 Correct 9 ms 1612 KB Output is correct
4 Correct 10 ms 1772 KB Output is correct
5 Correct 10 ms 1804 KB Output is correct
6 Correct 6 ms 1820 KB Output is correct
7 Correct 6 ms 1616 KB Output is correct
8 Correct 7 ms 1876 KB Output is correct
9 Correct 7 ms 1644 KB Output is correct
10 Correct 5 ms 1712 KB Output is correct
11 Correct 7 ms 1784 KB Output is correct
12 Correct 8 ms 1712 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 9 ms 1776 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 1756 KB Output is correct
18 Correct 81 ms 2720 KB Output is correct
19 Correct 88 ms 2512 KB Output is correct
20 Correct 77 ms 2700 KB Output is correct
21 Correct 73 ms 2728 KB Output is correct
22 Correct 77 ms 2628 KB Output is correct
23 Correct 78 ms 2620 KB Output is correct
24 Correct 82 ms 2600 KB Output is correct
25 Correct 70 ms 2628 KB Output is correct
26 Correct 76 ms 2580 KB Output is correct
27 Correct 69 ms 2488 KB Output is correct
28 Correct 49 ms 2164 KB Output is correct
29 Correct 55 ms 2108 KB Output is correct
30 Correct 51 ms 2124 KB Output is correct
31 Correct 53 ms 2108 KB Output is correct
32 Correct 49 ms 2192 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 57 ms 2680 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 686 ms 59988 KB Output is correct
2 Correct 678 ms 58896 KB Output is correct
3 Correct 596 ms 54800 KB Output is correct
4 Correct 661 ms 54124 KB Output is correct
5 Correct 626 ms 55924 KB Output is correct
6 Correct 196 ms 54880 KB Output is correct
7 Correct 181 ms 54368 KB Output is correct
8 Correct 180 ms 54856 KB Output is correct
9 Correct 175 ms 54244 KB Output is correct
10 Correct 194 ms 58808 KB Output is correct
11 Correct 457 ms 54520 KB Output is correct
12 Correct 554 ms 59904 KB Output is correct
13 Correct 452 ms 54560 KB Output is correct
14 Correct 490 ms 56232 KB Output is correct
15 Correct 515 ms 59616 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 174 ms 55636 KB Output is correct

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 655 ms 57304 KB Output is correct
2 Correct 744 ms 56588 KB Output is correct
3 Correct 659 ms 56684 KB Output is correct
4 Correct 661 ms 57304 KB Output is correct
5 Correct 769 ms 60036 KB Output is correct
6 Correct 179 ms 54440 KB Output is correct
7 Correct 180 ms 55376 KB Output is correct
8 Correct 203 ms 55896 KB Output is correct
9 Correct 196 ms 57400 KB Output is correct
10 Correct 187 ms 55408 KB Output is correct
11 Correct 485 ms 58656 KB Output is correct
12 Correct 473 ms 55072 KB Output is correct
13 Correct 445 ms 54888 KB Output is correct
14 Correct 519 ms 58724 KB Output is correct
15 Correct 472 ms 57112 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 183 ms 58040 KB Output is correct
18 Correct 10 ms 1732 KB Output is correct
19 Correct 10 ms 1612 KB Output is correct
20 Correct 9 ms 1612 KB Output is correct
21 Correct 10 ms 1772 KB Output is correct
22 Correct 10 ms 1804 KB Output is correct
23 Correct 6 ms 1820 KB Output is correct
24 Correct 6 ms 1616 KB Output is correct
25 Correct 7 ms 1876 KB Output is correct
26 Correct 7 ms 1644 KB Output is correct
27 Correct 5 ms 1712 KB Output is correct
28 Correct 7 ms 1784 KB Output is correct
29 Correct 8 ms 1712 KB Output is correct
30 Correct 10 ms 1624 KB Output is correct
31 Correct 9 ms 1776 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 1756 KB Output is correct
35 Correct 81 ms 2720 KB Output is correct
36 Correct 88 ms 2512 KB Output is correct
37 Correct 77 ms 2700 KB Output is correct
38 Correct 73 ms 2728 KB Output is correct
39 Correct 77 ms 2628 KB Output is correct
40 Correct 78 ms 2620 KB Output is correct
41 Correct 82 ms 2600 KB Output is correct
42 Correct 70 ms 2628 KB Output is correct
43 Correct 76 ms 2580 KB Output is correct
44 Correct 69 ms 2488 KB Output is correct
45 Correct 49 ms 2164 KB Output is correct
46 Correct 55 ms 2108 KB Output is correct
47 Correct 51 ms 2124 KB Output is correct
48 Correct 53 ms 2108 KB Output is correct
49 Correct 49 ms 2192 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 57 ms 2680 KB Output is correct
52 Correct 686 ms 59988 KB Output is correct
53 Correct 678 ms 58896 KB Output is correct
54 Correct 596 ms 54800 KB Output is correct
55 Correct 661 ms 54124 KB Output is correct
56 Correct 626 ms 55924 KB Output is correct
57 Correct 196 ms 54880 KB Output is correct
58 Correct 181 ms 54368 KB Output is correct
59 Correct 180 ms 54856 KB Output is correct
60 Correct 175 ms 54244 KB Output is correct
61 Correct 194 ms 58808 KB Output is correct
62 Correct 457 ms 54520 KB Output is correct
63 Correct 554 ms 59904 KB Output is correct
64 Correct 452 ms 54560 KB Output is correct
65 Correct 490 ms 56232 KB Output is correct
66 Correct 515 ms 59616 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 174 ms 55636 KB Output is correct
69 Correct 938 ms 57096 KB Output is correct
70 Execution timed out 1029 ms 60312 KB Time limit exceeded
71 Halted 0 ms 0 KB -