QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#623494 | #8790. First Billion | rns_ksr# | TL | 4ms | 5960kb | C++14 | 1.8kb | 2024-10-09 12:24:04 | 2024-10-09 12:24:13 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __float128 ld;
#define pii pair<int, int>
#define fi first
#define se second
#define VI vector<int>
#define VII vector<vector<int> >
mt19937 rnd(time(0));
const int N = 500500;
const int inf = 1e9 + 100;
const ll infll = 2e18 + 500;
int a[N], vis[N];
double get_rnd() {
return 1.0 * rnd() / inf;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n / 2; i++) vis[i] = 1;
int s = 0;
for (int i = 1; i <= n / 2; i++) s += a[i];
for (int i = n / 2 + 1; i <= n; i++) s -= a[i];
int ps = 0;
int asdf = 0;
while (1) {
if (!s) break;
asdf++;
ps++;
double opt = 1e18;
int optu = -1, optv = -1;
for (int i = 1; i <= n; i++) {
int ss = s + a[i] * (vis[i] == 0 ? 2 : -2);
double score = abs(ss) * (1 / (get_rnd() + 0));
if (score < opt) {
opt = score;
optu = i, optv = -1;
}
}
for (int i = 1; i <= n; i++) if (vis[i] == 0) for (int j = 1; j <= n; j++) if (vis[j] == 1) {
int ss = s + 2 * a[i] - 2 * a[j];
double score = abs(ss) * (1 / (get_rnd() + 0));
if (score < opt) {
opt = score;
optu = i, optv = -1;
}
}
if (optu > 0) {
s += a[optu] * (vis[optu] == 0 ? 2 : -2);
vis[optu] ^= 1;
}
if (optv > 0) {
s += a[optv] * (vis[optv] == 0 ? 2 : -2);
vis[optv] ^= 1;
}
}
cerr << asdf << endl;
vector<int> ans;
for (int i = 1; i <= n; i++) if (vis[i]) ans.push_back(i);
cout << ans.size() << ' ';
for (auto e : ans) {
cout << e << ' ';
}
cout << '\n';
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 4ms
memory: 5960kb
input:
10 386413329 88494216 245947398 316438989 192751270 204627269 65749456 3938400 150458676 345180997
output:
5 1 5 6 7 9
result:
ok OK (n = 10)
Test #2:
score: 0
Accepted
time: 1ms
memory: 5704kb
input:
10 119486233 299942886 169540407 349937991 597883752 32230162 140514533 57341098 12602102 220520836
output:
5 1 3 4 7 10
result:
ok OK (n = 10)
Test #3:
score: -100
Time Limit Exceeded
input:
14 384615281 84612238 83310504 54746763 142296081 56775470 128760350 343006424 177232390 214368720 67220468 21895072 16352717 224807522