# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
631663 | 2022-08-18T11:52:17 Z | smartmonky | XORanges (eJOI19_xoranges) | C++14 | 1000 ms | 980 KB |
#include <iostream> #include <algorithm> #include <vector> #include <math.h> #include <set> #include <map> #define ll long long #define ff first #define ss second #define pb push_back #define all(x) (x).begin(),(x).end() using namespace std; main(){ int n,q; cin >> n>>q; vector <int> v(n+1); for(int i=1;i<=n;i++) cin >>v[i]; while(q--){ int type,x,y; cin >>type >>x >>y; if(type==1) v[x]=y; else{ int res=0; for(int k=0;k<=y-x+1;k++){ //cout<<k <<" "; for(int i=x;i+k<=y;i++){ //cout<<i <<" "; for(int j=i;j<=i+k;j++){ // cout<<v[j] <<" "; res^=v[j]; } // cout<<endl; } } cout <<res <<endl; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 5 ms | 212 KB | Output is correct |
5 | Correct | 4 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 539 ms | 212 KB | Output is correct |
2 | Correct | 462 ms | 212 KB | Output is correct |
3 | Correct | 620 ms | 212 KB | Output is correct |
4 | Execution timed out | 1074 ms | 308 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 5 ms | 212 KB | Output is correct |
5 | Correct | 4 ms | 212 KB | Output is correct |
6 | Correct | 539 ms | 212 KB | Output is correct |
7 | Correct | 462 ms | 212 KB | Output is correct |
8 | Correct | 620 ms | 212 KB | Output is correct |
9 | Execution timed out | 1074 ms | 308 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1088 ms | 980 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 5 ms | 212 KB | Output is correct |
5 | Correct | 4 ms | 212 KB | Output is correct |
6 | Correct | 539 ms | 212 KB | Output is correct |
7 | Correct | 462 ms | 212 KB | Output is correct |
8 | Correct | 620 ms | 212 KB | Output is correct |
9 | Execution timed out | 1074 ms | 308 KB | Time limit exceeded |
10 | Halted | 0 ms | 0 KB | - |