QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#375042 | #3727. Nice Trick | 秦始皇派蒙恬还原神舟十二 (Jiancong Wen, Chu Jin, Zekai Zhang) | WA | 72ms | 4392kb | C++17 | 1.2kb | 2024-04-02 21:07:48 | 2024-04-02 21:07:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int,int>
#define pis pair<string,int>
#define psi pair<int,string>
#define umap unordered_map
const int mod = 1e9 + 7;
int ai[300000];
void miss() {
int n;
int qwq = 0;
while(cin >> n) {
for(int i = 1; i <= n; i++) cin >> ai[i];
int qwq = 0,qaq = 0,qqq = 0;
for(int i = 2; i <= n; i++) {
qwq = qwq + ai[i];
qaq = qaq + (ai[i] % mod * ai[i] % mod);
qqq = qqq + (ai[i] % mod * ai[i] % mod * ai[i] % mod);
qwq = qwq % mod;
qaq = qaq % mod;
qqq = qqq % mod;
}
int ans = 0;
for(int i = 1; i <= n; i++) {
ans = ans + (ai[i] % mod * (qwq * qwq * qwq - 3 * qaq * qwq + 2 * qqq) % mod) % mod / 6;
ans = ans % mod;
qwq = qwq - ai[i + 1];
qaq = qaq - ai[i + 1] * ai[i + 1];
qqq = qqq - ai[i + 1] * ai[i + 1] * ai[i + 1];
if(qwq < 0) qwq += mod;
if(qaq < 0) qaq += mod;
if(qqq < 0) qqq += mod;
}
cout << ans % mod << endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n = 1;
//cin >> n;
while(n--) miss();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 72ms
memory: 4392kb
input:
100000 36967178 752077122 899978907 521018044 925360418 267380970 199698530 677842622 395705049 713493724 626147704 827554719 734174727 628149163 731456688 735932512 165335261 961529158 144189583 974116519 739012212 142215106 992295003 210685693 625600330 670647812 636190924 763436680 493995372 4735...
output:
229287007 -345437473 379826815 -82840999 16369762 -824413112 614544335 486621192 -478137913 -451039368
result:
wrong answer 1st numbers differ - expected: '882006095', found: '229287007'