QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#748437 | #9730. Elevator II | oloy | WA | 43ms | 3656kb | C++14 | 1.1kb | 2024-11-14 20:23:48 | 2024-11-14 20:23:50 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve() {
int n, f;
cin >> n >> f;
std::vector<std::tuple<int,int,int>> v(n), cur;
std::vector<int> ans;
int idx = 0;
for (auto &[x, y, id] : v) {
cin >> y >> x;
id = ++idx;
}
sort(v.begin(), v.end());
i64 res = 0;
vector<bool> ok(n + 1);
for (auto [x, y, id] : v) {
if (f <= y || y <= f && x > f) {
res += max(0, y - f);
res += x - y;
f = x;
ans.push_back(id);
} else {
res += x - y;
cur.emplace_back(x, y, id);
}
}
cout << res << '\n';
reverse(cur.begin(), cur.end());
for (int i : ans) {
cout << i << " ";
}
for (auto [x, y, id] : cur) {
cout << id << " ";
}
cout << "\n";
}
int main() {
ios::sync_with_stdio(0); // 取消C和C++标准流的同步
cin.tie(nullptr); // 解绑cin和cout
int t;
cin >> t;
while (t -- ) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
input:
2 4 2 3 6 1 3 2 7 5 6 2 5 2 4 6 8
output:
11 2 1 3 4 5 2 1
result:
ok ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 43ms
memory: 3648kb
input:
6100 19 52 51 98 2 83 40 58 96 99 39 55 72 94 15 17 4 15 48 99 2 99 77 78 35 77 44 62 79 81 30 31 1 48 48 76 68 99 60 66 6 19 44 53 64 92 17 28 67 98 9 99 40 65 16 27 99 100 15 56 4 6 24 97 84 96 47 49 37 38 77 79 13 40 13 92 71 100 47 93 90 91 72 81 15 48 32 71 19 17 95 99 10 23 18 100 90 93 52 92 ...
output:
525 5 3 13 19 17 12 11 14 2 6 1 10 4 18 9 16 15 7 8 210 3 1 6 2 4 5 422 7 9 15 6 2 16 8 14 13 10 12 5 4 11 1 3 756 2 19 9 14 18 12 15 7 11 13 16 5 4 6 10 3 1 8 17 244 3 10 14 4 5 6 8 2 12 11 9 1 15 13 7 432 17 3 16 19 15 5 14 20 12 9 13 7 2 11 6 1 18 10 4 8 104 3 1 4 2 193 6 2 4 3 8 1 7 5 9 1...
result:
wrong answer Participant's cost is 525, which is worse than jury's cost 524 (test case 1)