QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#777142 | #9629. 小 C 的神秘图形 | RUOHUI | WA | 1ms | 3964kb | C++20 | 1.3kb | 2024-11-23 23:00:32 | 2024-11-23 23:00:33 |
Judging History
answer
#include "bits/stdc++.h"
#define int long long
using namespace std;
#define PII pair<int, int>
const int N = 2e6 + 10, M = 2e6 + 10, mod = 998244353, inf = 1e18;
double eps = 1e-9;
int n, m;
int ksm(int a, int k)
{
int ans = 1;
while (k)
{
if (k & 1)
ans = ans * a % mod;
a = a * a % mod;
k >>= 1;
}
return ans;
}
void solve()
{
function<int(int, int, int)> get = [&](int n, int i, int j) -> int
{
if ((ksm(3, n - 1) <= i && 2 * ksm(3, n - 1) > i) || (ksm(3, n - 1) <= j && 2 * ksm(3, n - 1) > j))
{
if (n == 1)
return 1LL;
return get(n - 1, i % ksm(3, n - 1), j % ksm(3, n - 1));
}
return 0LL;
};
cin >> n;
int x = 0, y = 0;
string s;
cin >> s;
for (int i = n - 1; i >= 0; i--)
{
x += (s[n - i - 1] - '0') * pow(3, i);
}
cin >> s;
for (int i = n - 1; i >= 0; i--)
{
y += (s[n - i - 1] - '0') * pow(3, i);
}
// cout << x << " " << y << endl;
cout << get(n, x, y) << endl;
}
signed main()
{
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int T = 1;
// cin >> T;
while (T--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3772kb
input:
96 122100012110202022211102020101110122101010001012220001000222210100222112111020002212000222012022 010112102102202201211121022102211110211010101020001021100101110202100010112221022001101222101102
output:
0
result:
ok single line: '0'
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3964kb
input:
100 2101120010010021010112120010111111212001120112101221211001111101012021111111211111110120002210111111 1010111101111111121211011101011101111111011201111110112110001211101110200102102020021011111121221102
output:
0
result:
wrong answer 1st lines differ - expected: '1', found: '0'