QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#283155 | #6695. Matching | Onlyfans | AC ✓ | 683ms | 8472kb | C++20 | 2.5kb | 2023-12-13 22:35:13 | 2023-12-13 22:35:14 |
Judging History
answer
//ADGIL
//-- Chivalrous
#include<bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector", 3)
#define endl '\n'
#define int long long
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define PII pair<int,int>
#define PIII pair<pair<int,int> , int>
#define x first
#define y second
#define pb push_back
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
#define SOLVE int T;cin >> T;while(T--) SV()
#define in insert
using namespace std;
int gcd(int a, int b) {if (b == 0) {return a;}return gcd(b, a % b);}
int lcm(int a, int b) {return a * b / gcd(a, b);}
int ksm(int a, int b, int p) {int res = 1;while(b){if(b & 1)res = res * a % p;b >>= 1;a = a * a % p;}return res;}
bool is_prime(int x){if(x < 2) return false; if(x == 2)return true;for(int i = 2; i * i <= x; i ++) if(x % i == 0)return false;return true;}
//ksm(a , p - 2, p);!(a % p) -> ok;
const int N = 100010;
void SV() {
unordered_map<int,int> mp;
int n;
cin >> n;
vector<int> a(n + 10);
vector<int> e[N];
for(int i = 1; i <= n; i ++) cin >> a[i];
int idx = 0;
for(int i = 1; i <= n; i ++) {
// cout << i - a[i] << endl;
if(!mp[i - a[i]]) {
mp[i - a[i]] = ++idx;
e[idx].push_back(a[i]);
// cout << 1 << endl;
}
else {
e[mp[i - a[i]]].push_back(a[i]);
}
}
for(int i = 1; i <= idx; i ++) sort(e[i].begin() , e[i].end() , greater<int>());
int ans = 0;
for(int i = 1; i <= idx; i ++) {
int m = e[i].size();
for(int j = 0; j + 1 < m; j += 2) {
int res = e[i][j] + e[i][j + 1];
if(res < 0) break;
else ans += res;
}
}
cout << ans << endl;
}
signed main(){IOS;SOLVE;}
/*
_ooOoo_
o8888888o
88" . "88
(| ^_^ |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
佛祖保佑AC,永无bug缠身
*/
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 5920kb
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: 0
Accepted
time: 683ms
memory: 8472kb
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 1 11 0 9 3 0 3 0 11 6 9 0 1999999989 13 1 11 7 1999999981 40 0 11 0 6 0 0 7 9 1 15 4 3 0 7 23 0 5 1999999997 0 3 5999999976 3 16 5999999943 5999999933 5 0 11 0 10 12 0 6 8 3999999982 12 0 7 0 0 3 3 0 1999999994 3999999972 1 0 16 0 0 0 7 2 0 8 0 5999999964 16 0 1 1999999995 28 0 54...
result:
ok 5504 numbers