QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#642887 | #5301. Modulo Ruins the Legend | FWKnightship | WA | 7ms | 4400kb | C++17 | 1.6kb | 2024-10-15 16:51:48 | 2024-10-15 16:51:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using vec = array<LL, 2>;
constexpr LL M1 = 1145140019, M2 = 1145140033, pw = 23333;
// a * x % b == gcd(a, b)
void exgcd(LL a, LL b, LL &x, LL &y)
{
if (b == 0)
{
x = 1, y = 0;
return;
}
exgcd(b, a % b, y, x);
y -= a / b * x;
}
LL arr[100020];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
LL n, m;
cin >> n >> m;
LL n2 = n;
LL s = 0;
for (int i = 1; i <= n; ++i)
{
cin >> arr[i];
s += arr[i];
}
LL ss, dd;
if (n % 2)
{
LL g = gcd(n, m);
LL ans = s % g;
n /= g;
m /= g;
s /= g;
LL x, y;
exgcd(n, m, x, y);
// n * x % m == 1
ss = (x * (m - s) % m + m) % m;
cout << ans << "\n";
dd = 0;
}
else
{
LL nn = n;
n /= 2;
LL g = gcd(n, m);
LL ans = s % g;
n /= g;
m /= g;
s /= g;
LL x, y;
exgcd(n, m, x, y);
ss = (x * (m - s) % m + m) % m;
cout << ans << "\n";
if (ss % 2)
{
ss = ((ss - (nn + 1)) / 2 % m + m) % m;
dd = 1;
}
else
{
ss = (ss / 2 % m + m) % m;
dd = 0;
}
}
cout << ss << " " << dd;
/*LL jxy = 0;
for (int i = 1; i <= n2; ++i)
{
jxy += arr[i] + ss + dd * i;
jxy %= m;
}
cout << '\n' << jxy;*/
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
input:
6 24 1 1 4 5 1 4
output:
1 6 1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
7 29 1 9 1 9 8 1 0
output:
0 0 0
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1 1 0
output:
0 0 0
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
1 1000000000 963837005
output:
0 36162995 0
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
2 1 0 0
output:
0 0 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2 1000000000 948507269 461613424
output:
0 294939652 1
result:
ok ok
Test #7:
score: 0
Accepted
time: 3ms
memory: 4396kb
input:
100000 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
0 0 0
result:
ok ok
Test #8:
score: 0
Accepted
time: 7ms
memory: 4340kb
input:
100000 1000000000 253614966 278270960 980235895 498158918 928430170 216003119 852570558 948400590 239257296 897053667 294741176 38297441 382677590 406314557 609468973 854148232 314532767 738191551 158215002 5865825 920471826 380037058 356271728 749175327 28319049 208101105 953758995 896570758 521930...
output:
46613 14640 1
result:
ok ok
Test #9:
score: -100
Wrong Answer
time: 7ms
memory: 4400kb
input:
100000 998244353 561002596 498658036 721339539 63377827 532179242 934651519 234198881 490149304 2056307 499913682 427679408 694677560 516580968 300129454 816286800 688594301 183049581 456627420 495848352 273497462 953217060 796225499 207179832 728054671 409492082 25003432 810431468 206421553 5569626...
output:
0 260427722 0
result:
wrong answer Result not equal to solution.