oj.uz

Submission #495747

# Submission time Handle Problem Language Result Execution time Memory
495747 2021-12-20T04:09:54 Z Nalrimet Segments (IZhO18_segments) C++17
7 / 100
 5000 ms 2504 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;
const int inf = 1000000000;

#define int long long
#define F first
#define S second
#define pb push_back

int n, t, a, b, lastans, k, id;
bool used[N];
vector<pair<int, int>> v;

 main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> t;

    int type;

    while(n--){
        cin >> type;
        if(type == 1){
            cin >> a >> b;
            a = a ^ (t * lastans);
            b = b ^ (t * lastans);
            if(a > b) swap(a, b);
//            cout << a << ' ' << b << '\n';
            used[v.size()] = 1;
            v.pb({a, b});
        }
        else if(type == 2){
            cin >> id;
//            cout << id - 1 << '\n';;
            used[id - 1] = 0;
        }
        else{
            cin >> a >> b >> k;
            a = a ^ (t * lastans);
            b = b ^ (t * lastans);
            if(a > b) swap(a, b);
//            cout << a << ' ' << b << '\n';
            lastans = 0;
            for(int i = 0; i < v.size(); ++i){
                if(used[i]){
//                    cout << v[i].F << ' ' << v[i].S << '\n';
                    if(a <= v[i].F && v[i].S <= b){
                        if(v[i].S - v[i].F + 1 >= k) lastans++;
                    }
                    else if(a <= v[i].F && v[i].F <= b){
                        if(b - v[i].F + 1 >= k) lastans++;
                    }
                    else if(a <= v[i].S && v[i].S <= b){
                        if(v[i].S - a + 1 >= k) lastans++;
                    }
                    else if(v[i].F <= a && b <= v[i].S){
                        if(b - a + 1 >= k) lastans++;
                    }
                }
            }
//            l x y r
//            l x r y
//            x l y r
//            x l r y
            cout << lastans << '\n';
        }
    }

    return 0;

}

Compilation message

segments.cpp:17:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 |  main() {
      |  ^~~~
segments.cpp: In function 'int main()':
segments.cpp:50:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |             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 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 34 ms 520 KB Output is correct
6 Correct 41 ms 456 KB Output is correct
7 Correct 17 ms 332 KB Output is correct
8 Correct 22 ms 440 KB Output is correct
9 Correct 19 ms 452 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 56 ms 428 KB Output is correct
12 Correct 56 ms 412 KB Output is correct
13 Correct 10 ms 460 KB Output is correct
14 Correct 21 ms 436 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 23 ms 332 KB Output is correct
18 Correct 13 ms 460 KB Output is correct
19 Correct 20 ms 424 KB Output is correct
20 Correct 20 ms 332 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 595 ms 1540 KB Output is correct
2 Correct 470 ms 1516 KB Output is correct
3 Correct 708 ms 1532 KB Output is correct
4 Correct 484 ms 1572 KB Output is correct
5 Execution timed out 5048 ms 2504 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 1576 KB Output is correct
2 Correct 522 ms 1572 KB Output is correct
3 Correct 555 ms 1528 KB Output is correct
4 Correct 536 ms 1584 KB Output is correct
5 Execution timed out 5095 ms 2504 KB Time limit exceeded
6 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 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 34 ms 520 KB Output is correct
6 Correct 41 ms 456 KB Output is correct
7 Correct 17 ms 332 KB Output is correct
8 Correct 22 ms 440 KB Output is correct
9 Correct 19 ms 452 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 56 ms 428 KB Output is correct
12 Correct 56 ms 412 KB Output is correct
13 Correct 10 ms 460 KB Output is correct
14 Correct 21 ms 436 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 23 ms 332 KB Output is correct
18 Correct 13 ms 460 KB Output is correct
19 Correct 20 ms 424 KB Output is correct
20 Correct 20 ms 332 KB Output is correct
21 Execution timed out 5058 ms 1484 KB Time limit exceeded
22 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 0 ms 204 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 34 ms 520 KB Output is correct
6 Correct 41 ms 456 KB Output is correct
7 Correct 17 ms 332 KB Output is correct
8 Correct 22 ms 440 KB Output is correct
9 Correct 19 ms 452 KB Output is correct
10 Correct 8 ms 460 KB Output is correct
11 Correct 56 ms 428 KB Output is correct
12 Correct 56 ms 412 KB Output is correct
13 Correct 10 ms 460 KB Output is correct
14 Correct 21 ms 436 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 23 ms 332 KB Output is correct
18 Correct 13 ms 460 KB Output is correct
19 Correct 20 ms 424 KB Output is correct
20 Correct 20 ms 332 KB Output is correct
21 Execution timed out 5058 ms 1484 KB Time limit exceeded
22 Halted 0 ms 0 KB -