QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #711186 | #9546. Recover Statistics | KKT89 | AC ✓ | 0ms | 3680kb | C++14 | 895b | 2024-11-05 01:31:44 | 2024-11-05 01:31:45 |
Judging History
answer
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }
inline double time() {
return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
vector<int> res(100, 1e9);
int a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < 50; ++i) {
res[i] = a;
}
for (int i = 50; i < 95; ++i) {
res[i] = b;
}
res[95] = res[96] = res[97] = res[98] = c;
cout << res.size() << "\n";
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << "\n";
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
50 95 99
output:
100 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 99 99 99 99...
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1 2 3
output:
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 1000000000
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1 999999998 999999999
output:
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999...
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
999999997 999999998 999999999
output:
100 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999...
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
893 114514 1919810
output:
100 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 11451...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed