oj.uz

답안 #676001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676001 2022-12-28T20:04:54 Z ghostwriter XORanges (eJOI19_xoranges) C++17
100 / 100
 97 ms 10952 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
struct Event {
	int type, f, s;
	Event() {}
	Event(int type, int f, int s) : type(type), f(f), s(s) {}
};
const int N = 2e5 + 5;
int n, q, a[N], f[2][N];
Event e[N];
void input(int test_id) {
	cin >> n >> q;
	FOR(i, 1, n) cin >> a[i];
	FOR(i, 1, q) cin >> e[i].type >> e[i].f >> e[i].s;
}
void upd(int pos1, int pos2, int v) { for (int i = pos2; i <= n; i += (i & -i)) f[pos1][i] ^= v; }
int get(int pos1, int pos2) { int rs = 0; for (int i = pos2; i > 0; i -= (i & -i)) rs ^= f[pos1][i]; return rs; }
void solve(int test_id) {
	FOR(i, 1, n) upd(i & 1, i, a[i]);
	FOR(i, 1, q) {
		int type = e[i].type, f = e[i].f, s = e[i].s;
		if (type == 1) {
			upd(f & 1, f, a[f] ^ s);
			a[f] = s;
		}
		else if ((s - f + 1) & 1) cout << (get(f & 1, s) ^ get(f & 1, f - 1)) << '\n';
		else cout << 0 << '\n';
	}
}
void reinit(int test_id) {

}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 2 ms 572 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 9180 KB Output is correct
2 Correct 83 ms 10952 KB Output is correct
3 Correct 86 ms 10948 KB Output is correct
4 Correct 75 ms 10628 KB Output is correct
5 Correct 80 ms 10772 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 2 ms 572 KB Output is correct
15 Correct 97 ms 9180 KB Output is correct
16 Correct 83 ms 10952 KB Output is correct
17 Correct 86 ms 10948 KB Output is correct
18 Correct 75 ms 10628 KB Output is correct
19 Correct 80 ms 10772 KB Output is correct
20 Correct 79 ms 10700 KB Output is correct
21 Correct 80 ms 10752 KB Output is correct
22 Correct 76 ms 10764 KB Output is correct
23 Correct 77 ms 10700 KB Output is correct
24 Correct 83 ms 10788 KB Output is correct