제출 #453683

#제출 시각아이디문제언어결과실행 시간메모리
453683myvaluskaXORanges (eJOI19_xoranges)C++14
12 / 100
1084 ms3104 KiB
#include <iostream> #include <vector> #include <string> #include <set> #include <cmath> #include <tuple> using namespace std; /*long long int power(long long int n, int k) { long long int vys = 1; for (int i = 0; i < k; i++) { vys = (vys * (n - i)) / (i + 1); } return vys; }*/ int main() { /*for (int i = 0; i < 10; i++) { std::cout << "Hello Flash!\n"; }*/ int n, q; cin >> n >> q; vector<int>v(n+1); for (int i = 0; i < n; i++) { cin >> v[i+1]; } while (q--) { int typ; cin >> typ; if (typ == 1) { int index; int cislo; cin >> index >> cislo; v[index] = cislo; } else if (typ == 2) { int l; int r; cin >> l; cin >> r; int vys=0; for (int i = 1; i <= r-l+1; i++) { for (int j = l; j+i-1 <= r; j++) { //int vys2 = v[i]; for (int k = j; k < j+i; k++) { vys ^= v[k]; } } } cout << vys << endl; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...