oj.uz

Submission #343596

# Submission time Handle Problem Language Result Execution time Memory
343596 2021-01-04T08:58:28 Z Rakhmand Segments (IZhO18_segments) C++14
7 / 100
 5000 ms 1428 KB 
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>

using namespace std;

#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define no_answer {cout << "NO"; exit(0);}
#define FOR(i, start, finish, k) for(llong i = start; i <= finish; i += k)

const long long mxn = 2e5 + 110;
const long long mnn = 1e3 + 2;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
const long long OO = 1e9;

typedef long long llong;
typedef unsigned long long ullong;

int n, m, id = 0, ans = 0;
pair<int, int> p[mxn];

int main() {
    int n, type;
    cin >> n >> type;
    while(n--){
        int t;
        cin >> t;
        if(t == 1){
            int l, r;
            cin >> l >> r;
            p[++id] = {l, r};
        }else if(t == 2){
            int x;
            cin >> x;
            p[x] = {OO, -OO};
        }else{
            int l, r, k;
            cin >> l >> r >> k;
            l = (l ^ (type * ans));
            r = (r ^ (type * ans));
            if(l > r) swap(l, r);
            ans = 0;
            for(int j = 1; j <= id; j++){
                int inter = min(r, p[j].S) - max(p[j].F, l) + 1;
                if(inter >= k){
                    ans++;
                }
            }
            cout << ans << nl;
        }
    }
}

/*
 5 4 4
 1 2
 3 1
 4 3
 5 3
 4 5 2 3
 2 1 3 1
 1 3 5
 2 3 4 5
 2 1 3 1
 
 6 1
 1 1 2
 3 2 4 2
 1 3 5
 3 2 3 1
 2 1
 3 0 3 1
 
 6 0
 1 3 10
 1 3 5
 3 6 10 6
 2 1
 1 3 10
 3 6 4 2
 */

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 15 ms 492 KB Output is correct
4 Correct 15 ms 492 KB Output is correct
5 Correct 25 ms 492 KB Output is correct
6 Correct 32 ms 492 KB Output is correct
7 Correct 19 ms 492 KB Output is correct
8 Correct 23 ms 492 KB Output is correct
9 Correct 21 ms 492 KB Output is correct
10 Correct 11 ms 492 KB Output is correct
11 Correct 43 ms 668 KB Output is correct
12 Correct 42 ms 492 KB Output is correct
13 Correct 11 ms 492 KB Output is correct
14 Correct 18 ms 492 KB Output is correct
15 Correct 11 ms 492 KB Output is correct
16 Correct 12 ms 492 KB Output is correct
17 Correct 20 ms 492 KB Output is correct
18 Correct 13 ms 492 KB Output is correct
19 Correct 24 ms 492 KB Output is correct
20 Correct 21 ms 492 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1010 ms 768 KB Output is correct
2 Correct 1010 ms 1132 KB Output is correct
3 Correct 1060 ms 748 KB Output is correct
4 Correct 995 ms 876 KB Output is correct
5 Execution timed out 5055 ms 1336 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1004 ms 876 KB Output is correct
2 Correct 988 ms 876 KB Output is correct
3 Correct 1022 ms 1004 KB Output is correct
4 Correct 997 ms 768 KB Output is correct
5 Execution timed out 5033 ms 1428 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 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 15 ms 492 KB Output is correct
4 Correct 15 ms 492 KB Output is correct
5 Correct 25 ms 492 KB Output is correct
6 Correct 32 ms 492 KB Output is correct
7 Correct 19 ms 492 KB Output is correct
8 Correct 23 ms 492 KB Output is correct
9 Correct 21 ms 492 KB Output is correct
10 Correct 11 ms 492 KB Output is correct
11 Correct 43 ms 668 KB Output is correct
12 Correct 42 ms 492 KB Output is correct
13 Correct 11 ms 492 KB Output is correct
14 Correct 18 ms 492 KB Output is correct
15 Correct 11 ms 492 KB Output is correct
16 Correct 12 ms 492 KB Output is correct
17 Correct 20 ms 492 KB Output is correct
18 Correct 13 ms 492 KB Output is correct
19 Correct 24 ms 492 KB Output is correct
20 Correct 21 ms 492 KB Output is correct
21 Execution timed out 5074 ms 1320 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 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 15 ms 492 KB Output is correct
4 Correct 15 ms 492 KB Output is correct
5 Correct 25 ms 492 KB Output is correct
6 Correct 32 ms 492 KB Output is correct
7 Correct 19 ms 492 KB Output is correct
8 Correct 23 ms 492 KB Output is correct
9 Correct 21 ms 492 KB Output is correct
10 Correct 11 ms 492 KB Output is correct
11 Correct 43 ms 668 KB Output is correct
12 Correct 42 ms 492 KB Output is correct
13 Correct 11 ms 492 KB Output is correct
14 Correct 18 ms 492 KB Output is correct
15 Correct 11 ms 492 KB Output is correct
16 Correct 12 ms 492 KB Output is correct
17 Correct 20 ms 492 KB Output is correct
18 Correct 13 ms 492 KB Output is correct
19 Correct 24 ms 492 KB Output is correct
20 Correct 21 ms 492 KB Output is correct
21 Execution timed out 5074 ms 1320 KB Time limit exceeded
22 Halted 0 ms 0 KB -