Submission #2558659
Source Code Expand
#include <algorithm> #include <cstring> #include <cstdio> using namespace std; const int S = 4e3; const int N = 4010; const int Mod = 998244353; int n, ans; bool c[N], g[N], d[N], r[7][N]; char cs[N]; inline int deg(bool *a) { for (int i = S; ~ i; --i) if (a[i]) return i; } inline void pls(bool *a, bool *b, int l) { for (int i = l; i <= S; ++i) a[i] = a[i] ^ b[i-l]; } inline void gcd(bool *a, bool *b, bool *d) { int da = deg(a), db = deg(b); if (da < db) swap(da, db), swap(a, b); if (!db && !b[0]) {for (int i = 0; i <= S; ++i) d[i] = a[i]; return;} pls(a, b, da - db), gcd(b, a, d); } template <class T> inline void in(T &x) { x = 0; int f = 1; char ch = getchar(); for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();} for (; ch>='0' && ch<='9';) x = x*10 + ch-'0', ch = getchar(); x *= f; } inline void red(bool *a) { int ls; scanf("%s", cs), ls = strlen(cs) - 1; for (int i = 0; i <= ls; ++i) a[i] = cs[ls - i] - '0'; } inline void work() { in(n), red(c); for (int i = 1; i <= n; ++i) red(r[i]); memset(g, 0, sizeof g); for (int i = 1; i <= n; ++i) { for (int j = deg(g); ~ j; --j) d[j] = g[j]; gcd(r[i], d, g); } int dc = deg(c), dgcd = deg(g); memset(d, 0, sizeof d); for (int i = dc; i >= dgcd; --i) if (d[i] ^ c[i]) pls(d, g, i - dgcd); ans = 0; for (int i = dc; i >= dgcd; --i) ans = ((ans << 1) + c[i]) % Mod; for (int i = dgcd - 1; ~ i; --i) if (d[i] < c[i]) break; else if (d[i] > c[i]) {--ans; break;} printf("%d", ans + 1); } int main() {work(); return 0;}
Submission Info
Submission Time | |
---|---|
Task | F - XorShift |
User | annoyrain |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1577 Byte |
Status | AC |
Exec Time | 113 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘void red(bool*)’: ./Main.cpp:31:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int ls; scanf("%s", cs), ls = strlen(cs) - 1; ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 50 ms | 256 KB |
02.txt | AC | 70 ms | 256 KB |
03.txt | AC | 43 ms | 256 KB |
04.txt | AC | 63 ms | 256 KB |
05.txt | AC | 70 ms | 256 KB |
06.txt | AC | 70 ms | 256 KB |
07.txt | AC | 28 ms | 256 KB |
08.txt | AC | 70 ms | 256 KB |
09.txt | AC | 70 ms | 256 KB |
10.txt | AC | 23 ms | 256 KB |
11.txt | AC | 70 ms | 256 KB |
12.txt | AC | 31 ms | 256 KB |
13.txt | AC | 70 ms | 256 KB |
14.txt | AC | 71 ms | 256 KB |
15.txt | AC | 36 ms | 256 KB |
16.txt | AC | 11 ms | 256 KB |
17.txt | AC | 68 ms | 256 KB |
18.txt | AC | 56 ms | 256 KB |
19.txt | AC | 58 ms | 256 KB |
20.txt | AC | 35 ms | 256 KB |
21.txt | AC | 62 ms | 256 KB |
22.txt | AC | 26 ms | 256 KB |
23.txt | AC | 13 ms | 256 KB |
24.txt | AC | 29 ms | 256 KB |
25.txt | AC | 46 ms | 256 KB |
26.txt | AC | 28 ms | 256 KB |
27.txt | AC | 16 ms | 256 KB |
28.txt | AC | 11 ms | 256 KB |
29.txt | AC | 3 ms | 256 KB |
30.txt | AC | 1 ms | 256 KB |
31.txt | AC | 70 ms | 256 KB |
32.txt | AC | 6 ms | 256 KB |
33.txt | AC | 113 ms | 256 KB |
34.txt | AC | 61 ms | 256 KB |
35.txt | AC | 3 ms | 256 KB |
36.txt | AC | 25 ms | 256 KB |
37.txt | AC | 54 ms | 256 KB |
38.txt | AC | 10 ms | 256 KB |
39.txt | AC | 58 ms | 256 KB |
40.txt | AC | 48 ms | 256 KB |
41.txt | AC | 24 ms | 256 KB |
42.txt | AC | 17 ms | 256 KB |
43.txt | AC | 29 ms | 256 KB |
44.txt | AC | 29 ms | 256 KB |
45.txt | AC | 4 ms | 256 KB |
46.txt | AC | 16 ms | 256 KB |
47.txt | AC | 4 ms | 256 KB |
48.txt | AC | 11 ms | 256 KB |
49.txt | AC | 2 ms | 256 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
53.txt | AC | 1 ms | 256 KB |
54.txt | AC | 21 ms | 256 KB |
55.txt | AC | 41 ms | 256 KB |
56.txt | AC | 61 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 128 KB |