oj.uz

Submission #845712

# Submission time Handle Problem Language Result Execution time Memory
845712 2023-09-06T15:03:03 Z Darren0724 Segments (IZhO18_segments) C++17
15 / 100
 1095 ms 2888 KB 
#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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);
            if(c>d){
                swap(c,d);
            }
            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);
            if(c>d){
                swap(c,d);
            }
            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 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 2044 KB Output is correct
2 Correct 1055 ms 2088 KB Output is correct
3 Correct 1095 ms 2244 KB Output is correct
4 Correct 1047 ms 2232 KB Output is correct
5 Correct 236 ms 2848 KB Output is correct
6 Correct 130 ms 2888 KB Output is correct
7 Correct 1039 ms 2056 KB Output is correct
8 Correct 1027 ms 2044 KB Output is correct
9 Correct 997 ms 2284 KB Output is correct
10 Correct 641 ms 1368 KB Output is correct
11 Correct 795 ms 1584 KB Output is correct
12 Correct 850 ms 2656 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 25.0

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