QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #292095 | #6310. Dining Professors | luhanning | WA | 9ms | 4380kb | C++20 | 263b | 2023-12-27 18:06:09 | 2023-12-27 18:06:10 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 100010;
int b[N];
signed main()
{
int n,a;
cin >>n>>a;
int cnt = 0;
for(int i = 1;i <= n;i ++)
{
cin >>b[i];
}
cout<<a * a + (n - a) * (n - a);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
input:
5 2 1 0 1 0 1
output:
13
result:
ok 1 number(s): "13"
Test #2:
score: -100
Wrong Answer
time: 9ms
memory: 4380kb
input:
100000 33292 1 1 1 1 0 1 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 0 1 1 1 0 1 0 0 1 1 0 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 1 0 1 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 0 1 0 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 1 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 0 0...
output:
5558314528
result:
wrong answer 1st numbers differ - expected: '279236', found: '5558314528'