oj.uz

Submission #930758

# Submission time Handle Problem Language Result Execution time Memory
930758 2024-02-20T11:25:46 Z Baizho XOR Sum (info1cup17_xorsum) C++14
100 / 100
 801 ms 44788 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e6)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

#define int ll

int n, b[N];

int get(int l, int r) {
	// a[i] + a[j] <= r, a[i] + a[j] >= l
//	for(int i = 1; i <= n; i ++) cout<<b[i]<<" ";
//	cout<<endl;
	int p = n, j = n, cnt = 0;
	for(int i = 1; i <= n; i ++) {
		while(p >= 1 && b[i] + b[p] > r) p --;
		while(j >= 1 && b[i] + b[j] >= l) j --;
		cnt += (max(i - 1, p) - max(i - 1, j));
	}
//	cout<<l<<" "<<r<<" "<<cnt<<endl;
	return cnt;
}
 
void Baizho() {
	cin>>n;
	for(int i = 1; i <= n; i ++) cin>>b[i];
	sort(b + 1, b + n + 1);
	int ans = 0;
	for(int k = 29; k >= 0; k --) {
		int cnt = get((1 << k), (1 << k + 1) - 1) + get((1 << k) + (1 << k + 1), (inf));
		if(cnt & 1) ans ^= (1ll << k);
		vector<int> num, num1, num2;
		for(int i = 1; i <= n; i ++) {
			if((b[i] >> k) & 1) {
				b[i] -= (1ll << k);
				num.pb(b[i]);
			} else {
				num2.pb(b[i]);
			}
		}
		merge(all(num2), all(num), back_inserter(num1));
		for(int i = 1; i <= n; i ++) {
			b[i] = num1[i - 1];
//			cout<<b[i]<<" ";
		}	
//		cout<<endl;
		
	}
	cout<<ans<<"\n";
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

xorsum.cpp: In function 'void Baizho()':
xorsum.cpp:61:35: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   61 |   int cnt = get((1 << k), (1 << k + 1) - 1) + get((1 << k) + (1 << k + 1), (inf));
      |                                 ~~^~~
xorsum.cpp:61:70: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   61 |   int cnt = get((1 << k), (1 << k + 1) - 1) + get((1 << k) + (1 << k + 1), (inf));
      |                                                                    ~~^~~
xorsum.cpp: In function 'void Freopen(std::string)':
xorsum.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xorsum.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 33408 KB Output is correct
2 Correct 505 ms 37676 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 33408 KB Output is correct
2 Correct 505 ms 37676 KB Output is correct
3 Correct 608 ms 41604 KB Output is correct
4 Correct 605 ms 41100 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 84 ms 6460 KB Output is correct
4 Correct 84 ms 6604 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 502 ms 33408 KB Output is correct
4 Correct 505 ms 37676 KB Output is correct
5 Correct 608 ms 41604 KB Output is correct
6 Correct 605 ms 41100 KB Output is correct
7 Correct 84 ms 6460 KB Output is correct
8 Correct 84 ms 6604 KB Output is correct
9 Correct 794 ms 44616 KB Output is correct
10 Correct 801 ms 44780 KB Output is correct
11 Correct 796 ms 44788 KB Output is correct