oj.uz

Submission #495846

# Submission time Handle Problem Language Result Execution time Memory
495846 2021-12-20T06:19:26 Z kingline Segments (IZhO18_segments) C++17
22 / 100
 4614 ms 3904 KB 
#include <bits/stdc++.h>
#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
#define pb push_back
#define all(data) data.begin(), data.end()
#define endl '\n'
#define ll long long
//#define int long long
#define pii pair < int, int >

using namespace std;

const int M = 4e5 + 5;
//const int mod = 1e9 + 7;

int n, t;

main() {
    //file("pieaters");
    /*ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);*/
    cin >> n >> t;
    if(n <= 5000) {
        int id = 0, last = 0, cs = 0;
        multiset < pair < int, pii > > st;
        while(n--) {
            int tp, a, b, k;
            cin >> tp;
            if(tp == 1) {
                cin >> a >> b;
                a ^= (t * last);
                b ^= (t * last);
                if(a > b) swap(a, b);
                st.insert({++id, {a, b}});
            } else if(tp == 2) {
                cin >> k;
                st.erase(*st.lower_bound({k, {0, 0}}));
            } else {
                cin >> a >> b >> k;
                a = a ^ (last * t);
                b = b ^ (last * t);
                if(a > b) swap(a, b);
                int ans = 0;
                //cout << "Case " << ++cs << ": " << a << " " << b << endl;
                for(multiset < pair < int, pii > >::iterator it = st.begin(); it != st.end(); it++) {
                    pii z = (*it).second;
                    //cout << z.first << " " << z.second << endl;
                    if(min(z.second, b) - max(z.first, a) + 1 >= k) {
                        ans++;
                    }
                }
                cout << ans << endl;
                last = ans;
            }
        }
    } else {
        int tp, l, r, k;
        vector < pair < int, int > > v;
        while(n--) {
            cin >> tp >> l >> r;
            if(l > r) swap(l, r);
            if(tp == 3) break;
            v.pb({l, r});
        }
        cin >> k;
        int last = 0;
        for(int i = 0; i < v.size(); i++) {
            if(min(v[i].second, r) - max(v[i].first, l) + 1 >= k) {
                last++;
            }
        }
        cout << last << endl;
        while(n--) {
            cin >> tp >> l >> r >> k;
            l ^= (t * last);
            r ^= (t * last);
            if(l > r) swap(l, r);
            last = 0;
            for(int i = 0; i < v.size(); i++) {
                if(min(v[i].second, r) - max(v[i].first, l) + 1 >= k) {
                    last++;
                }
            }
            cout << last << endl;
        }
    }
}

Compilation message

segments.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main() {
      | ^~~~
segments.cpp: In function 'int main()':
segments.cpp:24:31: warning: unused variable 'cs' [-Wunused-variable]
   24 |         int id = 0, last = 0, cs = 0;
      |                               ^~
segments.cpp:67:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for(int i = 0; i < v.size(); i++) {
      |                        ~~^~~~~~~~~~
segments.cpp:79:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |             for(int i = 0; i < v.size(); i++) {
      |                            ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 10 ms 204 KB Output is correct
4 Correct 8 ms 204 KB Output is correct
5 Correct 42 ms 460 KB Output is correct
6 Correct 47 ms 460 KB Output is correct
7 Correct 15 ms 332 KB Output is correct
8 Correct 32 ms 468 KB Output is correct
9 Correct 26 ms 340 KB Output is correct
10 Correct 12 ms 488 KB Output is correct
11 Correct 49 ms 436 KB Output is correct
12 Correct 52 ms 332 KB Output is correct
13 Correct 12 ms 460 KB Output is correct
14 Correct 24 ms 332 KB Output is correct
15 Correct 12 ms 204 KB Output is correct
16 Correct 9 ms 308 KB Output is correct
17 Correct 20 ms 372 KB Output is correct
18 Correct 17 ms 464 KB Output is correct
19 Correct 20 ms 384 KB Output is correct
20 Correct 22 ms 396 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4110 ms 1076 KB Output is correct
2 Correct 4334 ms 3680 KB Output is correct
3 Correct 4614 ms 3772 KB Output is correct
4 Correct 4342 ms 3660 KB Output is correct
5 Correct 964 ms 3596 KB Output is correct
6 Correct 542 ms 3644 KB Output is correct
7 Correct 4198 ms 3772 KB Output is correct
8 Correct 4132 ms 3872 KB Output is correct
9 Correct 4146 ms 3776 KB Output is correct
10 Correct 3059 ms 3860 KB Output is correct
11 Correct 4266 ms 3904 KB Output is correct
12 Correct 4061 ms 3620 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 217 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 10 ms 204 KB Output is correct
4 Correct 8 ms 204 KB Output is correct
5 Correct 42 ms 460 KB Output is correct
6 Correct 47 ms 460 KB Output is correct
7 Correct 15 ms 332 KB Output is correct
8 Correct 32 ms 468 KB Output is correct
9 Correct 26 ms 340 KB Output is correct
10 Correct 12 ms 488 KB Output is correct
11 Correct 49 ms 436 KB Output is correct
12 Correct 52 ms 332 KB Output is correct
13 Correct 12 ms 460 KB Output is correct
14 Correct 24 ms 332 KB Output is correct
15 Correct 12 ms 204 KB Output is correct
16 Correct 9 ms 308 KB Output is correct
17 Correct 20 ms 372 KB Output is correct
18 Correct 17 ms 464 KB Output is correct
19 Correct 20 ms 384 KB Output is correct
20 Correct 22 ms 396 KB Output is correct
21 Correct 4110 ms 1076 KB Output is correct
22 Correct 4334 ms 3680 KB Output is correct
23 Correct 4614 ms 3772 KB Output is correct
24 Correct 4342 ms 3660 KB Output is correct
25 Correct 964 ms 3596 KB Output is correct
26 Correct 542 ms 3644 KB Output is correct
27 Correct 4198 ms 3772 KB Output is correct
28 Correct 4132 ms 3872 KB Output is correct
29 Correct 4146 ms 3776 KB Output is correct
30 Correct 3059 ms 3860 KB Output is correct
31 Correct 4266 ms 3904 KB Output is correct
32 Correct 4061 ms 3620 KB Output is correct
33 Incorrect 217 ms 504 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 10 ms 204 KB Output is correct
4 Correct 8 ms 204 KB Output is correct
5 Correct 42 ms 460 KB Output is correct
6 Correct 47 ms 460 KB Output is correct
7 Correct 15 ms 332 KB Output is correct
8 Correct 32 ms 468 KB Output is correct
9 Correct 26 ms 340 KB Output is correct
10 Correct 12 ms 488 KB Output is correct
11 Correct 49 ms 436 KB Output is correct
12 Correct 52 ms 332 KB Output is correct
13 Correct 12 ms 460 KB Output is correct
14 Correct 24 ms 332 KB Output is correct
15 Correct 12 ms 204 KB Output is correct
16 Correct 9 ms 308 KB Output is correct
17 Correct 20 ms 372 KB Output is correct
18 Correct 17 ms 464 KB Output is correct
19 Correct 20 ms 384 KB Output is correct
20 Correct 22 ms 396 KB Output is correct
21 Correct 4110 ms 1076 KB Output is correct
22 Correct 4334 ms 3680 KB Output is correct
23 Correct 4614 ms 3772 KB Output is correct
24 Correct 4342 ms 3660 KB Output is correct
25 Correct 964 ms 3596 KB Output is correct
26 Correct 542 ms 3644 KB Output is correct
27 Correct 4198 ms 3772 KB Output is correct
28 Correct 4132 ms 3872 KB Output is correct
29 Correct 4146 ms 3776 KB Output is correct
30 Correct 3059 ms 3860 KB Output is correct
31 Correct 4266 ms 3904 KB Output is correct
32 Correct 4061 ms 3620 KB Output is correct
33 Incorrect 203 ms 412 KB Output isn't correct
34 Halted 0 ms 0 KB -