oj.uz

답안 #1100123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100123 2024-10-12T20:13:35 Z _snoopy_ XORanges (eJOI19_xoranges) C++17
30 / 100
 1000 ms 3924 KB 
#include <bits/stdc++.h>
using namespace std;

long long int arr[1000010];
int main(){


    long long int n, q, i, j, k, a, b, c, x, d;
    cin>>n>>q;

    for(i=1; i<=n; i++){
        cin>>arr[i];
    }

    for(i=0; i<q; i++){
        cin>>a>>b>>c;

        if(a==1){
            arr[b]=c;
        }
        else{
            x=0;
//            for(j=b+1; j<=c; j++){
//                x=x^arr[j];
//            }
            //cout<<x<<endl;
            for(j=b; j<=c; j++){
                d=0;
                for(k=j; k<=c; k++){
                    d=d^arr[k];
                    x=x^d;
                }
            }
            cout<<x<<endl;
        }
    }


    return 0;

}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 444 KB Output is correct
5 Correct 1 ms 444 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 18 ms 348 KB Output is correct
5 Correct 18 ms 348 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 444 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 18 ms 348 KB Output is correct
10 Correct 18 ms 348 KB Output is correct
11 Execution timed out 1035 ms 600 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1059 ms 3924 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 444 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 18 ms 348 KB Output is correct
10 Correct 18 ms 348 KB Output is correct
11 Execution timed out 1035 ms 600 KB Time limit exceeded
12 Halted 0 ms 0 KB -