oj.uz

Submission #845685

# Submission time Handle Problem Language Result Execution time Memory
845685 2023-09-06T14:55:14 Z Darren0724 Segments (IZhO18_segments) C++17
15 / 100
 3642 ms 4632 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
const int N=505;
int v[N][N]{};
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,t;cin>>n>>t;
    int ans=0;
    vector<int> a,b,h;
    for(int i=0;i<n;i++){
        int id;cin>>id;
        if(id==1){
            int c,d;cin>>c>>d;
            c^=(t*ans);
            d^=(t*ans);
            a.push_back(c);
            b.push_back(d);
            h.push_back(1);
        }
        if(id==2){
            int p;cin>>p;
            h[p-1]=0;
        }
        if(id==3){
            int c,d,k;cin>>c>>d>>k;
            c^=(t*ans);
            d^=(t*ans);
            ans=0;
            int sz=a.size();
            for(int j=0;j<sz;j++){
                if((b[j]<d?b[j]:d)-(a[j]>c?a[j]:c)+1>=k){
                    ans++;
                }
            }
            cout<<ans<<'\n';
        }
    }
 
    return 0;
}
/*
6 1
1 1 2
3 2 4 2
1 3 5
3 2 3 1
2 1
3 0 3 1
*/

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3566 ms 4292 KB Output is correct
2 Correct 3633 ms 4108 KB Output is correct
3 Correct 3605 ms 4356 KB Output is correct
4 Correct 3623 ms 4632 KB Output is correct
5 Correct 793 ms 4040 KB Output is correct
6 Correct 413 ms 4244 KB Output is correct
7 Correct 3619 ms 4208 KB Output is correct
8 Correct 3579 ms 3960 KB Output is correct
9 Correct 3642 ms 3924 KB Output is correct
10 Correct 2232 ms 4444 KB Output is correct
11 Correct 2817 ms 4304 KB Output is correct
12 Correct 2983 ms 4580 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 810 ms 3576 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 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -