oj.uz

답안 #549843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549843 2022-04-16T16:12:11 Z Vovamatrix XORanges (eJOI19_xoranges) C++14
38 / 100
 105 ms 11140 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 200007

void update(vector<ll>& v, ll k, ll x)
{
    while(k<v.size())
    {
        v[k]^=x;
        k+=k&-k;
    }
}
ll prefsum1(const vector<ll>& v, ll k)
{
    ll sum=0;
    while(k>0)
    {
        sum^=v[k];
        k-=k&-k;
    }
    return sum;
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    ll n,q; cin>>n>>q;
    vector<ll> BIT2(n+1,0),BIT3(n+1,0),a(n+1,0);
    for(int i=1;i<=n;i++)
    {
        ll x; cin>>x; a[i]=x;
        if(i%2==0) update(BIT2, i, x);
        else update(BIT3, i, x);
    }
    for(int i=1;i<=q;i++)
    {
        ll x,y,z; cin>>x>>y>>z;
        if(x==2)
        {
            if((z-y+1)%2==0) cout<<0<<endl;
            else
            {
                if(y%2==0) cout<<((prefsum1(BIT2, z))^(prefsum1(BIT2, y-1)))<<endl;
                else cout<<((prefsum1(BIT3, z))^(prefsum1(BIT3, y-1)))<<endl;
            }
        }
        else
        {
            if(y%2==0) update(BIT2, y, z-a[y]);
            else update(BIT3, y, z-a[y]);
            a[y]=z;
        }
    }
    return 0;
}

Compilation message

xoranges.cpp: In function 'void update(std::vector<long long int>&, long long int, long long int)':
xoranges.cpp:23:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     while(k<v.size())
      |           ~^~~~~~~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

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 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 6204 KB Output is correct
2 Correct 105 ms 11012 KB Output is correct
3 Correct 101 ms 11140 KB Output is correct
4 Correct 91 ms 10644 KB Output is correct
5 Correct 94 ms 10764 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -