QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#201359 | #5154. ETA | PhantomThreshold# | WA | 2ms | 3780kb | C++14 | 942b | 2023-10-05 13:56:23 | 2023-10-05 13:56:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A,B;
int main(){
ios_base::sync_with_stdio(false);
{
char ch;
cin >> A >> ch >> B;
ll g=__gcd(A,B);
A/=g;
B/=g;
}
for (ll k=1;k<=1000000/B;k++){
ll fz=A*k;
ll fm=B*k;
ll mn=k*(k+1)/2+(B*k-(k+1))*1;
ll mx=k*(k+1)/2+(B*k-(k+1))*k;
if (mn<=fz && fz<=mx){
vector<int> v(k+1,1);
ll sum=fz-mn;
ll cnt=fm-(k+1);
for (;cnt;cnt--){
if (sum>=k-1){
v[k]++;
sum-=k-1;
}
else{
v[1+sum]++;
sum=0;
}
}
// cout << fz << " " << "\n";
cout << fm << " " << fm-1 << "\n";
// for (int i=0;i<=k;i++) cout << v[i] << " \n"[i==k];
ll presum=1;
for (int i=1;i<=k;i++){
for (int j=1;j<=v[i];j++){
cout << presum << " " << presum+j << "\n";
}
presum+=v[i];
}
return 0;
}
}
cout << "impossible" << "\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3524kb
input:
1/2
output:
2 1 1 2
result:
ok
Test #2:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
1/3
output:
impossible
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
7/4
output:
12 11 1 2 1 3 1 4 1 5 1 6 6 7 6 8 8 9 8 10 8 11 8 12
result:
ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
974/975
output:
975 974 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 ...
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
943/346
output:
1038 1037 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 6...
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
912/7
output:
987 986 1 2 1 3 1 4 1 5 1 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 ...
result:
ok
Test #7:
score: -100
Wrong Answer
time: 2ms
memory: 3608kb
input:
1/1
output:
impossible
result:
wrong output format Expected integer, but "impossible" found