QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#848342 | #9989. Harmful Machine Learning | Graygoo | WA | 1ms | 3568kb | C++20 | 502b | 2025-01-08 19:44:28 | 2025-01-08 19:44:30 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while(T--){
int n, x;
cin >> n >> x;
vector<long long> a(n);
for(auto &num: a) cin >> num;
// The BOT can always eventually reach the cell with the maximum a_i
// Thus, the answer is the maximum a_i
long long max_a = *max_element(a.begin(), a.end());
cout << max_a << "\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3568kb
input:
4 3 2 1 2 3 13 4 1 1 4 5 1 4 1 9 1 9 8 1 0 4 2 1 10 100 1000 1 1 114514
output:
3 9 1000 114514
result:
wrong answer 2nd lines differ - expected: '4', found: '9'