oj.uz

Submission #343601

# Submission time Handle Problem Language Result Execution time Memory
343601 2021-01-04T09:12:40 Z koketsu Segments (IZhO18_segments) C++14
7 / 100
 5000 ms 4928 KB 
#include <bits/stdc++.h>
#define pb push_back
#define LL long long
#define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int LL

using namespace std;

const LL Mxn = 1e6 + 7;
const LL Mod = 1e9 + 7;
const LL Inf = 1e14 + 7;

bool Used[Mxn];

int N, t, Dup, lastans, Cnt;

vector <pair <int, int>> g;

int Check(int L, int R, int K){
    int Ans = 0;
    for(int i = 0; i < Cnt; i++){
        if(Used[i]) continue;
        int U = min(R, g[i].second) - max(L, g[i].first) + 1;
        if(U >= K) Ans++;
    }
    return Ans;
}

signed main(){
    Kultivator;
    cin >> N >> t;
    Dup += N;
    while(Dup--){
        int T;
        cin >> T;
        if(T == 1){
            int L, R;
            cin >> L >> R;
            L = (L ^ (t * lastans));
            R = (R ^ (t * lastans));
            Cnt++;
            if(L > R) swap(L, R);
            g.pb({L, R});
        } else if(T == 2){
            int Id;
            cin >> Id;
            Used[Id - 1] = true;
        } else {
            int L, R, K;
            cin >> L >> R >> K;
            L = (L ^ (t * lastans));
            R = (R ^ (t * lastans));
            if(L > R) swap(L, R);
            lastans = Check(L, R, K);
            cout << lastans << '\n';
        }
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 9 ms 492 KB Output is correct
6 Correct 11 ms 492 KB Output is correct
7 Correct 7 ms 492 KB Output is correct
8 Correct 8 ms 492 KB Output is correct
9 Correct 8 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 15 ms 492 KB Output is correct
12 Correct 15 ms 492 KB Output is correct
13 Correct 4 ms 492 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 4 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 8 ms 492 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 8 ms 492 KB Output is correct
20 Correct 8 ms 492 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 942 ms 1924 KB Output is correct
2 Correct 910 ms 1724 KB Output is correct
3 Correct 1049 ms 1900 KB Output is correct
4 Correct 906 ms 1852 KB Output is correct
5 Correct 4104 ms 2664 KB Output is correct
6 Correct 4819 ms 3948 KB Output is correct
7 Correct 4566 ms 4200 KB Output is correct
8 Correct 1073 ms 4324 KB Output is correct
9 Correct 683 ms 4324 KB Output is correct
10 Correct 2189 ms 4200 KB Output is correct
11 Correct 1948 ms 3844 KB Output is correct
12 Correct 2188 ms 4200 KB Output is correct
13 Correct 2650 ms 4748 KB Output is correct
14 Correct 4072 ms 3640 KB Output is correct
15 Correct 4032 ms 3456 KB Output is correct
16 Correct 3819 ms 3268 KB Output is correct
17 Execution timed out 5051 ms 3940 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 892 ms 1644 KB Output is correct
2 Correct 913 ms 1664 KB Output is correct
3 Correct 968 ms 1868 KB Output is correct
4 Correct 938 ms 1688 KB Output is correct
5 Correct 3614 ms 2536 KB Output is correct
6 Correct 2442 ms 4208 KB Output is correct
7 Correct 2820 ms 4324 KB Output is correct
8 Correct 3375 ms 4516 KB Output is correct
9 Correct 3705 ms 3872 KB Output is correct
10 Correct 1896 ms 4200 KB Output is correct
11 Correct 3525 ms 3696 KB Output is correct
12 Correct 359 ms 4580 KB Output is correct
13 Correct 2653 ms 4928 KB Output is correct
14 Correct 3882 ms 3756 KB Output is correct
15 Correct 766 ms 4324 KB Output is correct
16 Correct 2464 ms 4584 KB Output is correct
17 Execution timed out 5070 ms 4268 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 9 ms 492 KB Output is correct
6 Correct 11 ms 492 KB Output is correct
7 Correct 7 ms 492 KB Output is correct
8 Correct 8 ms 492 KB Output is correct
9 Correct 8 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 15 ms 492 KB Output is correct
12 Correct 15 ms 492 KB Output is correct
13 Correct 4 ms 492 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 4 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 8 ms 492 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 8 ms 492 KB Output is correct
20 Correct 8 ms 492 KB Output is correct
21 Execution timed out 5055 ms 2548 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 9 ms 492 KB Output is correct
6 Correct 11 ms 492 KB Output is correct
7 Correct 7 ms 492 KB Output is correct
8 Correct 8 ms 492 KB Output is correct
9 Correct 8 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 15 ms 492 KB Output is correct
12 Correct 15 ms 492 KB Output is correct
13 Correct 4 ms 492 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 4 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 8 ms 492 KB Output is correct
18 Correct 7 ms 492 KB Output is correct
19 Correct 8 ms 492 KB Output is correct
20 Correct 8 ms 492 KB Output is correct
21 Execution timed out 5055 ms 2548 KB Time limit exceeded
22 Halted 0 ms 0 KB -