oj.uz

답안 #477890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477890 2021-10-04T13:04:02 Z pragmatist XORanges (eJOI19_xoranges) C++17
30 / 100
 1000 ms 1752 KB 
#include <bits/stdc++.h>                       
#include <ext/pb_ds/assoc_container.hpp>
 
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(v) v.size()
#define x first
#define y second
#define int long long         
#define nl "\n"
 
using namespace std;

typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair <ll, ll> pii;

const int N = (int)3e5 + 7;
const int M = (int)7e6 + 7;
const ll MOD = (ll)1e9 + 7;                    
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;

pii dir[] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};

int n, q, a[N];

void solve() {
	cin >> n >> q;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	while(q--) {
		char c;
		cin >> c;
		int l, r;
		cin >> l >> r;
		if(c == '1') a[l] = r;
		else {
			int res = 0;
			for(int i = l; i <= r; ++i) {
				int cur = 0;
				for(int j = i; j <= r; ++j) {
					cur ^= a[j];
					res ^= cur;			
				}
			}
			cout << res << nl;
		}
	}
} 

signed main() {                   
	ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int test = 1;                       
	//cin >> test;
	for(int i = 1; i <= test; i++) {
        //cout << "Case " << i << ":\n";
        solve();
    }
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 320 KB Output is correct
2 Correct 11 ms 328 KB Output is correct
3 Correct 16 ms 328 KB Output is correct
4 Correct 46 ms 316 KB Output is correct
5 Correct 41 ms 204 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 320 KB Output is correct
7 Correct 11 ms 328 KB Output is correct
8 Correct 16 ms 328 KB Output is correct
9 Correct 46 ms 316 KB Output is correct
10 Correct 41 ms 204 KB Output is correct
11 Execution timed out 1088 ms 336 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

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

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 320 KB Output is correct
7 Correct 11 ms 328 KB Output is correct
8 Correct 16 ms 328 KB Output is correct
9 Correct 46 ms 316 KB Output is correct
10 Correct 41 ms 204 KB Output is correct
11 Execution timed out 1088 ms 336 KB Time limit exceeded
12 Halted 0 ms 0 KB -