QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#501413 | #5154. ETA | zmrzmr | TL | 3ms | 7596kb | C++20 | 1.4kb | 2024-08-02 18:00:57 | 2024-08-02 18:01:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
int dep[N];
int main()
{
int a,b;
char c;
cin>>a>>c>>b;
int sum = a;
int point = b-1;
int j = 1;
int cnt_ci = 0 ;
if(sum - point < 0 )
{
cout<<"impossible"<<endl;
return 0;
}
while(1)
{
// if(cnt_ci > 5)
// {
// cout<<"impossible"<<endl;
// return 0;
// }
for(int i = 1 ; i <= point ; i ++ )
{
if( sum - (point * i) < 0 )
{
dep[i] = point ;
int tem = point*i - sum ;
sum = sum - (point * i);
dep[i]-=tem;
dep[i-1]+=tem;
break;
}
else
{
sum-=i;
point -= 1 ;
dep[i] = 1 ;
continue;
}
}
if(sum>0)
{
cnt_ci++;
j+=999;
sum = 1000*a;
point = 1000*b - 1 ;
memset(dep,0,sizeof(dep));
}
else break;
}
int sum_ed = 0 ;
int cnt_dep = 0;
for(int i = 1; dep[i] ; i++ )
{
sum_ed+=dep[i];
cnt_dep++;
}
int cnt = 0;
// for(int i = 1 ; dep[i] ; i++ )
// cout<<dep[i]<<" ";
cout<<j*b<<" "<<sum_ed<<endl;
int temcnt;
for(int i = 1; i <= cnt_dep ; i++)
{
if(dep[i] == 1)
{
cnt++;
cout<<cnt<<" "<<cnt+1<<endl;
}
else
{
cnt++;
for(int j = 1 ; j <= dep[i] ; j++)
{
cout<<cnt<<" "<<cnt+j<<endl;
temcnt = cnt + j ;
}
break;
}
}
int tt=temcnt + 1 ;
cnt++;
for(int i = 1 ; i <= dep[cnt] ; i++ )
{
cout<<cnt<<" "<<tt<<endl;
tt++;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
input:
1/2
output:
2 1 1 2
result:
ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
1/3
output:
impossible
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 7588kb
input:
7/4
output:
4000 3999 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 #4:
score: 0
Accepted
time: 1ms
memory: 3692kb
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: 3560kb
input:
943/346
output:
346 345 1 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 2 25 2 26 2 27 2 28 2 29 2 30 2 31 2 32 2 33 2 34 2 35 2 36 2 37 2 38 2 39 2 40 2 41 2 42 2 43 2 44 2 45 2 46 2 47 2 48 2 49 2 50 2 51 2 52 2 53 2 54 2 55 2 56 2 57 2 58 2 59 2 60 2 61 ...
result:
ok
Test #6:
score: 0
Accepted
time: 3ms
memory: 7440kb
input:
912/7
output:
7000 6999 1 2 2 3 3 4 4 5 5 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 5...
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 7596kb
input:
1/1
output:
1000 999 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 #8:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
1/1000
output:
impossible
result:
ok
Test #9:
score: 0
Accepted
time: 1ms
memory: 3600kb
input:
1000/999
output:
999 998 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 #10:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
999/1000
output:
1000 999 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 #11:
score: -100
Time Limit Exceeded
input:
1000/1