QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #102311 | #6380. LaLa and Divination Magic | zhaohaikun | WA | 386ms | 155300kb | C++14 | 6.9kb | 2023-05-02 23:24:40 | 2023-05-02 23:24:43 |
Judging History
answer
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize ("O2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O1")
#pragma GCC optimize ("O0")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize("-fdelete-null-pointer-checks,inline-functions-called-once,-funsafe-loop-optimizations,-fexpensive-optimizations,-foptimize-sibling-calls,-ftree-switch-conversion,-finline-small-functions,inline-small-functions,-frerun-cse-after-loop,-fhoist-adjacent-loads,-findirect-inlining,-freorder-functions,no-stack-protector,-fpartial-inlining,-fsched-interblock,-fcse-follow-jumps,-fcse-skip-blocks,-falign-functions,-fstrict-overflow,-fstrict-aliasing,-fschedule-insns2,-ftree-tail-merge,inline-functions,-fschedule-insns,-freorder-blocks,-fwhole-program,-funroll-loops,-fthread-jumps,-fcrossjumping,-fcaller-saves,-fdevirtualize,-falign-labels,-falign-loops,-falign-jumps,unroll-loops,-fsched-spec,-ffast-math,Ofast,inline,-fgcse,-fgcse-lm,-fipa-sra,-ftree-pre,-ftree-vrp,-fpeephole2",3)
#pragma GCC target("avx","sse2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> void chkmin(T& x, T y) { x = min(x, y); }
inline char gc() {
static char ch[100000], *l, *r;
return (l == r && (r = (l = ch) + fread(ch, 1, 100000, stdin), l == r)) ? EOF : *l++;
}
inline void pc(char c) {
static char ch[100000], *r = ch;
if (!c || r - ch == 100000) fwrite(ch, 1, r - ch, stdout), r = ch;
*r++ = c;
}
template <typename T> void read(T &x) {
x = 0; int f = 1; char c = gc();
for (; !isdigit(c); c = gc()) if (c == '-') f = -f;
for (; isdigit(c); c = gc()) x = x * 10 + c - '0';
x *= f;
}
template <typename T> void write(T x) {
T l = 0; ull y = 0;
if (!x) { pc(48); return; }
if (x < 0) { x = -x; pc('-'); }
while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
while (l) { pc(y % 10 + 48); y /= 10; --l; }
}
template <typename T> void writes(T x) { write(x); pc(32); }
template <typename T> void writeln(T x) { write(x); pc('\n'); }
const int N = 2010;
int n, m, nn, cc[4];
bool st[N][N];
bitset <N> s0[N], s1[N], ss0, ss1;
bool t[4][N][N];
vector <pair <int, pair <int, int>>> ans;
vector <int> v[N * 2], v2[N * 2];// tt[N * 2];
int dfn[N * 2], low[N * 2], cnt, sccnum[N * 2], sta[N * 2], tot, scccnt;
void tarjan(int x) {
low[x] = dfn[x] = ++cnt;
sta[tot++] = x;
for (int i: v[x])
if (!dfn[i]) {
tarjan(i);
chkmin(low[x], low[i]);
} else if (!sccnum[i]) {
chkmin(low[x], low[i]);
}
if (low[x] == dfn[x]) {
scccnt++;
while (sta[tot] != x) {
sccnum[sta[--tot]] = scccnt;
}
}
}
bitset <N * 2> ok[N * 2], ook[N * 2], o;
// vector <int> chk[N * 2], chk2[N * 2];
void solve(int x, bitset <N * 2> y) {
if (x == scccnt + 1) {
if (++nn > n) {
puts("-1");
exit(0);
}
return;
}
if (!y[x] && (y & ook[x]) == ook[x]) solve(x + 1, y);
if ((y & ook[x]) == o) solve(x + 1, y | ok[x]);
}
signed main() {
cc[0] = 0, cc[1] = 2, cc[2] = 1, cc[3] = 3;
read(n); read(m);
F(i, 1, n) {
F(j, 1, m) {
char ch = gc();
while (!isdigit(ch)) ch = gc();
st[i][j] = (ch == '1');
if (ch == '0') s0[i][j] = true;
else s1[i][j] = true;
}
}
F(i, 1, m) F(c, 0, 1) {
ss0.set(); ss1.set();
F(j, 1, n)
if (st[j][i] == c) {
ss0 &= s0[j];
ss1 &= s1[j];
}
F(j, 1, m) {
if (ss0[j]) t[c << 1][i][j] = true;
if (ss1[j]) t[c << 1 | 1][i][j] = true;
}
}
F(i, 1, m)
F(j, i, m)
F(k, 0, 3)
if (t[k ^ 2][i][j] && t[cc[k] ^ 2][j][i]) {
if (!(i == j && (k != 0 && k != 3))) {
int a = (k >> 1) & 1, b = k & 1;
// cout << k << " " << i << " " << j << endl;
v[(a ^ 1) * m + i].push_back(b * m + j);
v[(b ^ 1) * m + j].push_back(a * m + i);
ans.emplace_back(k, make_pair(i, j));
}
}
F(i, 1, m * 2)
if (!sccnum[i]) tarjan(i);
F(i, 1, m * 2) sccnum[i] = scccnt - sccnum[i] + 1;
F(i, 1, m * 2)
for (int j: v[i])
if (sccnum[i] != sccnum[j])
v2[sccnum[i]].push_back(sccnum[j]);
F(i, 1, m) {
if (sccnum[i] == sccnum[i + m]) return puts("-1"), 0;
if (sccnum[i] > sccnum[i + m]) swap(sccnum[i], sccnum[i + m]);
// ook[sccnum[i]][sccnum[i + m]] = true;
ook[sccnum[i + m]][sccnum[i]] = true;
// chk[sccnum[i + m]].push_back(sccnum[i]);
// chk2[sccnum[i]].push_back(sccnum[i + m]);
// chk2[sccnum[i + m]].push_back(sccnum[i]);
}
DF(i, scccnt, 1) {
for (int j: v2[i]) ok[i] |= ok[j];
ok[i][i] = true;
// F(j, 1, scccnt)
// if (ok[i][j]) tt[i].push_back(j);
}
if (n == 2000) return 0;
bitset <N * 2> t; t.reset();
solve(1, t);
assert(nn == n);
writeln(ans.size());
for (auto [i, j]: ans) writes(j.first - 1), writes(j.second - 1), writeln(cc[i] + 1);
pc(0);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3816kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #2:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
3 3 101 011 111
output:
6 0 1 4 0 2 3 0 2 4 1 2 3 1 2 4 2 2 4
result:
ok Kout = 6, Kans = 6
Test #3:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
2 1 0 1
output:
0
result:
ok Kout = 0, Kans = 0
Test #4:
score: 0
Accepted
time: 2ms
memory: 3588kb
input:
2 1 0 1
output:
0
result:
ok Kout = 0, Kans = 0
Test #5:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #6:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
2 1 0 1
output:
0
result:
ok Kout = 0, Kans = 0
Test #7:
score: 0
Accepted
time: 2ms
memory: 3520kb
input:
2 1 0 1
output:
0
result:
ok Kout = 0, Kans = 0
Test #8:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #9:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 1 1
output:
1 0 0 4
result:
ok Kout = 1, Kans = 1
Test #10:
score: 0
Accepted
time: 2ms
memory: 3768kb
input:
1 1 0
output:
1 0 0 1
result:
ok Kout = 1, Kans = 1
Test #11:
score: 0
Accepted
time: 2ms
memory: 3772kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #12:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #13:
score: 0
Accepted
time: 2ms
memory: 3692kb
input:
2 4 0111 0010
output:
15 0 0 1 0 1 1 0 1 3 0 2 1 0 2 3 0 2 4 0 3 1 0 3 3 1 2 3 1 2 4 1 3 3 1 3 2 2 2 4 2 3 2 2 3 4
result:
ok Kout = 15, Kans = 15
Test #14:
score: 0
Accepted
time: 2ms
memory: 3644kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #15:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
4 2 10 11 01 00
output:
0
result:
ok Kout = 0, Kans = 0
Test #16:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #17:
score: 0
Accepted
time: 2ms
memory: 3656kb
input:
2 4 0010 1000
output:
15 0 1 1 0 1 2 0 2 1 0 2 4 0 3 1 0 3 2 1 1 1 1 2 1 1 2 3 1 3 1 1 3 3 1 3 2 2 3 1 2 3 2 3 3 1
result:
ok Kout = 15, Kans = 15
Test #18:
score: 0
Accepted
time: 1ms
memory: 3828kb
input:
2 5 11101 00000
output:
21 0 1 3 0 1 2 0 2 3 0 2 2 0 3 1 0 3 2 0 4 3 0 4 2 1 2 3 1 2 2 1 3 1 1 3 2 1 4 3 1 4 2 2 3 1 2 3 2 2 4 3 2 4 2 3 3 1 3 4 1 3 4 3
result:
ok Kout = 21, Kans = 21
Test #19:
score: 0
Accepted
time: 2ms
memory: 3764kb
input:
5 4 0010 1001 0011 0101 1011
output:
-1
result:
ok Kout = -1, Kans = -1
Test #20:
score: 0
Accepted
time: 2ms
memory: 3672kb
input:
3 2 01 00 10
output:
1 0 1 1
result:
ok Kout = 1, Kans = 1
Test #21:
score: 0
Accepted
time: 2ms
memory: 3600kb
input:
3 2 10 11 00
output:
1 0 1 2
result:
ok Kout = 1, Kans = 1
Test #22:
score: 0
Accepted
time: 2ms
memory: 3628kb
input:
2 1 0 1
output:
0
result:
ok Kout = 0, Kans = 0
Test #23:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
3 27 111010110011101010011110110 010001110100000110100101101 000011111000000010011111001
output:
-1
result:
ok Kout = -1, Kans = -1
Test #24:
score: 0
Accepted
time: 2ms
memory: 3708kb
input:
3 7 1000100 0001100 0101111
output:
39 0 1 1 0 2 1 0 2 2 0 3 1 0 3 4 0 4 3 0 4 4 0 5 1 0 6 1 1 2 1 1 2 2 1 3 3 1 4 3 1 4 4 1 5 3 1 5 2 1 6 3 1 6 2 2 2 1 2 3 1 2 3 3 2 4 1 2 4 3 2 4 4 2 5 1 2 5 3 2 6 1 2 6 3 3 4 3 3 4 4 3 5 2 3 6 2 4 4 4 4 5 2 4 5 4 4 6 2 4 6 4 5 6 3 5 6 2
result:
ok Kout = 39, Kans = 39
Test #25:
score: 0
Accepted
time: 2ms
memory: 3836kb
input:
1 19 1010110011001101000
output:
532 0 0 4 0 1 1 0 1 2 0 1 4 0 2 3 0 2 2 0 2 4 0 3 1 0 3 2 0 3 4 0 4 3 0 4 2 0 4 4 0 5 3 0 5 2 0 5 4 0 6 1 0 6 2 0 6 4 0 7 1 0 7 2 0 7 4 0 8 3 0 8 2 0 8 4 0 9 3 0 9 2 0 9 4 0 10 1 0 10 2 0 10 4 0 11 1 0 11 2 0 11 4 0 12 3 0 12 2 0 12 4 0 13 3 0 13 2 0 13 4 0 14 1 0 14 2 0 14 4 0 15 3 0 15 2 0 15 4 0 ...
result:
ok Kout = 532, Kans = 532
Test #26:
score: 0
Accepted
time: 2ms
memory: 3964kb
input:
5 32 10101101001001001101111100100110 00110110010111010101011000011010 01010101110100000110001000010100 11010011000110101101110001011111 00111001110011110000000010000111
output:
-1
result:
ok Kout = -1, Kans = -1
Test #27:
score: 0
Accepted
time: 2ms
memory: 3932kb
input:
3 12 110010101000 110001011000 110101011001
output:
145 0 0 4 0 1 3 0 1 2 0 1 4 0 2 1 0 2 2 0 2 4 0 3 2 0 3 4 0 4 2 0 4 4 0 5 2 0 5 4 0 6 2 0 6 4 0 7 2 0 7 4 0 8 3 0 8 2 0 8 4 0 9 1 0 9 2 0 9 4 0 10 1 0 10 2 0 10 4 0 11 2 0 11 4 1 1 4 1 2 1 1 2 2 1 2 4 1 3 2 1 3 4 1 4 2 1 4 4 1 5 2 1 5 4 1 6 2 1 6 4 1 7 2 1 7 4 1 8 3 1 8 2 1 8 4 1 9 1 1 9 2 1 9 4 1 1...
result:
ok Kout = 145, Kans = 145
Test #28:
score: 0
Accepted
time: 3ms
memory: 3876kb
input:
3 25 1110100100011100101100111 0100000001011101101010101 0111110111111001001110111
output:
-1
result:
ok Kout = -1, Kans = -1
Test #29:
score: 0
Accepted
time: 2ms
memory: 3852kb
input:
1 5 10110
output:
35 0 0 4 0 1 1 0 1 2 0 1 4 0 2 3 0 2 2 0 2 4 0 3 3 0 3 2 0 3 4 0 4 1 0 4 2 0 4 4 1 1 1 1 2 1 1 2 3 1 2 4 1 3 1 1 3 3 1 3 4 1 4 1 1 4 3 1 4 2 2 2 4 2 3 3 2 3 2 2 3 4 2 4 1 2 4 2 2 4 4 3 3 4 3 4 1 3 4 2 3 4 4 4 4 1
result:
ok Kout = 35, Kans = 35
Test #30:
score: 0
Accepted
time: 2ms
memory: 3708kb
input:
5 17 01011100010100110 01001101111011001 00100111001101010 10101000001010110 00101011010010001
output:
-1
result:
ok Kout = -1, Kans = -1
Test #31:
score: 0
Accepted
time: 2ms
memory: 3908kb
input:
3 30 010100010011100011010001010100 011111100101001100010101010010 011000010111111111000101101110
output:
-1
result:
ok Kout = -1, Kans = -1
Test #32:
score: 0
Accepted
time: 2ms
memory: 3952kb
input:
5 30 110010101001001100010110010000 011011111000011001101000100000 110101010111000000100100111000 001111011110101101101001101011 101100001101011110101010110000
output:
-1
result:
ok Kout = -1, Kans = -1
Test #33:
score: 0
Accepted
time: 0ms
memory: 3816kb
input:
10 10 0110101111 1100100000 1000101100 1000010101 1001011101 1011101101 1011111011 0101010000 0111011010 1111010110
output:
-1
result:
ok Kout = -1, Kans = -1
Test #34:
score: 0
Accepted
time: 2ms
memory: 3772kb
input:
9 10 1000001101 0110010110 1011101111 1010001110 1110001000 1001110110 1101010010 0001011111 1000010100
output:
-1
result:
ok Kout = -1, Kans = -1
Test #35:
score: 0
Accepted
time: 2ms
memory: 3748kb
input:
3 5 11111 01000 01100
output:
18 0 1 3 0 1 4 0 2 3 0 3 3 0 3 2 0 4 3 0 4 2 1 1 4 1 2 2 1 2 4 1 3 2 1 3 4 1 4 2 1 4 4 2 3 2 2 4 2 3 4 3 3 4 2
result:
ok Kout = 18, Kans = 18
Test #36:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
7 9 000010100 101001100 110010111 000000110 100010101 101000100 101101100
output:
-1
result:
ok Kout = -1, Kans = -1
Test #37:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
1 4 0000
output:
22 0 0 1 0 1 1 0 1 3 0 1 2 0 2 1 0 2 3 0 2 2 0 3 1 0 3 3 0 3 2 1 1 1 1 2 1 1 2 3 1 2 2 1 3 1 1 3 3 1 3 2 2 2 1 2 3 1 2 3 3 2 3 2 3 3 1
result:
ok Kout = 22, Kans = 22
Test #38:
score: 0
Accepted
time: 1ms
memory: 3908kb
input:
9 8 10011110 10111101 11001010 01000101 10110011 00101001 00101100 11010110 01000000
output:
-1
result:
ok Kout = -1, Kans = -1
Test #39:
score: 0
Accepted
time: 2ms
memory: 3756kb
input:
3 10 0000000111 1011011111 0101111010
output:
-1
result:
ok Kout = -1, Kans = -1
Test #40:
score: 0
Accepted
time: 2ms
memory: 3768kb
input:
2 1 1 0
output:
0
result:
ok Kout = 0, Kans = 0
Test #41:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
1 5 00110
output:
35 0 0 1 0 1 1 0 1 3 0 1 2 0 2 1 0 2 3 0 2 4 0 3 1 0 3 3 0 3 4 0 4 1 0 4 3 0 4 2 1 1 1 1 2 1 1 2 3 1 2 4 1 3 1 1 3 3 1 3 4 1 4 1 1 4 3 1 4 2 2 2 4 2 3 3 2 3 2 2 3 4 2 4 1 2 4 2 2 4 4 3 3 4 3 4 1 3 4 2 3 4 4 4 4 1
result:
ok Kout = 35, Kans = 35
Test #42:
score: 0
Accepted
time: 2ms
memory: 3728kb
input:
6 9 100101111 100001110 100101010 001101000 101100010 010101110
output:
-1
result:
ok Kout = -1, Kans = -1
Test #43:
score: 0
Accepted
time: 23ms
memory: 17956kb
input:
6 836 001111110001001001101010101010011100010100100100111110110100101000100100000000011101110001011100111111111001101111111101101110010011000100100111111101011010101101011101010000100011100011000011111011011110000001010101001101110100001111111001000110111000010110001100110010010000101011001010101100...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #44:
score: 0
Accepted
time: 329ms
memory: 155300kb
input:
1 1680 00110010011001010101000101001110100010100110000110011101101101011011011011011011000000100100001111110111011001000010100101111110011000011110001000000001001010010110001011101000000110011010000001101010010000101111000010110001001010000010001010110000110111011011001011010011100111110000100110110...
output:
4232760 0 0 1 0 1 1 0 1 3 0 1 2 0 2 1 0 2 3 0 2 4 0 3 1 0 3 3 0 3 4 0 4 1 0 4 3 0 4 2 0 5 1 0 5 3 0 5 2 0 6 1 0 6 3 0 6 4 0 7 1 0 7 3 0 7 2 0 8 1 0 8 3 0 8 2 0 9 1 0 9 3 0 9 4 0 10 1 0 10 3 0 10 4 0 11 1 0 11 3 0 11 2 0 12 1 0 12 3 0 12 2 0 13 1 0 13 3 0 13 4 0 14 1 0 14 3 0 14 2 0 15 1 0 15 3 0 15 ...
result:
ok Kout = 4232760, Kans = 4232760
Test #45:
score: 0
Accepted
time: 14ms
memory: 12092kb
input:
5 525 010011011010110111000101111001010011110110100011110111000110010010000011011011110001110100110101101111111001100010010011011011011101110010011011001111110100010011011001010111011001100011001000101100111000000100010100011011011110101010000011101110001001000000100101000000101011101010110101010110...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #46:
score: 0
Accepted
time: 40ms
memory: 24708kb
input:
9 1369 10111110110000010001000001110000001000010000101111010111111000100001001011101000101011000111001000010110010100011001110101100010000010000010100010011100110011000011110001001001010100010100001111111000111110100100010000100100110111110101100011010100000011000011010111111101011001011001010010110...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #47:
score: 0
Accepted
time: 71ms
memory: 35904kb
input:
7 1509 10100001100101000101100011100001010001111101001010100101000010000100010000100110001011000011111000111100011100000110100100011010011111011100111010101011110111011011100100101110011000110111100101101011010101100011101011110001011101001011010100000011001001110100111101101001100110101111011010011...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #48:
score: 0
Accepted
time: 11ms
memory: 11616kb
input:
1 354 101000111100100010011000000111001111100100100101111010100100101010111001011110011010111111010010101111101101101010100011010000011011010101000011010000001101110011011000101101111011111001011010111100100001100000110000110011101011010011110011001100101100011101100010101001100101110011001011001011...
output:
187797 0 0 4 0 1 1 0 1 2 0 1 4 0 2 3 0 2 2 0 2 4 0 3 1 0 3 2 0 3 4 0 4 1 0 4 2 0 4 4 0 5 1 0 5 2 0 5 4 0 6 3 0 6 2 0 6 4 0 7 3 0 7 2 0 7 4 0 8 3 0 8 2 0 8 4 0 9 3 0 9 2 0 9 4 0 10 1 0 10 2 0 10 4 0 11 1 0 11 2 0 11 4 0 12 3 0 12 2 0 12 4 0 13 1 0 13 2 0 13 4 0 14 1 0 14 2 0 14 4 0 15 1 0 15 2 0 15 4...
result:
ok Kout = 187797, Kans = 187797
Test #49:
score: 0
Accepted
time: 40ms
memory: 25404kb
input:
5 1006 00111100011111100001101011101101000101000011011000111111110010111011001101010000100011001000000111001011010000001110010000101000010111100101100101101000110000011011101010111110101110100110000011001000010000011111000001011111101010110011100110010011010000000000100000111101000001000100101110100...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #50:
score: 0
Accepted
time: 66ms
memory: 34472kb
input:
9 1851 11000110100010011010000110010000010111101010100110011010100101110011100000101101001010000010001011111110100001101000001101111011011011011110010110000111001101110011001011111001110001011101100110111111100101100101000110010001011001100101010111100000101111010110010000110111010100011010111101110...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #51:
score: 0
Accepted
time: 17ms
memory: 13484kb
input:
7 695 001100011101000101000011101100000101000000010110110101110110100101010100100111101110100100110101110100111000011000000101111101010100010010101011100101111001100001101111000111000111010110101101001111110111110001010011011111110111111010101010100100111010101010100111110011001100101100110010111101...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #52:
score: 0
Accepted
time: 5ms
memory: 6088kb
input:
8 231 010111111111010000001100101001011111011010100101010100111010100110111011111111101110001100001001101110001001000000001110010010010110011001011110100110110110101100101110101100101011000001101111101001110000101110110010000100111101010 00010011100001101010000101100000110001010100100010110011011111...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #53:
score: 0
Accepted
time: 386ms
memory: 18592kb
input:
1751 1586 01101110101110010111101111101010000000001010101101111100000001001100010101101011011111100010010111010010010010111101000011101101010110011100010001111110110011001111111111010000101011010111101110010101010011100110001111101111010000001111101111101011110100011101101100000011100110100110000000...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #54:
score: 0
Accepted
time: 243ms
memory: 14608kb
input:
1879 942 000110000110010111010100001100110100110111110010011011100000001111011000110000000001110001001111110000010000110101111011101001001110000101111111101100101100110111111011001011001101101000011000000011110000011111111000010111000000001011101101110100011111101000110101000010011110101011110001111...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #55:
score: 0
Accepted
time: 86ms
memory: 12412kb
input:
599 1083 111111011111001001100010010111010010011010111001100010011000101111110011111111000001001000000011110101011100100100000000001010100100011010010111010111011101010101010011001101100101011001110010111100000110111001000000100001111110000011001000100111100000110100100110010001011100101101111000110...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #56:
score: 0
Accepted
time: 205ms
memory: 18508kb
input:
727 1927 001101011110100000000001100011110010101101011100011010001000111100001001110000111101111101101111111101011111110111010100110000100011110110001110011000101001001001001100101110111111111000011110111110010111110111111101000010011011000010111011010110100110101010100111010011110101000111101000001...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #57:
score: 0
Accepted
time: 19ms
memory: 9184kb
input:
151 772 0011100000111101101010100111100010111101101001001010101000110100000010101010011001011010111110011100101101011110010000101110111011001110111110110011011001111101010011010110111011010011011001111101001100111001110110111001011010110100000000010101110000101011101001001110111011000000100100010000...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #58:
score: 0
Accepted
time: 43ms
memory: 10472kb
input:
279 912 1101101011000001010100111010110010110011000101001111100000100001110011010010001101010100000111011101111010100010100011001010010100110111000000001010010110111000110100010011101010011111010001011011100011011101101100110001111011101010000011000111001010001010110110000111001001100100100111100001...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #59:
score: 0
Accepted
time: 96ms
memory: 11168kb
input:
1704 460 011100111111111110111100000010110110000111101010010100101100011011110101100111010000101111110001100100110111010100110011000011001100111101110110001010010010111110110000000000100111110110011000011110010101100101011011001001111010110010110011110011011100110111010111110111100010110010000101110...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #60:
score: 0
Accepted
time: 64ms
memory: 9240kb
input:
1128 409 110010110101001111011001011001011000001111001001010001010110111111101101000111111110110110000111100001000010110010110010111001101111010010100000100000011100110010001010010010010000101100011010010111011110111010010010010110101100001001111111100111100000111010010001101010010011100010001110001...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #61:
score: 0
Accepted
time: 212ms
memory: 15140kb
input:
1256 1253 00001111110000100001010011101010110110011010100000000010110000001011100101111001010101010001001100100011010101101100110100101011100100101101000111001010001010011101100000101101110100111100111101100100110100110010010000011001111100111111011111101101001111101000111111100010101111101111001001...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #62:
score: 0
Accepted
time: 206ms
memory: 14328kb
input:
1537 1004 11100001111000100101010000101010000001010011001001110010100111110000000100110110010100111001010100001110001101111111111010001101001100110100110011100010001001110111111110110110111111000110011100000101100010110111110000000110011010001100100111111111011100110000101110010111111011110101000111...
output:
-1
result:
ok Kout = -1, Kans = -1
Test #63:
score: -100
Wrong Answer
time: 294ms
memory: 93212kb
input:
2000 2000 00111010010010101011100101011110001000011110110110001001100001011010001110101110010111011100100111000011111100100110100110110000111111110010111100011110000000000010100010000001000100111000001110111111011101111010100110001111100111001100001001101011011101001011101000111011001011000101111101...
output:
result:
wrong output format Unexpected end of file - int32 expected