# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
681240 | 2023-01-12T15:08:35 Z | USER | XOR Sum (info1cup17_xorsum) | C++14 | 615 ms | 11996 KB |
#include <bits/stdc++.h> using namespace std; class input { private: char* t; int sp; const int sz = 10000; char read() { if (sp == sz) { fread(t, 1, sz, stdin); sp = 0; return t[sp++]; } else return t[sp++]; } public: input() { sp = sz; t = new char[sz](); } input& operator >> (int& n) { char c = read(); while (c == ' ' || c == '\n') c = read(); n = 0; int sng = 1; if (c == '-') sng = -1, c = read(); while (c != '\0' && isdigit(c)) n = n * 10 + (c - '0'), c = read(); n *= sng; return *this; } input& operator >> (char& s) { char c = read(); while (c != '\0' && c == '\n') c = read(); s = c; return *this; } input& operator >> (long long& n) { char c = read(); while (c == ' ' || c == '\n') c = read(); n = 0; int sng = 1; if (c == '-') sng = -1, c = read(); while (c != '\0' && isdigit(c)) n = n * 10 + (c - '0'), c = read(); n *= sng; return *this; } void getline(string& s) { char c = read(); s = ""; while (c != '\0' && c != '\n') s += c, c = read(); } input& operator >> (string& s) { char c; c = read(); s = ""; while (c == '\n' || c == ' ') c = read(); while (c != '\n' && c != '\0' && c != ' ') s += c, c = read(); return *this; } input& operator >> (char* s) { char c; c = read(); int i = 0; while (c == '\n' || c == ' ') c = read(); while (c != '\n' && c != '\0' && c != ' ') s[i++] = c, c = read(); return *this; } }; class output { private: char* t; int sp; const int sz = 10000; void write(char c) { if (sp == sz) { fwrite(t, 1, sz, stdout); sp = 0; t[sp++] = c; } else t[sp++] = c; } public: output() { sp = 0; t = new char[sz](); } ~output() { fwrite(t, 1, sp, stdout); } output& operator << (int n) { if (n < 0) { write('-'); n *= -1; } if (n <= 9) write(char(n + '0')); else { (*this) << (n / 10); write(char(n % 10 + '0')); } return *this; } output& operator << (char c) { write(c); return *this; } output& operator << (const char* s) { int i = 0; while (s[i] != '\0') write(s[i++]); return *this; } output& operator << (long long n) { if (n < 0) { write('-'); n *= -1; } if (n < 10) write(char(n + '0')); else { (*this) << (n / 10); write(char(n % 10 + '0')); } return *this; } output& operator << (string s) { for (auto i : s) write(i); return *this; } void precizion(double x, int nr) { int p = int(floor(x)); *this << p; if (nr == 0) return; write('.'); for (int i = 1; i <= nr; i++) { x -= floor(x); x *= 10; write(int(x) + '0'); } } }; input fin; output fout; // (((1 << k) <= nr && nr < (1 << (k + 1))) || (nr >= (1 << k) + (1 << (k + 1)))) int v[1000001], X[1000001], n, POW[32], a[1000001], t[1000001]; int* vp, * xp; bool bit; int main() { int maxi = 0; for (int i = 0; i <= 30; i++) POW[i] = (1 << i); fin >> n; for (int i = 1; i <= n; i++) fin >> v[i], maxi = max(maxi, v[i]); int stop = ceil(log2(maxi)) + 1, l, r, m, poz1, poz2; int res = 0, downLim, upLim, aux; for (int k = 0; k <= stop; k++) { bit = false; vp = v; vp++; xp = X; xp++; for (int i = 1; i <= n; i++) { if (*vp & 1) *xp += POW[k]; *vp >>= 1; a[i] = *xp; vp++; xp++; } sort(a + 1, a + n + 1); aux = (1 << k) + (1 << (k + 1)); downLim = POW[k]; upLim = POW[k + 1] - 1; for (int i = 1; i <= n; i++) { poz1 = -1; l = i, r = n; while (l <= r) { m = (l + r) >> 1; if (a[i] + a[m] >= aux) { poz1 = m; r = m - 1; } else l = m + 1; } } } fout << res; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 615 ms | 11996 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 615 ms | 11996 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |