oj.uz

답안 #446711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446711 2021-07-23T07:08:15 Z Khizri XORanges (eJOI19_xoranges) C++17
30 / 100
 1000 ms 1860 KB 
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n,q,arr[mxn];
void solve(){
	scanf("%lld %lld",&n,&q);
	for(int i=1;i<=n;i++){
		scanf("%lld",&arr[i]);
	}
	while(q--){
		ll k,l,r;
		scanf("%lld %lld %lld",&k,&l,&r);
		if(k==1){
			arr[l]=r;
		}
		else{
			ll ans=0;
			for(int i=l;i<=r;i++){
				ll k=0;
				for(int j=i;j<=r;j++){
					k=(k^arr[j]);
					ans=(ans^k);
				}
			}
			printf("%lld\n",ans);
		}
	}
}
int main(){
	//IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

xoranges.cpp: In function 'void solve()':
xoranges.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  scanf("%lld %lld",&n,&q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
xoranges.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |   scanf("%lld",&arr[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~
xoranges.cpp:53:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |   scanf("%lld %lld %lld",&k,&l,&r);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 292 KB Output is correct
2 Correct 6 ms 204 KB Output is correct
3 Correct 7 ms 292 KB Output is correct
4 Correct 28 ms 292 KB Output is correct
5 Correct 27 ms 204 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 292 KB Output is correct
7 Correct 6 ms 204 KB Output is correct
8 Correct 7 ms 292 KB Output is correct
9 Correct 28 ms 292 KB Output is correct
10 Correct 27 ms 204 KB Output is correct
11 Execution timed out 1079 ms 300 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1086 ms 1860 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 292 KB Output is correct
7 Correct 6 ms 204 KB Output is correct
8 Correct 7 ms 292 KB Output is correct
9 Correct 28 ms 292 KB Output is correct
10 Correct 27 ms 204 KB Output is correct
11 Execution timed out 1079 ms 300 KB Time limit exceeded
12 Halted 0 ms 0 KB -