Submission #466772

# Submission time Handle Problem Language Result Execution time Memory
466772 2021-08-20T16:07:37 Z mtxas XORanges (eJOI19_xoranges) C++14
0 / 100
2 ms 716 KB
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define pll pair<ll, ll>
#define mii map<int, int>
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(x) ((int)x.size())
#define turbo() cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define _fre() freopen("input.txt", "r", stdin)
#define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
#define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
#define _forneq(a, b, c) for(int (a) = (b); (a) >= (c); (a)--)
#define _forn(a, b, c) for(int (a) = (b); (a) > (c); (a)--)
using namespace std;
/**********************************************************************************
                                STRUCTS
**********************************************************************************/

/**********************************************************************************
                               VARIABLES
**********************************************************************************/
#define int ll
const int maxn = 5001;
int a[maxn];
int t[maxn<<1];
int startIdRes[maxn];
/**********************************************************************************
                               FUNCTIONS
**********************************************************************************/

/**********************************************************************************
                                 MAIN
**********************************************************************************/
signed main(){
    //_fre();
    turbo();
    int n, q; cin>>n>>q;
    _foreq(i, 1, n) cin>>a[i];
    _for(g, 0, q){
        int type; cin>>type;
        if(type == 1){
            int i, val; cin>>i>>val;
            a[i] = val;
            //cout<<"a["<<i<<"] = "<<val<<endl;
        }
        else if(type == 2){
            int l, r; cin>>l>>r;
           // cout<<"query("<<l<<", "<<r<<")\n";
            int reply = 0;
            if(l&1 == r&1){
                _foreq(i, l, r){
                    if(i&1 == l&1) reply^= a[i];
                }
            }
            cout<<reply<<'\n';
        }
    }
}

Compilation message

xoranges.cpp: In function 'int main()':
xoranges.cpp:17:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
xoranges.cpp:44:5: note: in expansion of macro '_foreq'
   44 |     _foreq(i, 1, n) cin>>a[i];
      |     ^~~~~~
xoranges.cpp:16:31: warning: unnecessary parentheses in declaration of 'g' [-Wparentheses]
   16 | #define _for(a, b, c) for(int (a) = (b); (a) < (c); (a)++)
      |                               ^
xoranges.cpp:45:5: note: in expansion of macro '_for'
   45 |     _for(g, 0, q){
      |     ^~~~
xoranges.cpp:56:20: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   56 |             if(l&1 == r&1){
      |                  ~~^~~~
xoranges.cpp:17:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   17 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); (a)++)
      |                                 ^
xoranges.cpp:57:17: note: in expansion of macro '_foreq'
   57 |                 _foreq(i, l, r){
      |                 ^~~~~~
xoranges.cpp:58:28: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   58 |                     if(i&1 == l&1) reply^= a[i];
      |                          ~~^~~~
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -