#if 0
cat <<EOF >mistaken-paste
#endif
// thx Ebi-chan!
#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>
#define BIG 2000000007
#define VERYBIG 20000000000000007LL
#define MOD 1000000007
#define FOD 998244353
typedef uint64_t ull;
typedef int64_t sll;
#define N_MAX 1048576
#ifdef __cplusplus
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <functional>
#include <array>
using std::queue;
using std::priority_queue;
using std::stack;
using std::tuple;
using std::set;
using std::map;
using std::vector;
using std::greater;
using std::pair;
using std::string;
using std::get;
template <typename T, typename U>
pair<T, U> operator+(pair<T, U> l, pair<T, U> r) {
return pair<T, U>(l.first + r.first, l.second + r.second);
}
#endif
typedef struct {
sll a;
sll b;
} hwll;
typedef struct {
sll a;
sll b;
sll c;
} hwllc;
typedef struct {
hwll a;
hwll b;
} linell;
typedef struct {
double a;
double b;
} hwreal;
ull n, m;
ull h, w;
ull k;
ull q;
sll va, vb, vc, vd, ve, vf;
ull ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;
ull umin (ull x, ull y) {
return (x < y) ? x : y;
}
ull umax (ull x, ull y) {
return (x > y) ? x : y;
}
sll smin (sll x, sll y) {
return (x < y) ? x : y;
}
sll smax (sll x, sll y) {
return (x > y) ? x : y;
}
ull gcd (ull x, ull y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
ull bitpow (ull a, ull x, ull modulo) {
ull result = 1;
while (x) {
if (x & 1) {
result *= a;
result %= modulo;
}
x /= 2;
a = (a * a) % modulo;
}
return result;
}
ull divide (ull a, ull b, ull modulo) {
return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}
ull udiff (ull a, ull b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
sll sdiff (sll a, sll b) {
if (a >= b) {
return a - b;
} else {
return b - a;
}
}
int bitcount (ull n) {
int result = 0;
while (n) {
if (n & 1) result++;
n /= 2;
}
return result;
}
#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)
#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right
#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1
// int32_t pullcomp (const void *left, const void *right) {
// ull l = *(ull*)left;
// ull r = *(ull*)right;
// if (l < r) {
// return -1;
// }
// if (l > r) {
// return +1;
// }
// return 0;
// }
BEGCMP(pullcomp){
DEFLR(ull);
CMPRET(l, r);
return 0;
}
BEGCMP(prevcomp){
DEFLR(sll);
CMPRET(r, l);
return 0;
}
BEGCMP(psllcomp){
DEFLR(sll);
CMPRET(l, r);
return 0;
}
BEGCMP(pcharcomp){
DEFLR(char);
CMPRET(l, r);
return 0;
}
BEGCMP(pdoublecomp){
DEFLR(double);
CMPRET(l, r);
return 0;
}
int32_t pstrcomp (const void *left, const void *right) {
char* l = *(char**)left;
char* r = *(char**)right;
return strcmp(l, r);
}
BEGCMP(phwllABcomp){
DEFLR(hwll);
CMPRET(l.a, r.a);
CMPRET(l.b, r.b);
return 0;
}
BEGCMP(phwllREVcomp){
DEFLR(hwll);
CMPRET(l.b, r.b);
CMPRET(l.a, r.a);
return 0;
}
BEGCMP(ptriplecomp){
DEFLR(hwllc);
CMPRET(l.a, r.a);
CMPRET(l.b, r.b);
CMPRET(l.c, r.c);
return 0;
}
BEGCMP(ptripleREVcomp){
DEFLR(hwllc);
CMPRET(l.b, r.b);
CMPRET(l.a, r.a);
CMPRET(l.c, r.c);
return 0;
}
BEGCMP(ptripleCABcomp){
DEFLR(hwllc);
CMPRET(l.c, r.c);
CMPRET(l.a, r.a);
CMPRET(l.b, r.b);
return 0;
}
BEGCMP(phwrealcomp){
DEFLR(hwreal);
CMPRET(l.a, r.a);
CMPRET(l.b, r.b);
return 0;
}
int32_t pquadcomp (const void *left, const void *right) {
linell l = *(linell*)left;
linell r = *(linell*)right;
sll ac = phwllABcomp(&(l.a), &(r.a));
if (ac) return ac;
sll bc = phwllABcomp(&(l.b), &(r.b));
if (bc) return bc;
return 0;
}
int32_t pfracomp (const void *left, const void *right) {
hwllc l = *(hwllc*)left;
hwllc r = *(hwllc*)right;
CMPRET(l.a * r.b, l.b * r.a);
return 0;
}
bool isinrange (sll left, sll x, sll right) {
return (left <= x && x <= right);
}
bool isinrange_soft (sll left, sll x, sll right) {
return (left <= x && x <= right) || (left >= x && x >= right);
}
void sw (sll *l, sll *r) {
sll t = *l;
*l = *r;
*r = t;
}
sll a[N_MAX + 5];
// ull a[N_MAX + 5];
// sll a[3001][3001];
sll b[N_MAX + 5];
// ull b[N_MAX + 5];
// sll b[3001][3001];
sll c[N_MAX + 5];
sll d[N_MAX + 5];
sll e[N_MAX * 4];
char s[N_MAX + 1];
// char s[3010][3010];
char t[N_MAX + 1];
// char t[3010][3010];
char u[N_MAX + 1];
hwll xy[N_MAX * 2 + 5];
hwllc tup[N_MAX + 5];
// sll table[3005][3005];
ull gin[N_MAX];
// here we go
int seg[1048576 * 2], base = 1048576;
int lb (sll x) {
// return std::lower_bound(d, d + n, x) - d;
int ok = n, ng = -1;
while (ng + 1 < ok) {
int med = (ok + ng) / 2;
if (xy[med].a >= x) {
ok = med;
} else {
ng = med;
}
}
// printf("%lld lb: %d\n", x, ok);
return ok;
}
int seg_add (int v) {
v += base;
while (v) {
seg[v]++;
v >>= 1;
}
}
int seg_find (int l, int r) {
int x = 0;
for ((l += base), (r += base); l < r; (l >>= 1), (r >>= 1)) {
if (l & 1) x += seg[l++];
if (r & 1) x += seg[--r];
}
return x;
}
ull solve () {
sll i, j, ki, li;
// ull result = 0;
sll result = 0;
double dresult = 0;
// ull maybe = 0;
sll maybe = 0;
// ull sum = 0;
sll sum = 0;
sll item;
sll *dpcell;
n = 100000;
for (i = 0; i < n; i++) {
a[i] = i * i % 100000007;
}
// if (n > 4000) abort();
for (i = 0; i < 29; i++) {
for (j = 0; j < n; j++) {
b[j] = (a[j] & ((1LL << i) * 2 - 1));
// if (i < 4) printf("%lld@[%lld]: %lld\n", i, j, b[j]);
xy[j] = (hwll){b[j], j};
}
qsort(xy, n, sizeof(hwll), phwllABcomp);
for (j = 0; j < n; j++) {
c[xy[j].b] = j;
d[j] = xy[j].a;
}
for (j = base * 2 - 1; j; j--) seg[j] = 0;
ull cnt = 0;
for (j = 0; j < n; j++) {
ki = c[j] + base;
while (ki) {
seg[ki]++;
ki >>= 1;
}
// seg_add(c[j]);
// if (i < 4) printf("add: %lld\n", c[j]);
sll cl = (1LL << i), cr = ((1LL << i) * 2 - 1);
if (b[j] >= (1LL << i)) {
sll l = cl + cl - b[j];
sll r = cr + cl - b[j];
// if (i < 4) printf("%lld - [%lld, %lld]\n", j + 1, l, r);
cnt += (j + 1) - seg_find(lb(l), lb(r + 1));
} else {
sll l = cl - b[j];
sll r = cr - b[j];
// if (i < 4) printf("[%lld, %lld]\n", l, r);
cnt += seg_find(lb(l), lb(r + 1));
}
// if (i < 4) printf("%lld:%lld: %lld...\n", i, j, cnt);
}
if (cnt & 1LL) result |= (1LL << i);
}
// maybe = 0;
// for (i = 0; i < n; i++) {
// for (j = i; j < n; j++) {
// maybe ^= (a[i] + a[j]);
// }
// }
// printf("true: %lld\n", maybe);
printf("%lld\n", result);
// printf("%.15f\n", dresult);
// puts(s);
return 0;
success:
// puts("YES");
puts("Yes");
// printf("%llu\n", result);
// puts("0");
// puts("First");
return 0;
fail:
// puts("NO");
// puts("No");
// puts("0");
puts("-1");
// puts("-1 -1 -1");
// puts("Second");
return 1;
}
int32_t main (int argc, char *argv[]) {
int32_t i, j;
n = 5;
m = 0;
// scanf("%llu%llu", &h, &w);
scanf("%llu", &n, &m);
// scanf("%llu", &k, &n, &m);
// scanf("%llu%llu", &h, &w);
// scanf("%llu", &q);
// scanf("%lld", &va, &vb, &vc, &vd);
// va--;
// vb--;
// scanf("%llu%llu%llu%llu", &ua, &ub, &uc, &ud, &ue);
// scanf("%s", s);
// scanf("%s", t);
// scanf("%s", u);
// scanf("%llu", &k);
// scanf("%lld", &m);
// for (i = 0; i < n; i++) {
// // scanf("%lld", &a[i]);
// scanf("%lld", &d[i]);
// }
// scanf("%llu", &q);
for (i = 0; i < n; i++) {
// scanf("%lld%lld", &xy[i].a, &xy[i].b);
// scanf("%lld%lld%lld", &tup[i].a, &tup[i].b, &tup[i].c);
// scanf("%lld", &c[i]);
scanf("%lld", &a[i]);
// scanf("%lld", &b[i]);
// scanf("%lld", &c[i]);
// scanf("%lld", &d[i]);
// a[i]--;
// b[i]--;
// c[i]--;
// d[i]--;
// xy[i].a--;
// xy[i].b--;
// tup[i].a--;
// tup[i].b--;
}
// scanf("%llu", &m);
// for (i = 0; i < n; i++) {
// // scanf("%lld%lld", &a[i], &b[i]);
// scanf("%lld", &b[i]);
// // a[i]--;
// // b[i]--;
// // scanf("%lld", &c[i]);
// // scanf("%lld", &d[i]);
// // scanf("%lld", &e[i]);
// // c[i]--;
// // d[i]--;
// }
// for (i = 0; i < q; i++) {
// // scanf("%lld%lld", &xy[i].a, &xy[i].b);
// scanf("%lld", &c[i]);
// // xy[i].a--;
// // xy[i].b--;
// }
// for (i = 0; i < n; i++) {
// for (j = 0; j < m; j++) {
// scanf("%lld", &table[i][j]);
// // table[i][j]--;
// }
// }
// for (i = 0; i < h; i++) {
// scanf("%s", s[i]);
// }
// scanf("%llu", &q);
solve();
return 0;
}
Compilation message
xorsum.c: In function 'solve':
xorsum.c:398:13: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'sll {aka long int}' [-Wformat=]
printf("%lld\n", result);
~~~^
%ld
xorsum.c:412:2: warning: label 'fail' defined but not used [-Wunused-label]
fail:
^~~~
xorsum.c:404:2: warning: label 'success' defined but not used [-Wunused-label]
success:
^~~~~~~
xorsum.c:338:7: warning: unused variable 'dpcell' [-Wunused-variable]
sll *dpcell;
^~~~~~
xorsum.c:337:6: warning: unused variable 'item' [-Wunused-variable]
sll item;
^~~~
xorsum.c:336:6: warning: unused variable 'sum' [-Wunused-variable]
sll sum = 0;
^~~
xorsum.c:334:6: warning: unused variable 'maybe' [-Wunused-variable]
sll maybe = 0;
^~~~~
xorsum.c:332:9: warning: unused variable 'dresult' [-Wunused-variable]
double dresult = 0;
^~~~~~~
xorsum.c:329:16: warning: unused variable 'li' [-Wunused-variable]
sll i, j, ki, li;
^~
xorsum.c: In function 'main':
xorsum.c:429:12: warning: format '%llu' expects argument of type 'long long unsigned int *', but argument 2 has type 'ull * {aka long unsigned int *}' [-Wformat=]
scanf("%llu", &n, &m);
~~~^ ~~
%lu
xorsum.c:429:8: warning: too many arguments for format [-Wformat-extra-args]
scanf("%llu", &n, &m);
^~~~~~
xorsum.c:452:13: warning: format '%lld' expects argument of type 'long long int *', but argument 2 has type 'sll * {aka long int *}' [-Wformat=]
scanf("%lld", &a[i]);
~~~^ ~~~~~
%ld
xorsum.c:423:13: warning: unused variable 'j' [-Wunused-variable]
int32_t i, j;
^
xorsum.c: In function 'seg_add':
xorsum.c:318:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
xorsum.c: In function 'main':
xorsum.c:429:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu", &n, &m);
^~~~~~~~~~~~~~~~~~~~~
xorsum.c:452:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &a[i]);
^~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1660 ms |
15068 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1670 ms |
21924 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1670 ms |
21924 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1660 ms |
15068 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1660 ms |
15068 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
