oj.uz

Submission #962607

# Submission time Handle Problem Language Result Execution time Memory
962607 2024-04-14T02:13:49 Z Cookie Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 17320 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7, pr = 31;
const int mxn = 2e5 + 5, mxq = 1e5 + 5, sq = 500, mxv = 5e4 + 1;
//const int base = (1 <<18);
const ll inf = 1e18 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
//https://usaco.org/current/data/sol_prob2_gold_open24.html
struct th{
    int len, l, r;
    bool operator <(const th &other){
        return(len < other.len);
    }
};
vt<th>all;
int n, t;
int lseg[mxn + 1], rseg[mxn + 1];
multiset<pii>seg;
vt<pii>more, bad;
vt<int>lp[sq + 1], rp[sq + 1];
void add(){
    all.clear();
    for(auto [l, r]: seg)all.pb({r - l + 1, l, r});
    sort(ALL(all));
    for(int i = 0; i < sq; i++){
        lp[i].clear(); rp[i].clear();
    }
    for(int i = 0; i < sz(all); i++){
        lp[i / sq].pb(all[i].l); rp[i / sq].pb(all[i].r);
    }
    for(int i = 0; i < sq; i++){
        sort(ALLR(lp[i])); sort(ALL(rp[i]));
    }
    more.clear(); bad.clear();
}
int solve(int l, int r, int k){
    if(r - l + 1 < k)return(0);
    int ans = 0;
    for(int i = 0; i <= (sz(all) - 1) / sq; i++){
        
        if(all[i * sq].len < k && all[min((i + 1) * sq - 1, sz(all) - 1)].len >= k){
            
            for(int j = i * sq; j <= min((i + 1) * sq - 1, sz(all) - 1); j++){
                if(all[j].len >= k && all[j].r >= l + k - 1 && all[j].l <= r - k + 1)ans++;
            }
        }else if(all[i * sq].len >= k){
            
            ans += sz(lp[i]);
            
            int le = 0, ri = sz(lp[i]) - 1, res = -1;
            while(le <= ri){
                int mid = (le + ri) >> 1;
                if(lp[i][mid] > r - k + 1){
                    res = mid; le = mid + 1;
                }else{
                    ri = mid - 1;
                }
            }
            
            ans -= (res + 1);
            le = 0, ri = sz(rp[i]) - 1, res = -1;
            while(le <= ri){
                int mid = (le + ri) >> 1;
                if(rp[i][mid] < l + k - 1){
                    res = mid; le = mid + 1;
                }else{
                    ri = mid - 1;
                }
            }
            ans -= (res + 1);
        }
    }
    for(auto [le, ri]: more){
       
        if(ri - le + 1 >= k && le <= r - k + 1 && ri >= l + k - 1)ans++;
    }
  
    
    for(auto [le, ri]: bad){
        if(ri - le + 1 >= k && le <= r - k + 1 && ri >= l + k - 1)ans--;
    }
    return(ans);
}
void solve(){
   cin >> n >> t;
   all.pb({-1, 0, 0});
   int last = 0, idseg = 0;
   while(n--){
       int idq; cin >> idq;
       if(idq == 1){
           int a, b; cin >> a >> b; 
           a = (a ^ (t * last)); b = (b ^ (t * last));
           if(a > b)swap(a, b);
           lseg[++idseg] = a; rseg[idseg] = b;
           more.pb(mpp(a, b)); seg.insert(mpp(a, b));
       }else if(idq == 2){
           int id; cin >> id;
           
           seg.erase(seg.find(mpp(lseg[id], rseg[id]))); bad.pb(mpp(lseg[id], rseg[id]));
           
       }else{
           
           int l, r, k; cin >> l >> r >> k;
           l = (l ^ (t * last)), r = (r ^ (t * last));
           if(l > r)swap(l, r);
           last = solve(l, r, k);
           //cout << l << " " << r << " " << k << "\n";
           cout << last << "\n";
           
       }
       if(sz(more) + sz(bad) == sq){
           add();
       }
   }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("DATA.inp", "r", stdin);
    //freopen("DATA.out", "w", stdout);
    int tt; tt = 1;
    while(tt--){
        solve();
 
    }
    return(0);
}

Compilation message

segments.cpp: In function 'void add()':
segments.cpp:44:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |     for(auto [l, r]: seg)all.pb({r - l + 1, l, r});
      |              ^
segments.cpp: In function 'int solve(int, int, int)':
segments.cpp:94:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   94 |     for(auto [le, ri]: more){
      |              ^
segments.cpp:100:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  100 |     for(auto [le, ri]: bad){
      |              ^

Subtask #1
7.0 / 7.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 801 ms 4432 KB Output is correct
2 Correct 814 ms 7144 KB Output is correct
3 Correct 848 ms 7192 KB Output is correct
4 Correct 869 ms 7428 KB Output is correct
5 Correct 1464 ms 9840 KB Output is correct
6 Correct 1549 ms 9996 KB Output is correct
7 Correct 831 ms 7020 KB Output is correct
8 Correct 802 ms 7152 KB Output is correct
9 Correct 793 ms 7180 KB Output is correct
10 Correct 459 ms 5296 KB Output is correct
11 Correct 462 ms 5668 KB Output is correct
12 Correct 1115 ms 8192 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2576 KB Output is correct
2 Correct 48 ms 2588 KB Output is correct
3 Correct 51 ms 2724 KB Output is correct
4 Correct 53 ms 2588 KB Output is correct
5 Correct 1161 ms 8124 KB Output is correct
6 Correct 961 ms 7480 KB Output is correct
7 Correct 1030 ms 8076 KB Output is correct
8 Correct 1486 ms 9588 KB Output is correct
9 Correct 1538 ms 9632 KB Output is correct
10 Correct 1267 ms 7612 KB Output is correct
11 Correct 149 ms 2852 KB Output is correct
12 Correct 1250 ms 7708 KB Output is correct
13 Correct 1123 ms 6792 KB Output is correct
14 Correct 638 ms 4768 KB Output is correct
15 Correct 544 ms 4564 KB Output is correct
16 Correct 389 ms 3772 KB Output is correct
17 Correct 808 ms 6652 KB Output is correct
18 Correct 825 ms 6660 KB Output is correct
19 Correct 841 ms 6856 KB Output is correct
20 Correct 782 ms 6648 KB Output is correct
21 Correct 174 ms 3228 KB Output is correct
22 Correct 817 ms 5260 KB Output is correct
23 Correct 1004 ms 6424 KB Output is correct
24 Correct 856 ms 5864 KB Output is correct
25 Correct 47 ms 2640 KB Output is correct
26 Correct 47 ms 2568 KB Output is correct
27 Correct 48 ms 2640 KB Output is correct
28 Correct 49 ms 2656 KB Output is correct
29 Correct 1083 ms 6516 KB Output is correct
30 Correct 1089 ms 6680 KB Output is correct
31 Correct 1577 ms 9796 KB Output is correct
32 Correct 1277 ms 7444 KB Output is correct
33 Correct 1157 ms 6964 KB Output is correct
34 Correct 553 ms 4504 KB Output is correct
35 Correct 967 ms 6252 KB Output is correct
36 Correct 1226 ms 7608 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2820 KB Output is correct
2 Correct 68 ms 2900 KB Output is correct
3 Correct 60 ms 2816 KB Output is correct
4 Correct 68 ms 2916 KB Output is correct
5 Correct 1204 ms 8808 KB Output is correct
6 Correct 354 ms 4900 KB Output is correct
7 Correct 1277 ms 9020 KB Output is correct
8 Correct 386 ms 5388 KB Output is correct
9 Correct 818 ms 5292 KB Output is correct
10 Correct 1286 ms 8132 KB Output is correct
11 Correct 359 ms 3668 KB Output is correct
12 Correct 1499 ms 9608 KB Output is correct
13 Correct 1129 ms 7156 KB Output is correct
14 Correct 694 ms 5056 KB Output is correct
15 Correct 1468 ms 9224 KB Output is correct
16 Correct 1194 ms 7520 KB Output is correct
17 Correct 805 ms 7068 KB Output is correct
18 Correct 795 ms 7052 KB Output is correct
19 Correct 809 ms 7112 KB Output is correct
20 Correct 789 ms 7020 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 6 ms 604 KB Output is correct
9 Correct 7 ms 604 KB Output is correct
10 Correct 6 ms 856 KB Output is correct
11 Correct 9 ms 600 KB Output is correct
12 Correct 10 ms 604 KB Output is correct
13 Correct 6 ms 684 KB Output is correct
14 Correct 6 ms 704 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 6 ms 604 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 604 KB Output is correct
21 Correct 801 ms 4432 KB Output is correct
22 Correct 814 ms 7144 KB Output is correct
23 Correct 848 ms 7192 KB Output is correct
24 Correct 869 ms 7428 KB Output is correct
25 Correct 1464 ms 9840 KB Output is correct
26 Correct 1549 ms 9996 KB Output is correct
27 Correct 831 ms 7020 KB Output is correct
28 Correct 802 ms 7152 KB Output is correct
29 Correct 793 ms 7180 KB Output is correct
30 Correct 459 ms 5296 KB Output is correct
31 Correct 462 ms 5668 KB Output is correct
32 Correct 1115 ms 8192 KB Output is correct
33 Correct 63 ms 2820 KB Output is correct
34 Correct 68 ms 2900 KB Output is correct
35 Correct 60 ms 2816 KB Output is correct
36 Correct 68 ms 2916 KB Output is correct
37 Correct 1204 ms 8808 KB Output is correct
38 Correct 354 ms 4900 KB Output is correct
39 Correct 1277 ms 9020 KB Output is correct
40 Correct 386 ms 5388 KB Output is correct
41 Correct 818 ms 5292 KB Output is correct
42 Correct 1286 ms 8132 KB Output is correct
43 Correct 359 ms 3668 KB Output is correct
44 Correct 1499 ms 9608 KB Output is correct
45 Correct 1129 ms 7156 KB Output is correct
46 Correct 694 ms 5056 KB Output is correct
47 Correct 1468 ms 9224 KB Output is correct
48 Correct 1194 ms 7520 KB Output is correct
49 Correct 805 ms 7068 KB Output is correct
50 Correct 795 ms 7052 KB Output is correct
51 Correct 809 ms 7112 KB Output is correct
52 Correct 789 ms 7020 KB Output is correct
53 Correct 68 ms 2708 KB Output is correct
54 Correct 65 ms 2896 KB Output is correct
55 Correct 65 ms 2948 KB Output is correct
56 Correct 64 ms 2804 KB Output is correct
57 Correct 581 ms 6004 KB Output is correct
58 Correct 234 ms 4724 KB Output is correct
59 Correct 938 ms 7936 KB Output is correct
60 Correct 344 ms 4660 KB Output is correct
61 Correct 1148 ms 7336 KB Output is correct
62 Correct 1479 ms 9144 KB Output is correct
63 Correct 1536 ms 9528 KB Output is correct
64 Correct 1492 ms 9228 KB Output is correct
65 Correct 472 ms 4216 KB Output is correct
66 Correct 384 ms 3996 KB Output is correct
67 Correct 1208 ms 7480 KB Output is correct
68 Correct 981 ms 6432 KB Output is correct
69 Correct 813 ms 7252 KB Output is correct
70 Correct 798 ms 7168 KB Output is correct
71 Correct 819 ms 7180 KB Output is correct
72 Correct 795 ms 7172 KB Output is correct
73 Correct 568 ms 4420 KB Output is correct
74 Correct 990 ms 6144 KB Output is correct
75 Correct 1537 ms 9940 KB Output is correct
76 Correct 1533 ms 9536 KB Output is correct
77 Correct 63 ms 2848 KB Output is correct
78 Correct 67 ms 2768 KB Output is correct
79 Correct 66 ms 2800 KB Output is correct
80 Correct 64 ms 2796 KB Output is correct
81 Correct 951 ms 6212 KB Output is correct
82 Correct 549 ms 4456 KB Output is correct
83 Correct 346 ms 3656 KB Output is correct
84 Correct 955 ms 6088 KB Output is correct
85 Correct 1240 ms 7432 KB Output is correct
86 Correct 1218 ms 7728 KB Output is correct
87 Correct 769 ms 5516 KB Output is correct
88 Correct 350 ms 3884 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 6 ms 604 KB Output is correct
9 Correct 7 ms 604 KB Output is correct
10 Correct 6 ms 856 KB Output is correct
11 Correct 9 ms 600 KB Output is correct
12 Correct 10 ms 604 KB Output is correct
13 Correct 6 ms 684 KB Output is correct
14 Correct 6 ms 704 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 6 ms 604 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 604 KB Output is correct
21 Correct 801 ms 4432 KB Output is correct
22 Correct 814 ms 7144 KB Output is correct
23 Correct 848 ms 7192 KB Output is correct
24 Correct 869 ms 7428 KB Output is correct
25 Correct 1464 ms 9840 KB Output is correct
26 Correct 1549 ms 9996 KB Output is correct
27 Correct 831 ms 7020 KB Output is correct
28 Correct 802 ms 7152 KB Output is correct
29 Correct 793 ms 7180 KB Output is correct
30 Correct 459 ms 5296 KB Output is correct
31 Correct 462 ms 5668 KB Output is correct
32 Correct 1115 ms 8192 KB Output is correct
33 Correct 48 ms 2576 KB Output is correct
34 Correct 48 ms 2588 KB Output is correct
35 Correct 51 ms 2724 KB Output is correct
36 Correct 53 ms 2588 KB Output is correct
37 Correct 1161 ms 8124 KB Output is correct
38 Correct 961 ms 7480 KB Output is correct
39 Correct 1030 ms 8076 KB Output is correct
40 Correct 1486 ms 9588 KB Output is correct
41 Correct 1538 ms 9632 KB Output is correct
42 Correct 1267 ms 7612 KB Output is correct
43 Correct 149 ms 2852 KB Output is correct
44 Correct 1250 ms 7708 KB Output is correct
45 Correct 1123 ms 6792 KB Output is correct
46 Correct 638 ms 4768 KB Output is correct
47 Correct 544 ms 4564 KB Output is correct
48 Correct 389 ms 3772 KB Output is correct
49 Correct 808 ms 6652 KB Output is correct
50 Correct 825 ms 6660 KB Output is correct
51 Correct 841 ms 6856 KB Output is correct
52 Correct 782 ms 6648 KB Output is correct
53 Correct 174 ms 3228 KB Output is correct
54 Correct 817 ms 5260 KB Output is correct
55 Correct 1004 ms 6424 KB Output is correct
56 Correct 856 ms 5864 KB Output is correct
57 Correct 47 ms 2640 KB Output is correct
58 Correct 47 ms 2568 KB Output is correct
59 Correct 48 ms 2640 KB Output is correct
60 Correct 49 ms 2656 KB Output is correct
61 Correct 1083 ms 6516 KB Output is correct
62 Correct 1089 ms 6680 KB Output is correct
63 Correct 1577 ms 9796 KB Output is correct
64 Correct 1277 ms 7444 KB Output is correct
65 Correct 1157 ms 6964 KB Output is correct
66 Correct 553 ms 4504 KB Output is correct
67 Correct 967 ms 6252 KB Output is correct
68 Correct 1226 ms 7608 KB Output is correct
69 Correct 63 ms 2820 KB Output is correct
70 Correct 68 ms 2900 KB Output is correct
71 Correct 60 ms 2816 KB Output is correct
72 Correct 68 ms 2916 KB Output is correct
73 Correct 1204 ms 8808 KB Output is correct
74 Correct 354 ms 4900 KB Output is correct
75 Correct 1277 ms 9020 KB Output is correct
76 Correct 386 ms 5388 KB Output is correct
77 Correct 818 ms 5292 KB Output is correct
78 Correct 1286 ms 8132 KB Output is correct
79 Correct 359 ms 3668 KB Output is correct
80 Correct 1499 ms 9608 KB Output is correct
81 Correct 1129 ms 7156 KB Output is correct
82 Correct 694 ms 5056 KB Output is correct
83 Correct 1468 ms 9224 KB Output is correct
84 Correct 1194 ms 7520 KB Output is correct
85 Correct 805 ms 7068 KB Output is correct
86 Correct 795 ms 7052 KB Output is correct
87 Correct 809 ms 7112 KB Output is correct
88 Correct 789 ms 7020 KB Output is correct
89 Correct 68 ms 2708 KB Output is correct
90 Correct 65 ms 2896 KB Output is correct
91 Correct 65 ms 2948 KB Output is correct
92 Correct 64 ms 2804 KB Output is correct
93 Correct 581 ms 6004 KB Output is correct
94 Correct 234 ms 4724 KB Output is correct
95 Correct 938 ms 7936 KB Output is correct
96 Correct 344 ms 4660 KB Output is correct
97 Correct 1148 ms 7336 KB Output is correct
98 Correct 1479 ms 9144 KB Output is correct
99 Correct 1536 ms 9528 KB Output is correct
100 Correct 1492 ms 9228 KB Output is correct
101 Correct 472 ms 4216 KB Output is correct
102 Correct 384 ms 3996 KB Output is correct
103 Correct 1208 ms 7480 KB Output is correct
104 Correct 981 ms 6432 KB Output is correct
105 Correct 813 ms 7252 KB Output is correct
106 Correct 798 ms 7168 KB Output is correct
107 Correct 819 ms 7180 KB Output is correct
108 Correct 795 ms 7172 KB Output is correct
109 Correct 568 ms 4420 KB Output is correct
110 Correct 990 ms 6144 KB Output is correct
111 Correct 1537 ms 9940 KB Output is correct
112 Correct 1533 ms 9536 KB Output is correct
113 Correct 63 ms 2848 KB Output is correct
114 Correct 67 ms 2768 KB Output is correct
115 Correct 66 ms 2800 KB Output is correct
116 Correct 64 ms 2796 KB Output is correct
117 Correct 951 ms 6212 KB Output is correct
118 Correct 549 ms 4456 KB Output is correct
119 Correct 346 ms 3656 KB Output is correct
120 Correct 955 ms 6088 KB Output is correct
121 Correct 1240 ms 7432 KB Output is correct
122 Correct 1218 ms 7728 KB Output is correct
123 Correct 769 ms 5516 KB Output is correct
124 Correct 350 ms 3884 KB Output is correct
125 Correct 130 ms 5200 KB Output is correct
126 Correct 134 ms 5244 KB Output is correct
127 Correct 151 ms 5200 KB Output is correct
128 Correct 134 ms 5360 KB Output is correct
129 Correct 129 ms 5220 KB Output is correct
130 Correct 140 ms 5320 KB Output is correct
131 Correct 963 ms 8944 KB Output is correct
132 Correct 2479 ms 13060 KB Output is correct
133 Correct 3822 ms 15632 KB Output is correct
134 Correct 1026 ms 9632 KB Output is correct
135 Correct 4276 ms 16304 KB Output is correct
136 Correct 636 ms 7752 KB Output is correct
137 Execution timed out 5006 ms 17320 KB Time limit exceeded
138 Halted 0 ms 0 KB -