Submission #464063

# Submission time Handle Problem Language Result Execution time Memory
464063 2021-08-12T10:30:09 Z CyberCow XORanges (eJOI19_xoranges) C++17
55 / 100
1000 ms 1960 KB
#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)
        {
            v[x] = y + 1;
        }
        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;
}

Compilation message

xoranges.cpp: In function 'int main()':
xoranges.cpp:29:9: warning: variable 'g' set but not used [-Wunused-but-set-variable]
   29 |     int g = 0;
      |         ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 10 ms 460 KB Output is correct
12 Correct 7 ms 460 KB Output is correct
13 Correct 29 ms 484 KB Output is correct
14 Correct 28 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 1960 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 10 ms 460 KB Output is correct
12 Correct 7 ms 460 KB Output is correct
13 Correct 29 ms 484 KB Output is correct
14 Correct 28 ms 460 KB Output is correct
15 Execution timed out 1084 ms 1960 KB Time limit exceeded
16 Halted 0 ms 0 KB -