QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#521862 | #6695. Matching | zzisjtu# | TL | 0ms | 3512kb | C++23 | 804b | 2024-08-16 15:57:02 | 2024-08-16 15:57:03 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
ll ans = 0;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> vis(n + 1);
for(int i = 1; i <= n; i++) {
if(!vis[i]) {
vector<int> g;
g.push_back(a[i]);
vis[i] = 1;
for(int j = i + 1; j <= n; j++) {
if(a[j] <= 0)continue;
if(vis[j])continue;
if(i - j == a[i] - a[j]) {
g.push_back(a[j]);
vis[j] = 1;
}
}
sort(g.begin(), g.end(), greater<>());
for(int u: g){
ans += u;
// cout << u << ' ';
}
// cout << endl;
if(g.size() % 2)ans -= g[g.size() - 1];
}
}
cout << ans << endl;
}
int main() {
int t = 1;
cin >> t;
while(t--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3512kb
input:
3 9 3 -5 5 6 7 -1 9 1 2 3 -5 -4 -3 3 1 10 100
output:
30 0 0
result:
ok 3 number(s): "30 0 0"
Test #2:
score: -100
Time Limit Exceeded
input:
5504 9 -1 -7 -6 -5 -4 -3 5 -1 0 5 999999995 999999993 999999995 999999995 999999995 5 3 -6 -5 -4 -2 4 -8 2 3 -5 4 -2 -1 0 1 9 -4 -9 3 -1 -1 -5 2 -3 -5 7 -1 -2 1 2 3 4 3 4 -2 5 2 -4 10 2 4 1 -3 -2 4 5 -3 0 -4 6 -1 0 1 2 4 -3 5 -4 -3 -2 -1 0 4 -1 0 1 2 8 1 0 -4 -1 0 -5 -3 -5 2 5 6 8 -4 -3 -2 -1 0 1 2 ...
output:
4 1999999988 0 5 -1 -2 11 0 9 3 0 3 0 11 2 9 0 1999999989 13 1 11 7 1999999981 40 0 11 0 5 0 0 7 9 0 14 4 3 0 7 23 0 5 1999999997 0 3 5999999976 3 16 5999999943 5999999933 5 0 11 0 6 12 0 5 8 3999999982 12 0 7 0 0 3 3 0 1999999994 3999999972 -2 0 16 0 0 0 3 2 0 8 0 5999999964 16 0 1 1999999995 26 0 ...