제출 #464061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464061		CyberCow	XORanges (eJOI19_xoranges)	C++17	0 / 100	390 ms	2168 KiB

xoranges

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <cmath>
#include <map>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <stack>
using namespace std;
using ll = long long;
vector <int> v, anc;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, q, i, j, x, ans = 0, c,y;
    cin >> n >> q;
    for ( i = 0; i < n; i++)
    {
        cin >> x;
        v.push_back(x);
    }
    ans = 0;
    int g = 0;
    for ( i = 0; i < q; i++)
    {
        cin >> c >> x >> y;
        x--; y--;
        if (c == 1)
        {
            g = 0;
            v[x] = y + 1;
        }
        else
        {
            if (g)
                cout << ans << endl;
            else
            {

                int f = 0;
                for (j = x; j <= y; j++)
                {
                    if(((j - x + 1) * (y - j + 1))%2)
                        f = f ^ v[j];
                }
                ans = f;
                g = 1;
                cout << ans << '\n';
            }
        }
    }
    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 18
• Subtask 3: 0 / 25
• Subtask 4: 0 / 20
• Subtask 5: 0 / 25